Practical problems with the multiplication rule of combinatorics
If the first choice can be made in m ways and then the second choice in n ways, the total number of ways to make both choices one after another is m · n. This is the multiplication rule; it works in “both ... and” situations. For example, choosing an outfit from 3 shirts and 4 pairs of trousers can be done in 3 · 4 = 12 ways: 4 trousers with each shirt. When making numbers from digits it matters whether repetition is allowed: if so, each place has the same number of options; if not, the number of options drops by one each time.
| 1 | 2 | 3 | 4 | |
|---|---|---|---|---|
| 1 | 1–1 | 1–2 | 1–3 | 1–4 |
| 2 | 2–1 | 2–2 | 2–3 | 2–4 |
| 3 | 3–1 | 3–2 | 3–3 | 3–4 |
A cupboard lock has one letter wheel (A to E) and two digit wheels (0 to 9). There are 5 choices for the first wheel, 10 for the second and 10 for the third: 5 · 10 · 10 = 500 different codes. One more digit wheel makes ten times as many, so a longer code is safer.
A programmer estimates the number of possible passwords, a cook counts meal and drink combinations, and a trader counts colour and size options.
Invent a menu with 2 drinks and 3 snacks. Multiply to find how many drink-and-snack pairs there are, then check by listing them.
| 1 | 2 | 3 | |
|---|---|---|---|
| 1 | 11 | 12 | 13 |
| 2 | 21 | 22 | 23 |
| 3 | 31 | 32 | 33 |
“Choose an outfit”: pupils get 3 shirt cards and 4 trouser cards and make all outfits in a table or a tree diagram. They compare the count 12 with the multiplication rule.