The basic rule of combinatorics and its use in problems
Multiplication rule (the basic rule of combinatorics): if the first choice can be made in m ways and the second (after each first choice) in n ways, then the two choices in succession can be made in m · n ways. The rule extends to more than two stages: multiply the numbers of ways. Addition rule: if an object can be chosen in m ways or from another group in n ways, and the groups do not overlap, there are m + n ways in all. For numbers with distinct digits, each following place has one fewer possibility; also remember that 0 cannot stand first.
| Rule | When | Result |
|---|---|---|
| multiplication | successive choices | m · n |
| addition | or — separate groups | m + n |
At a school sports day each runner gets a code: one letter from A to E, then one digit from 1 to 9. The number of codes is 5 · 9 = 45, which is enough for 40 runners. The multiplication rule gave the number of options.
A security specialist counts password options, a designer of number plates works out how many combinations exist, and an organiser numbers participants so that every code is different.
Choose 4 letters and count all two-letter codes made from them (repetition allowed) with the multiplication rule, then write out the list to check.
“Combination lock”: pupils guess the number of possibilities for a 3-digit lock code, then compute it with the multiplication rule to check the guess.