Permutations
A permutation counts the ways to choose r items from n different items and put them in order. The first spot has n choices, and the second has because one item is used, so you multiply these. A different order counts as a different case.
Formulas
- (multiply r numbers, starting at n and going down by 1)
When to use it
Use it when order matters, such as lining people up, assigning seats, or choosing a president and a vice president.
Worked example
Choose a president and a vice president from 4 people. Step 1: any of the 4 people can be president, so 4 ways. Step 2: the vice president is one of the other 3, so 3 ways. Step 3: , so the answer is 12 ways.
Common mistake
If order does not matter, like picking 2 representatives, using a permutation counts (A, B) and (B, A) twice. Use a combination for those problems.