About the Permutation Calculator
When the order of selection matters - like ranking the top three finishers in a race - you need permutations, not combinations. Our Permutation Calculator finds nPr, the number of ordered arrangements of r items chosen from a set of n.
How It Works
The calculator multiplies n by each successively smaller integer down to (n − r + 1), the standard permutation formula that counts ordered arrangements without repetition.
Formula & Methodology
Think of filling r positions one at a time from n available items: the first position has n choices, the second has n−1 remaining choices (since one item is now used), the third has n−2, and so on down to (n−r+1) for the last position. Multiplying all those choices together gives the total count, and dividing n! by (n−r)! is a compact way of expressing exactly that same product - the (n−r)! in the denominator cancels out all the factors below (n−r+1) that shouldn't be counted.
Step-by-Step: Calculating It By Hand
- 1Confirm r does not exceed n (you can't select more items than exist).
- 2Calculate n factorial.
- 3Calculate (n − r) factorial.
- 4Divide n! by (n−r)! to find the number of ordered arrangements.
Examples
Race finishing order
Choosing an ordered 1st, 2nd, and 3rd place from 10 racers gives P(10,3) = 720 possible ordered outcomes.
Why order matters
The same 10 racers choosing an unordered group of 3 finalists (see our Combination Calculator) gives a much smaller number, since permutations count every different ordering of the same group separately.
Advantages
- Correctly calculates ordered arrangements, distinct from combinations
- Handles large n and r values efficiently
- Clear error handling when r exceeds n
- Standard tool for probability and statistics coursework
Common Mistakes
- Using permutations when combinations are actually needed (or vice versa) - the key question is always whether order matters
- Forgetting permutations grow extremely fast, producing very large numbers even for modest n and r
- Confusing nPr notation with other combinatorics notation
- Not validating that r doesn't exceed n before calculating
Edge Cases to Watch For
- When r equals n, the formula simplifies to n! itself, since (n−n)! = 0! = 1.
- When r equals 0, the result is always 1 - there's exactly one way to arrange zero items (do nothing).
- Permutation counts grow extremely fast for even modest n and r, since factorials increase explosively.
- This formula assumes no repetition (each item used at most once) - permutations with repetition allowed use a different, simpler formula (n^r).
Common Use Cases
- Calculating ordered arrangements for probability and statistics problems
- Determining possible outcomes when order matters (rankings, sequences, passwords)
- Combinatorics and discrete math coursework
- Real-world scenario analysis involving ordered selections