Overview
A permutation counts the ways to pick items when order matters, such as first, second and third place in a race. Without repetition, each item can be used only once.
Enter the total items, n, and how many are picked in order, r.
Worked examples
| Inputs | Result |
|---|---|
| Total Items (n)12Ordered Picks (r)5 | Permutations P(12, 5): 95,040 |
Show 2 more examples
| Total Items (n)8Ordered Picks (r)3 | Permutations P(8, 3): 336 |
| Total Items (n)10Ordered Picks (r)10 | Permutations P(10, 10): 3,628,800 |
Permutations by ordered picks
With the calculator's starting values, the permutations P(12, 5) is 95,040. The table shows how it changes with the ordered picks.
| Ordered Picks (r) | Permutations |
|---|---|
| 3 | 1,320 |
| 4 | 11,880 |
| 5starting value | 95,040 |
| 6 | 665,280 |
| 7 | 3,991,680 |
Other inputs: Total Items: 12 n. Change them in the calculator above for your own numbers.
How it works
There are n choices for the first pick, n − 1 for the second, and so on for r picks. That's n! ÷ (n − r)!. Dividing by r! would remove the order and give combinations instead.
The formula
| n | Items to choose from |
| r | Items picked, in order |
Practical tips
- Picking 5 in order from 12 gives 95,040 permutations.
- Gold, silver and bronze among 8 runners gives 8 × 7 × 6 = 336 outcomes.
- When r equals n, the answer is n!, every arrangement of all the items.
Frequently asked questions
Permutation or combination?
If swapping two picks makes a different outcome, use permutations. If not, use combinations.
What if items can repeat?
Use permutations with repetition, n^r, such as PIN codes.
Why is P(n, 0) equal to 1?
There's exactly one way to pick nothing.