Lesson 1 of 8 · 15 min

The multiplication and addition principles

Count outcomes without listing them. Multiply when a task happens in stages, and add when it splits into separate cases.

What you will be able to do

  • Use the multiplication principle to count the outcomes of a task done in stages.
  • Use the slot method for codes and arrangements, with and without repetition.
  • Use the addition principle to count outcomes that split into cases that cannot happen together.
  • Count the complement when it is easier than counting what you want.

A café near school has a lunch deal: one of 3 wraps and one of 2 drinks. How many different lunches can you order? With a menu this small you could list them. With 12 wraps, 8 drinks and 5 snacks you would not want to.

Counting is finding the total without writing every outcome down. Two simple rules do most of the work in this topic.

Each of the 3 wraps branches into the same 2 drinks: 3×2=63 \times 2 = 6 lunches.

Every wrap leads to the same 2 drink choices, so the tree has 3×2=63 \times 2 = 6 end points. Add a snack (2 choices) and each of those 6 lunches splits again: 3×2×2=123 \times 2 \times 2 = 12. You never need to draw the tree. Just multiply.

Key idea

The multiplication principle

If a task is done in stages, with n1n_1 ways to do the first stage, then n2n_2 ways to do the second (whatever happened in the first), and so on, then the whole task can be done in

n1×n2×⋯×nk ways.n_1 \times n_2 \times \cdots \times n_k \text{ ways.}

The word to listen for is and: a wrap and a drink and a snack.

Interactive

Build a lunch order

Change the number of options at each stage. One extra option at a stage adds a whole copy of every combination of the other stages.

A school uniform has 3 shirts, 2 pairs of shorts and 4 pairs of socks to choose from. How many different outfits of one shirt, one pair of shorts and one pair of socks are there?

The slot method. When you fill positions one at a time, such as the characters of a code or the places in a race, draw a box (a slot) for each position. Write the number of options for that position in its slot, then multiply.

A number plate made of three digits followed by three letters (like 123 ABC), where any digit and any letter can go in each position, has these slots:

Three digits then three letters, with repetition allowed: 10×10×10×26×26×26=17 576 00010 \times 10 \times 10 \times 26 \times 26 \times 26 = 17\,576\,000 plates.

If characters cannot repeat, each slot has one fewer option than the slot before it (for the same kind of character). Three different digits can fill three slots in 10×9×8=72010 \times 9 \times 8 = 720 ways.

A bike lock has a 4-digit code using the digits 0 to 9. How many codes are possible if no digit can be used twice?

The addition principle. Sometimes a task is not done in stages but in one of several separate ways. Suppose that to get from Brisbane to Sydney on a particular day, there are 6 flights that suit you and 1 train. You take one or the other, not both, so there are 6+1=76 + 1 = 7 ways to travel.

Key idea

The addition principle

If the outcomes split into cases that cannot happen at the same time (mutually exclusive cases), with mm outcomes in one case and nn in the other, then there are m+nm + n outcomes altogether. It extends to as many cases as you need.

The word to listen for is or: by plane or by train.

Stages: multiply

Every stage happens.

A wrap and a drink: 3×2=63 \times 2 = 6.

Cases: add

Exactly one case happens, and the cases cannot overlap.

Plane or train: 6+1=76 + 1 = 7.

Worked example

Locker codes in two formats

  • Simple familiar
  • Technology free

A school locker code is either two letters followed by two digits (such as KM47), or three digits (such as 905). Letters and digits may repeat. How many locker codes are possible?

4 steps

Try it yourself first, then check the working one step at a time.

Method

  1. Split the outcomes into cases that cannot overlap.

  2. Use slots and multiply within each case.

  3. Add the cases.

Watch out for

  • Multiplying the two cases, 67 600×100067\,600 \times 1000: that counts pairs of codes, not codes.

How many numbers with two or three digits can be made from the digits 1, 2, 3, 4 and 5 if digits may be repeated?

Tip

Count the complement

Every outcome either has a property or it doesn't, so by the addition principle

(outcomes with it)=(all outcomes)−(outcomes without it).\text{(outcomes with it)} = \text{(all outcomes)} - \text{(outcomes without it)}.

How many 3-digit codes (digits 0 to 9) have at least one repeated digit? Counting the repeats directly needs several cases. Instead: all codes 103=100010^3 = 1000, codes with no repeat 10×9×8=72010 \times 9 \times 8 = 720, so 1000−720=2801000 - 720 = 280 codes have a repeat.

Common mistake

Cases that overlap

The addition principle only works when the cases cannot both happen. The number of cards in a deck that are red or kings is not 26+4=3026 + 4 = 30: the 2 red kings are in both groups and get counted twice. The next lesson fixes this with inclusion–exclusion.

Exam tip

Show the structure

Write the slots or the product, not just the final number, and name the cases you add. For example, 26×26×10×10+10×10×10=68 60026 \times 26 \times 10 \times 10 + 10 \times 10 \times 10 = 68\,600. In a "determine" question, most of the marks are for this working.

Summary

  • Multiplication principle: a task in stages with n1,n2,…,nkn_1, n_2, \ldots, n_k options can be done in n1×n2×⋯×nkn_1 \times n_2 \times \cdots \times n_k ways. "And" means multiply.

  • Addition principle: counts of separate cases that cannot happen together are added. "Or" means add.

  • Slot method: one box per position, the number of options in each box, then multiply.

  • Without repetition, each slot has one fewer option than the slot before it.

  • Complement: outcomes with a property = all outcomes − outcomes without it.

  • Many problems need both principles: split into cases, multiply within each case, then add.

Finished the lesson?

Try the 3 quick checks above and the lesson completes itself, or mark it complete now.

Lesson 1 of 80% read

Save your progress with a free account