Solving combinatorial problems by listing choices
In combinatorial problems we must find the number of all ways (options) satisfying a condition. To skip no option and repeat none, we write them in an orderly way, for example in increasing order or grouped by the first element. Another convenient tool is the tree of options: from the root, a branch for each possibility of the first choice, and from each of these, branches for the next choice; the number of final ends of the tree is the number of all options. When making numbers from digits, the condition says whether repetition is allowed.
| Choice | Count |
|---|---|
| order matters (captain and assistant) | 4 · 3 = 12 |
| order does not matter (a pair) | 4 · 3 : 2 = 6 |
A club lesson needs a day and a time: Monday, Wednesday or Friday; morning or afternoon. A tree has 3 branches that each split in 2, giving 6 options in all.
A timetable planner looks at all ways to place lessons, a menu planner counts the possible meal sets, and a coach counts the possible team line-ups.
Draw a tree of all possible outcomes when a coin is tossed twice. How many outcomes are there?
| A | B | D | G | |
|---|---|---|---|---|
| A | — | AB | AD | AG |
| B | BA | — | BD | BG |
| D | DA | DB | — | DG |
| G | GA | GB | GD | — |
“Draw the tree”: groups draw on the board a tree of lunch options with two juices and three pastries and count all kinds of lunch.