Resources For Teachers For Tutors For Students & Parents Pricing
Year 9 Maths Probability and Statistics

Three-Step Experiments and Compound Events

20 practice questions 0 video lessons Theory + worked examples
Create a free accountTrack your progress and save your work as you go.
Create free account

Theory

A three-step experiment has three parts, such as three draws from a bag or three shots at goal, and each outcome is a compound event. This Year 9 maths page shows how to list all the outcomes with a three-stage tree diagram, multiply along a path, count the paths for "exactly", use the complement for "at least one", and change the branches at every stage when there is no replacement. It is Year 9 content in the Australian Curriculum. In the Victorian Curriculum three-step experiments are Level 10, so Victorian students can use this page as extension. Curriculum: VC2M10P02 (Level 10, extension) / AC9M9P01.

A simple event is one result of one step, such as rolling a \(6\). A compound event joins two or more simple events with "and" or "or", such as "a \(6\) on every roll" or "at least one \(6\)".

A three-step (three-stage) experiment has three parts. Each outcome is a list of three results, such as \(\text{RRB}\) for red, red, blue. The order matters: \(\text{RRB}\) and \(\text{RBR}\) are different outcomes.

The number of outcomes is the product of the number of results at each step. Three steps with \(2\) results each give \(2 \times 2 \times 2 = 8\) outcomes; steps with \(3\), \(2\) and \(4\) results give \(3 \times 2 \times 4 = 24\).

A three-stage tree diagram has a set of branches for each step. Every path crosses three branches. Multiply along a path; add the paths that make up the event.

With replacement (or for independent trials such as dice and coins) every stage has the same branches. Without replacement the total goes down by one at each stage, and so does the count of the item just taken.

Some trees stop early. If the experiment ends as soon as something happens, such as passing a test, that path has no more branches.

Three independent trialsA three-stage tree with branches S for success and F for failure at every stage, giving eight paths: SSS, SSF, SFS, SFF, FSS, FSF, FFS, FFF. The three paths with exactly two successes, SSF, SFS and FSS, are red and each has probability p squared times (1 minus p). S F S F S F S F S F S F S F SSS SSF p²(1 − p) SFS p²(1 − p) SFF FSS p²(1 − p) FSF FFS FFF
With the same chance \(p\) of success \(S\) at every stage, there are \(2 \times 2 \times 2 = 8\) paths. The three paths with exactly two successes (red) all have probability \(p^2(1-p)\).
The bag changes after each drawThree bags in a row. First bag: 6 red, 4 blue, P of red 6 tenths. After a red is removed, the second bag has 5 red, 4 blue, P of red 5 ninths. After another red is removed, the third bag has 4 red, 4 blue, P of blue 4 eighths. Below: P of red, red, blue equals 6 tenths times 5 ninths times 4 eighths equals one sixth. 6 red,4 blue1st drawP(R) = 6/10 5 red,4 blue2nd drawP(R) = 5/9 4 red,4 blue3rd drawP(B) = 4/8 P(RRB) = 6/10 × 5/9 × 4/8 = 1/6
Without replacement the bag changes after each draw: one fewer counter in total, and one fewer of the colour taken. \(P(\text{RRB}) = \dfrac{6}{10} \times \dfrac{5}{9} \times \dfrac{4}{8} = \dfrac{1}{6}\).

Multiply along a path, then add the paths in the event:

\[P(\text{path}) = P(1\text{st}) \times P(2\text{nd}) \times P(3\text{rd})\]
P(path)=P(1st)×P(2nd)×P(3rd)
\[P(\text{at least one}) = 1 - P(\text{none})\]
P(atleastone)=1−P(none)

Counting orders for three trials with success \(S\) and failure \(F\):

