- Foundation
- About 12 min
- 5 practice questions
The fundamental principle of counting
Count choices without listing them: use the multiplication principle for tasks done one after another and the addition principle for either-or choices, with and without repetition.
If something looks wrong, please tell us.
Counting sounds like the easiest thing in mathematics, until the number of possibilities becomes too large to list. How many outfits can you make from your clothes? How many three-digit codes can a lock have? Listing every case is slow and easy to get wrong. This lesson introduces the one idea on which the whole topic of permutations and combinations is built: the fundamental principle of counting. Learn it well and every later formula will make sense.
The multiplication principle
Suppose a task is done in two stages. If the first stage can be done in m ways, and for each of those the second stage can be done in n ways, then the whole task can be done in m × n ways. The same idea extends to any number of stages: multiply the number of ways at each stage.
Why multiply? Picture a tree. From the start, m branches go out for the first stage. From the end of each of those, n branches go out for the second stage. The number of complete paths is m groups of n, which is m × n.
Worked example 1: outfits
Ravi has 3 shirts and 4 pairs of trousers. How many different outfits of one shirt and one pair of trousers can he make? Stage 1, choose a shirt: 3 ways. Stage 2, choose trousers: 4 ways for each shirt. Total 3 × 4 = 12 outfits.
With and without repetition
Pay attention to whether something can be used again. Using the digits 1, 2, 3, 4, 5, how many three-digit numbers can be made? If repetition is allowed, each of the three places has 5 choices, so there are 5 × 5 × 5 = 125 numbers. If repetition is not allowed, the hundreds place has 5 choices, the tens place has only 4 left, and the units place has 3 left, so there are 5 × 4 × 3 = 60 numbers. The word "different" or "no digit repeated" in a question tells you the choices shrink at each stage.
Worked example 2: a place with a condition
How many three-digit even numbers can be made from the digits 1, 2, 3, 4, 5, 6 if digits may be repeated? Fill the place with the condition first. The units digit must be even: 2, 4 or 6, so 3 ways. The hundreds and tens places can each be any of 6 digits. Total 6 × 6 × 3 = 108. Starting with the restricted place is a habit worth building: it prevents you from using up a choice that the condition needed.
Worked example 3: signals
There are 4 flags of different colours. A signal is made by hoisting 2 flags, one above the other. How many signals are possible? The top flag can be any of 4; the bottom must be a different flag, so 3 ways. Total 4 × 3 = 12 signals. Red above blue is a different signal from blue above red, so order matters here.
The addition principle
Sometimes a task is done in one way or another, not both. If the first way has m possibilities and the second has n, with no possibility counted in both, then the task can be done in m + n ways. For example, to travel from a town to a city you may take one of 3 buses or one of 2 trains. You take one vehicle, not a bus and a train, so there are 3 + 2 = 5 ways.
Stages one after another (AND): multiply. Separate alternatives (OR): add. Fill any restricted place first.
Choosing the right rule
- Ask: does the task need all the stages (multiply) or only one of the alternatives (add)?
- Ask: may an item be reused? If not, the number of choices falls by one at each stage.
- Ask: does any place have a condition? Fill that place first.
- For a small case, list the possibilities and check that your rule gives the same count.
Key takeaways
The multiplication principle counts tasks done in stages: multiply the ways at each stage. The addition principle counts either-or choices: add them. Repetition allowed keeps the number of choices the same at every stage; repetition not allowed reduces it by one each time. Conditions are handled by filling the restricted place first. In the next lesson we give the repeated multiplications n × (n − 1) × ... a short name, the factorial.
Check your understanding
-
1. A student has 5 pens and 3 notebooks. In how many ways can she choose one pen and one notebook?
- 15
- 8
- 125
- 243
Show answer
Answer: A. Two stages: 5 ways for the pen and 3 for the notebook, so 5 × 3 = 15.
-
2. A lock has three dials, each showing a digit 0 to 9. How many different codes are possible?
- 720
- 1000
- 999
- 30
Show answer
Answer: B. Digits may repeat, so each dial has 10 choices: 10 × 10 × 10 = 1000.
-
3. How many three-digit numbers can be made from 1, 2, 3, 4, 5 if no digit is repeated?
- 125
- 10
- 60
- 120
Show answer
Answer: C. 5 choices for the first place, 4 for the second, 3 for the third: 5 × 4 × 3 = 60.
-
4. A reader wants one book, either one of 6 Hindi novels or one of 4 English novels. How many choices does she have?
- 24
- 2
- 64
- 10
Show answer
Answer: D. She takes one book from one group or the other, so add: 6 + 4 = 10.
-
5. Using the digits 1 to 6 with repetition allowed, how many three-digit even numbers can be formed?
- 216
- 108
- 60
- 72
Show answer
Answer: B. The units digit has 3 even choices; the other two places have 6 each: 6 × 6 × 3 = 108.
Sign in to keep track of the lessons you finish.