Counting outcomes is easier when you organize the possibilities before trying to count them. A list, table, or tree can make sure that every allowed outcome appears once and that none is missed.
An outcome includes every choice
Suppose you choose one of two shirts, blue or green, and one of three hats, red, white, or black. “Blue” alone is not a complete outfit: the hat must be specified too.
A table keeps the combinations organized:
| Shirt | Red hat | White hat | Black hat |
|---|---|---|---|
| Blue | Blue, red | Blue, white | Blue, black |
| Green | Green, red | Green, white | Green, black |
There are three outfits for each of two shirts, giving outfits. This is the multiplication principle: multiply the number of choices at each stage when each stage has the stated number of options.
Example: a three-stage choice
A lunch includes one of 3 sandwiches, one of 2 drinks, and one of 4 fruits. For each sandwich there are 2 drink choices, so there are sandwich-and-drink pairs. Each pair can accompany 4 fruits, giving lunches.
A tree diagram would start with three sandwich branches, split each into two drink branches, and then split each of those into four fruit branches. Each complete path from start to finish represents one lunch. Count the endpoints, not every branch along the way.
Adding would count the individual menu items, not the possible lunches. Multiply for choices that must be combined; add for separate cases that do not overlap.
Example: restrictions change the options
How many two-digit numbers can you make from 1, 2, 3, and 4 if no digit may repeat? There are 4 choices for the tens digit. Once it is chosen, only 3 choices remain for the ones digit. Thus there are numbers.
If repetition were allowed, there would be The difference comes from the rule, not from a different counting method. Also, 12 and 21 are different numbers, so order matters in this problem.
If zero is available, it cannot be the first digit of a two-digit number. Write the first-position restriction before multiplying. A code may allow an initial zero even when a number does not.
Count separate cases without overlap
Suppose a snack is either a fruit from 4 choices or a yogurt from 3 choices. You choose only one snack, so there are choices. If you choose one fruit and one yogurt, there are instead pairs.
The words “or” and “and” can help, but understand the choices rather than treating words as automatic commands. If two cases share outcomes, adding their counts double-counts the shared outcomes.
Try it yourself
A password has one letter chosen from A, B, or C, followed by two different digits chosen from 1, 2, 3, and 4. How many passwords are possible?
Answer: There are 3 letter choices, then 4 first-digit choices, then 3 second-digit choices. The total is The two digit positions have distinct roles, and the no-repeat restriction affects only the second digit.
What to remember
Define one complete outcome. Organize choices into stages, apply restrictions at the stage where they matter, and multiply the choices along a complete path.