Counting
Permutations and combinations.
Counting principles answer how many ways something can happen without listing every case. The multiplication principle says that if one choice has options and a second has , there are combined outcomes. Factorials, , count the ways to arrange distinct objects in a row.
The key question is whether order matters. Permutations count ordered selections, ; combinations count unordered selections, . Choosing a president and treasurer is a permutation; choosing a two-person committee is a combination.
Key terms
- Combination
- Unordered selections of r items from n.
Key ideas
- Multiplication principle for sequences of independent choices.
- Order matters: permutation; order does not matter: combination.
- .
- Arrangements with repeated letters: divide by the factorial of each repeat count.
Worked example
How many 3-person committees can be chosen from 10 people, and how many ways to pick a president, secretary and treasurer?
- Committee, order irrelevant: .
- Officers, order matters: .
- The ratio counts orderings of each committee.
Answer: committees, officer slates
Common mistakes
- Using permutations when order does not matter.
- Adding instead of multiplying across independent stages.
- Forgetting to divide by repeats when letters repeat.
Practice questions
Try each one, then open the answer. Numerical answers on this page are verified by an automated calculation check.
1.How many ways can 5 books be arranged on a shelf?
Show answer
2.Compute .
Show answer
3.How many distinct arrangements of the letters in LEVEL?
Show answer