Three trialsPathsNumber of orders
all three succeedSSS1
exactly two succeedSSF, SFS, FSS3
exactly one succeedsSFF, FSF, FFS3
none succeedFFF1
Same chance every time. If each trial succeeds with probability \(p\), then \(P(\text{all three}) = p^3\), \(P(\text{none}) = (1-p)^3\) and \(P(\text{exactly two}) = 3 \times p^2 \times (1 - p)\).
First success on the third trial. That is one path only, \(FFS\): \(P = (1-p) \times (1-p) \times p\).
Without replacement. Three of the same type from a bag with \(a\) of that type out of \(n\): \(\dfrac{a}{n} \times \dfrac{a-1}{n-1} \times \dfrac{a-2}{n-2}\).
Highest number. "The highest of three rolls is \(5\)" means every roll is \(5\) or less, but not every roll is \(4\) or less: \(\left(\dfrac{5}{6}\right)^3 - \left(\dfrac{4}{6}\right)^3 = \dfrac{125 - 64}{216} = \dfrac{61}{216}\).
A tree that stops early. With up to three tries, "succeeds within three tries" is the paths \(S\), \(FS\) and \(FFS\). It is quicker to work out \(1 - P(FFF)\).

How to solve a three-step problem

  1. Write the probabilities for each step. Check whether they stay the same (with replacement, independent trials) or change (without replacement, or given as different).
  2. Draw the tree, or list the paths you need, such as SSF, SFS and FSS.
  3. Multiply along each path.
  4. Add the paths in the event. If they all have the same probability, multiply one path by the number of orders.
  5. Use the complement for "at least one": \(1 - P(\text{none})\).

Other question types

  1. Listing outcomes: the tree has one end branch for each outcome. Read the outcomes along the paths.
  2. Working backwards: write the probability with an unknown, set it equal to the value given and solve. For \(1 - (1-p)^3\), find \((1-p)^3\) first, then take the cube root.
  3. More of one type than another: list which counts work (for example \(3\) red, or \(2\) red and \(1\) blue) and add their probabilities.
  4. One of each of three types: the three results can come in \(3 \times 2 \times 1 = 6\) orders (for colours R, B and G: RBG, RGB, BRG, BGR, GRB, GBR). Every order has the same probability, so find one order and multiply by \(6\).
Example 1 — Listing the outcomes
A three-symbol code is made by choosing X or O at random for each symbol.
(i) List all the possible codes.
(ii) Find the probability that all three symbols are the same.
(iii) Find the probability that the first and last symbols match.
Solution
Three-stage tree for a code of X and OA tree diagram with three stages. Each stage has two branches, X and O, each with probability one half. The eight end branches give the outcomes XXX, XXO, XOX, XOO, OXX, OXO, OOX and OOO; XXX and OOO are red. 1st 2nd 3rd 1/2 X 1/2 X 1/2 X XXX 1/2 O XXO 1/2 O 1/2 X XOX 1/2 O XOO 1/2 O 1/2 X 1/2 X OXX 1/2 O OXO 1/2 O 1/2 X OOX 1/2 O OOO

(i) Read along each path: XXX, XXO, XOX, XOO, OXX, OXO, OOX and OOO. There are \(2 \times 2 \times 2 = 8\) equally likely codes.

(ii) All the same: XXX and OOO.

\(P(\text{all the same})\)\(=\)\(\dfrac{2}{8}\)
\(\)\(=\)\(\boldsymbol{\dfrac{1}{4}}\)
P=28=14

(iii) First and last match: XXX, XOX, OXO and OOO.

\(P\)\(=\)\(\dfrac{4}{8}\)
\(\)\(=\)\(\boldsymbol{\dfrac{1}{2}}\)
P=48=12
Example 2 — Exactly two, and the first miss
A netballer scores each shot with probability \(0.7\), independently. She takes \(3\) shots. Find the probability that she
(i) scores all three
(ii) scores exactly two
(iii) scores the first two and misses the third.
Solution

Score \(S\): \(0.7\). Miss \(M\): \(1 - 0.7 = 0.3\). Every stage is the same.

(i) One path, SSS.

\(P(\text{SSS})\)\(=\)\(0.7^3\)
\(\)\(=\)\(\boldsymbol{0.343}\)
P=0.7^3=0.343

(ii) The miss can be first, second or third: MSS, SMS, SSM. Each path has two \(0.7\)s and one \(0.3\).

\(P\)\(=\)\(3 \times 0.7^2 \times 0.3\)
\(\)\(=\)\(3 \times 0.147\)
\(\)\(=\)\(\boldsymbol{0.441}\)
P=3×0.147=0.441

(iii) This is one path only, SSM, because the order is fixed.

