Loading…
Calculate permutations (arrangements where order matters).
🎰 Permutations: arranging r items from n, order matters. Password possibilities use this.
A permutation counts how many ways to arrange r items from n, where order matters. Arranging 3 books on a shelf from 5 is different based on which order — that's a permutation.
P(n,r) = n! / (n−r)!. For arranging 3 from 5: 5! / 2! = 60.
The Permutation Calculator lets you figure out permutation calculatorinstantly, without reaching for a spreadsheet or doing the math by hand. Whether you're planning a budget, checking a loan, or working through homework, the tool applies the correct formula behind the scenes and shows the result the moment you enter your numbers.
Unlike a static chart or table, this calculator adapts to your exact inputs. You can adjust any value and see the outcome update in real time, which makes it easy to compare scenarios — for example, "what if the rate were 1% lower?" or "what if I paid an extra $50 a month?"
Common uses: people reach for this tool when they need to find a npr permutation calculator, permutation calculator with steps, arrangements where order matters, or how many ways to arrange.
Browser-based tools like this one have a few real advantages over installed software or manual methods:
The Permutation Calculator is based on the following formula:
P(n, k) = n! / (n − k)!
Variables: P(n, k) = Number of ordered arrangements of k from n n = Total items available k = Items arranged ! = Factorial: n! = n × (n−1) × … × 1
Number of ordered arrangements of k items chosen from n. Unlike combinations, order matters, so P(n,k) ≥ C(n,k).
Worked example: Step 1: Gold, silver, bronze among 8 runners: n = 8, k = 3. Step 2: 8! = 40,320; (8 − 3)! = 5! = 120. Step 3: P(8, 3) = 40,320 / 120 = 336. Result: 336 possible podium orders.
More tools you might find useful