Multi-Stage Experiments
Master multi-stage experiments for Queensland Year 11 Mathematical Methods (QCAA). When an experiment happens in stages, such as several draws or tosses, a tree diagram maps out every possible path.
You will learn to multiply probabilities along a branch and add across separate paths, handle selections made with and without replacement, and tackle "at least one" questions using the complement — versatile tools tested throughout QCAA probability.
Every question with a fully worked solution.
- Multi-Stage Experiments - Video - Multi stage experiments Watch
Theory
In Year 11 Mathematical Methods (QCAA, Unit 1 Topic 5), a multi-stage experiment has several steps modelled with a tree diagram or a sample-space array. You multiply probabilities along a branch and add across separate paths, taking care with without-replacement stages where the second denominator falls by one.
A tree diagram shows each stage of an experiment as a set of branches. The probability of a whole path is the product of the branch probabilities along it — this is the multiplication (AND) rule.
When a compound event can happen along several different paths, the paths are mutually exclusive, so you add their probabilities — the addition (OR) rule for separate paths.
With replacement (or independent stages) the probabilities do not change between stages. Without replacement (dependent stages) the second-stage probabilities change because one item has been removed — the denominator drops by one.
Multiply along a branch (path probability):
Add across separate paths for a compound event:
At least one via the complement:
How to solve a multi-stage problem
- Draw the tree: one set of branches per stage, with a probability on each branch.
- Adjust for replacement: if there is no replacement, reduce the counts and totals for the later stages.
- Multiply along each branch to get the path probabilities.
- Add across all paths that satisfy the event; for ‘at least one’, use \(1-P(\text{none})\).
With replacement, \(P(\text{red})=\dfrac{3}{5}\) each time. Multiply along the branch:
| \(P(RR)\) | \(=\) | \(\dfrac{3}{5}\times\dfrac{3}{5}\) |
| \(=\) | \(\dfrac{9}{25}\) |
\(P(\text{both red})=\dfrac{9}{25}\).
First red: \(\dfrac{3}{5}\). One red is kept out, leaving \(2\) red of \(4\):
| \(P(RR)\) | \(=\) | \(\dfrac{3}{5}\times\dfrac{2}{4}\) |
| \(=\) | \(\dfrac{6}{20}\) | |
| \(=\) | \(\dfrac{3}{10}\) |
\(P(\text{both red})=\dfrac{3}{10}\).
Path red then blue:
| \(P(RB)\) | \(=\) | \(\dfrac{3}{5}\times\dfrac{2}{4}\) |
| \(=\) | \(\dfrac{6}{20}\) |
Path blue then red:
| \(P(BR)\) | \(=\) | \(\dfrac{2}{5}\times\dfrac{3}{4}\) |
| \(=\) | \(\dfrac{6}{20}\) |
Add the two mutually exclusive paths:
| \(P(\text{one of each})\) | \(=\) | \(\dfrac{6}{20}+\dfrac{6}{20}\) |
| \(=\) | \(\dfrac{12}{20}\) | |
| \(=\) | \(\dfrac{3}{5}\) |
\(P(\text{one of each})=\dfrac{3}{5}\).
Probability of losing a single game:
| \(P(\text{lose})\) | \(=\) | \(1-\dfrac{1}{4}\) |
| \(=\) | \(\dfrac{3}{4}\) |
Probability of losing all three (multiply along):
| \(P(\text{no win})\) | \(=\) | \(\left(\dfrac{3}{4}\right)^3\) |
| \(=\) | \(\dfrac{27}{64}\) |
At least one win is the complement:
| \(P(\text{at least one win})\) | \(=\) | \(1-\dfrac{27}{64}\) |
| \(=\) | \(\dfrac{37}{64}\) |
\(P(\text{at least one win})=\dfrac{37}{64}\).
Common pitfalls
Frequently asked questions
How do you find the probability along a branch of a tree?
Multiply the probabilities on the branches that make up the path, for example \(P(RR)=\dfrac{3}{5}\times\dfrac{2}{4}\).
When do you add and when do you multiply?
Multiply along a single path (AND); add across separate mutually exclusive paths (OR).
What changes for drawing without replacement?
The item drawn is not returned, so the later totals and counts fall by one — the second denominator drops from \(5\) to \(4\).
How do you work out ‘at least one’?
Use the complement: \(P(\text{at least one})=1-P(\text{none})\), which is usually far quicker.
What is the difference between with and without replacement?
With replacement the stages are independent and probabilities stay the same; without replacement they change because an item is removed.
Do all the paths of a tree add to 1?
Yes — the products of all complete paths add to \(1\), which is a useful check.