\(P(\text{SSM})\)\(=\)\(0.7 \times 0.7 \times 0.3\)
\(\)\(=\)\(\boldsymbol{0.147}\)
P=0.147
Example 3 — Three draws without replacement
A bag has \(6\) red and \(4\) blue counters. Three counters are drawn at random, one after the other, without replacement. Find
(i) \(P(\text{RRB})\), red then red then blue
(ii) the probability of exactly two red
(iii) the probability of at least one blue.
Solution

(i) After each draw, take one off the total and one off the colour drawn.

\(P(\text{RRB})\)\(=\)\(\dfrac{6}{10} \times \dfrac{5}{9} \times \dfrac{4}{8}\)
\(\)\(=\)\(\dfrac{120}{720} = \boldsymbol{\dfrac{1}{6}}\)
P=16

(ii) Exactly two red is RRB, RBR or BRR. Each path has the same numbers on top (\(6, 5, 4\)) and underneath (\(10, 9, 8\)), just in a different order, so each is \(\dfrac{1}{6}\).

\(P(\text{exactly two red})\)\(=\)\(3 \times \dfrac{1}{6}\)
\(\)\(=\)\(\boldsymbol{\dfrac{1}{2}}\)
P=3×16=12

(iii) The complement of "at least one blue" is RRR.

\(P(\text{RRR})\)\(=\)\(\dfrac{6}{10} \times \dfrac{5}{9} \times \dfrac{4}{8}\)
\(\)\(=\)\(\dfrac{1}{6}\)
\(P(\text{at least one B})\)\(=\)\(1 - \dfrac{1}{6} = \boldsymbol{\dfrac{5}{6}}\)
P=1−16=56
Example 4 — At least one, and working backwards
(i) Each turn in a game wins a prize with probability \(0.2\), independently. Find the probability of at least one prize in \(3\) turns.
(ii) In another game the chance of a prize on each turn is \(p\), and the probability of at least one prize in \(3\) turns is \(0.784\). Find \(p\).
Solution

(i) The complement of "at least one prize" is "no prize" on all three turns.

\(P(\text{none})\)\(=\)\(0.8^3 = 0.512\)
\(P(\text{at least one})\)\(=\)\(1 - 0.512\)
\(\)\(=\)\(\boldsymbol{0.488}\)
P=1−0.512=0.488

(ii) Write the same steps with \(p\), then solve.

\(1 - (1 - p)^3\)\(=\)\(0.784\)
\((1 - p)^3\)\(=\)\(0.216\)
\(1 - p\)\(=\)\(\sqrt[3]{0.216} = 0.6\)
\(p\)\(=\)\(\boldsymbol{0.4}\)
p=0.4

Check: \(1 - 0.6^3 = 1 - 0.216 = 0.784\) ✓

Common pitfalls

Count every order. "Exactly two" in three trials is three paths, such as SSF, SFS and FSS. Using only one of them gives an answer three times too small.
A fixed order is one path. "Scores the first two and misses the third" is SSM only. Do not multiply by the number of orders.
Change the numbers at every stage. Without replacement both the total and the count go down after each draw: \(\dfrac{6}{10}\), then \(\dfrac{5}{9}\), then \(\dfrac{4}{8}\).
At least one is not three times p. Three turns at \(0.2\) do not give \(0.6\). The correct value is \(1 - 0.8^3 = 0.488\).
Exactly is not at least. "At least two" means exactly two or exactly three. Leaving out the all-three path makes the answer too small.

Frequently asked questions

How many outcomes does a three-step experiment have?

Multiply the number of results at each step. Three steps with \(2\) results each give \(2 \times 2 \times 2 = 8\) outcomes.

What is a compound event?

A compound event combines two or more simple events, such as "red on every draw" or "at least one six". Its probability is found from all the outcomes that make it up.

How do you find the probability of exactly two out of three?

Find the probability of one order, such as success, success, failure, then add the other orders. In three trials there are \(3\) orders for exactly two successes.

How do you find the probability of at least one?

Work out the probability of none, then subtract it from \(1\). This needs only one path instead of seven.

How does a three-stage tree change without replacement?

At each new stage the total goes down by one, and the count of the item already taken goes down by one, so the fractions on the branches change from stage to stage.