Introduction to Permutations
Arranging All Objects
In how many ways can 4 students (Anna, Ben, Carla, David) line up for a photo?
Identify what we're counting: We need to arrange all 4 students in a line where position matters = This is a permutation of 4 objects
Count choices for each position: 1st position: 4 choices\\2nd position: 3 remaining\\3rd position: 2 remaining\\4th position: 1 remaining = $4 \times 3 \times 2 \times 1$
Calculate using factorial: $4! = 4 \times 3 \times 2 \times 1$ = $4! = 24$
Interpret the result: There are 24 different ways to arrange 4 students = 24 arrangements
Answer: There are $4! = 24$ different ways to line up for the photo.
Selecting and Arranging (P(n,r))
A club has 8 members. How many ways can they elect a President, Vice President, and Secretary?
Identify the values: Total people: $n = 8$\\Positions to fill: $r = 3$\\Order matters (President is different from VP) = Use $P(8,3)$
Apply the permutation formula: $P(8,3) = \frac{8!}{(8-3)!} = \frac{8!}{5!}$ = $\frac{8!}{5!}$
Simplify the factorials: $\frac{8 \times 7 \times 6 \times 5!}{5!} = 8 \times 7 \times 6$ = $8 \times 7 \times 6$
Calculate: $8 \times 7 = 56$, then $56 \times 6 = 336$ = $336$
Answer: There are $P(8,3) = 336$ ways to elect the three officers.
Arranging Letters
How many 3-letter arrangements can be made from the letters A, B, C, D, E if no letter is repeated?
Identify the setup: 5 letters available, choosing 3, order matters, no repetition = $P(5,3)$
Count choices for each position: 1st letter: 5 choices\\2nd letter: 4 remaining\\3rd letter: 3 remaining = $5 \times 4 \times 3$
Calculate: $P(5,3) = 5 \times 4 \times 3 = 60$ = $60$
Verify with formula: $P(5,3) = \frac{5!}{2!} = \frac{120}{2} = 60$ \checkmark = Confirmed: 60
Answer: There are $P(5,3) = 60$ different 3-letter arrangements.
Race Finishing Order
In a race with 10 runners, how many different ways can the top 3 places (1st, 2nd, 3rd) be filled?
Recognize the permutation: 10 runners, 3 positions, order matters (1st is different from 2nd) = $P(10,3)$
Apply the shortcut: First position: 10 choices\\Second: 9 remaining\\Third: 8 remaining = $10 \times 9 \times 8$
Calculate step by step: $10 \times 9 = 90$, $90 \times 8 = 720$ = $720$
Answer: There are $P(10,3) = 720$ possible podium arrangements.
Mistake: Confusing permutations and combinations
Why: Permutations count arrangements where ORDER MATTERS. Combinations count selections where order doesn't matter.
Correct: Ask yourself: "Does rearranging change the outcome?" If selecting a committee (no positions), order doesn't matter = combination. If electing officers, order matters = permutation.
Mistake: Using the wrong formula direction: $\frac{(n-r)!}{n!}$ instead of $\frac{n!}{(n-r)!}$
Why: The larger factorial $n!$ goes on top because we start with more choices.
Correct: $P(n,r) = \frac{n!}{(n-r)!}$ — remember: $n!$ is always larger, so it goes in the numerator.
Mistake: Forgetting that $0! = 1$
Why: When arranging all n objects, we use $P(n,n) = \frac{n!}{0!} = \frac{n!}{1} = n!$
Correct: By definition, $0! = 1$. This makes the formula work when $r = n$.
Password Security
Understanding permutations helps us calculate password strength and security.
A 4-digit PIN using digits 0-9 without repetition has $P(10,4) = 5040$ possibilities.
Sports Tournament Brackets
Permutations determine possible outcomes in competitions where finishing position matters.
In a 6-team playoff, the possible final standings are $6! = 720$ different orders.
A permutation is an arrangement where **order matters**
To arrange all $n$ objects: use $n! = n \times (n-1) \times \cdots \times 1$
To arrange $r$ objects from $n$ objects: use $P(n,r) = \frac{n!}{(n-r)!}$
Quick method: multiply $n \times (n-1) \times \cdots$ for $r$ terms
Remember: $0! = 1$ by definition
Q: How do I know when to use permutations vs combinations?
A: Ask: "Does the order matter?" If electing a President AND Vice President = permutation (order matters). If choosing 2 people for a committee = combination (order doesn't matter).
Q: Why is $0! = 1$?
A: By convention, $0! = 1$ because there's exactly ONE way to arrange zero objects (do nothing). It also makes formulas like $P(n,n) = \frac{n!}{0!} = n!$ work correctly.
Q: What does $P(n,r)$ mean in words?
A: P(n,r) means: "The number of ways to select AND arrange r objects from n objects." For example, $P(5,3)$ = ways to choose and order 3 items from 5.
Introduction to Permutations
1 / 12
Introduction to Permutations
Learn how to count arrangements where order matters using permutations.