Selections: Combinations
When order does not matter, count with . Split selections into cases, use "at least one total none", and turn counts into probabilities by dividing by the total number of selections.
Learning objectives
- Know when to use (selection) rather than (arrangement).
- Count selections from several groups by multiplying, and add over separate cases.
- Handle "at least", "must include" and "refuse to serve together".
- Find probabilities as (favourable selections) (all selections).
From friends you choose to come to a concert. Is choosing "Ali then Bilal" different from choosing "Bilal then Ali"? How does that change the count compared with arranging of ?
Core idea
Choosing a team of 2 from Ali, Bea, Cal, Dev: is "Ali and Bea" different from "Bea and Ali"? No. When order doesn't matter, every arrangement is overcounted, and dividing it out gives the number of combinations.
The number of ways to choose from (order irrelevant) is . For "at least" problems, add cases or use the complement.
1. From permutations to combinations
- Ordered selections.
- Its internal orderings.
- Divide.
2. Committees
A committee of 5 from 6 men and 4 women must contain at least 2 women. How many ways?
- Goal
- Count.
- Strategy
- Cases (2, 3, 4 women), checked by complement.
- 2W 3M.
- 3W 2M; 4W 1M.
- Add cases (they don't overlap).
- Complement check.
Choose 3 from 5 red and 4 blue counters. P(exactly 2 red)?
- Goal
- Probability.
- Strategy
- Favourable selections ÷ all selections.
- Favourable.
- Total.
Why is ?
Summary
- Order matters: ; not: .
- Cases or complement for "at least".
- Combination
- A selection, order irrelevant.
Create a free account to read the rest of this lesson: key formulae, worked examples, explore the graph, common mistakes, exam tip, guided practice and more. Your answers are checked and your progress is saved.