What is a Permutation?
A permutation is an ordered arrangement of items. P(n,r) gives the number of ways to arrange r items chosen from n items, where the order matters.
P(n, r) = n! / (n â r)!
P(10, 3) = 10! / 7! = 10 Ã 9 Ã 8 = 720
P(10, 3) = 10! / 7! = 10 Ã 9 Ã 8 = 720
When Order Matters: Use Permutations
- Number of ways to arrange 3 people in 3 seats from 10 people
- First, second, third place in a race from 8 runners
- 4-digit PIN codes from 10 digits (with repetition not allowed)
Permutation vs Combination â Key Difference
| Feature | Permutation P(n,r) | Combination C(n,r) |
|---|---|---|
| Order matters? | YES | NO |
| ABC = BCA? | Different arrangements | Same selection |
| Formula | n!/(nâr)! | n!/[r!(nâr)!] |
| P(5,2) | 20 arrangements | C(5,2)=10 selections |
| Use when | Rankings, codes, sequences | Teams, groups, sets |
Worked Examples
Example 1 â Race Podium
8 runners, find P(Gold, Silver, Bronze):
P(8,3) = 8Ã7Ã6 = 336 ways
P(8,3) = 8Ã7Ã6 = 336 ways
Example 2 â Password
4-digit PIN from digits 0â9 (no repeat):
P(10,4) = 10Ã9Ã8Ã7 = 5,040 combinations
(With repeats allowed: 10âī = 10,000)
P(10,4) = 10Ã9Ã8Ã7 = 5,040 combinations
(With repeats allowed: 10âī = 10,000)
Example 3 â Arrangement
Arrange all 5 letters A,B,C,D,E:
P(5,5) = 5! = 120 arrangements
P(5,5) = 5! = 120 arrangements
Real-World Applications
- Sports: Top-3 finishers in a race from 10 athletes = P(10,3) = 720
- Security: Combination lock (misnomer â actually a permutation!) with 3 numbers from 40: P(40,3)
- Scheduling: Ordering of tasks or appointments
- Cryptography: Counting possible arrangements in cipher systems
Permutations with Repetition
When items can be repeated (like digits in a PIN), the formula changes:
With repetition: nĘģ arrangements
4-digit PIN from 0â9 WITH repeats: 10âī = 10,000
4-digit PIN from 0â9 WITHOUT repeats: P(10,4) = 5,040
4-digit PIN from 0â9 WITH repeats: 10âī = 10,000
4-digit PIN from 0â9 WITHOUT repeats: P(10,4) = 5,040
Circular Permutations
When arranging n items in a circle (like people around a round table), we fix one position as reference, giving (nâ1)! arrangements instead of n!:
Circular permutations of n items = (n-1)!
6 people at a round table = 5! = 120 ways
(vs 6! = 720 for a straight line)
6 people at a round table = 5! = 120 ways
(vs 6! = 720 for a straight line)
Permutation Quick Reference
| n | P(n,1) | P(n,2) | P(n,3) | P(n,n)=n! |
|---|---|---|---|---|
| 3 | 3 | 6 | 6 | 6 |
| 4 | 4 | 12 | 24 | 24 |
| 5 | 5 | 20 | 60 | 120 |
| 6 | 6 | 30 | 120 | 720 |
| 10 | 10 | 90 | 720 | 3,628,800 |