Permutations
The number of ways to choose r items from n when the order matters, such as podium places or PIN-style codes without repeats.
Calculator
The live calculator needs JavaScript. The worked example below shows the same steps it would.
What the symbols mean
- the number of ordered arrangements, also written
- the number of items to choose from
- how many are chosen and placed in order (r ≤ n)
- n factorial: , with
When to use it
Use permutations when different orders count as different outcomes: first, second and third place; officers elected to named posts; arranging books on a shelf. If order does not matter (a hand of cards, a committee), use combinations instead. Repeats allowed (a 4-digit PIN) is simply .
Worked example
Ten runners are in a race. In how many ways can gold, silver and bronze be awarded? (n = 10, r = 3)
Start from the formula.
The (n − r)! cancels the tail of n!, leaving the top 3 factors: 10 choices for the first place, 9 for the second, and so on.
Answer 720 ways
Why it works
There are n choices for the first place, for the second, and so on down to for the r-th: multiply them. Writing that product as is just a compact way of stopping n! after r factors.
Common mistakes
- Using combinations when order matters: 120 groups of 3, but 720 ordered podiums.
- Computing instead of .
- Forgetting , so that (all n items in a row).