Dependent events and probability trees
Dependent events remember what happened earlier. The most common signal is without replacement: an item leaves the bag, so the next probability must be updated.
Without replacement: update the bag
First red: 3/5
2R, 2B remain → next red 2/4 · blue 2/4
First blue: 2/5
3R, 1B remain → next red 3/4 · blue 1/4
P(two reds) = 3/5 × 2/4 = 3/10
Replacement decides whether the bag resets
- With replacement: the first item returns. Counts and probabilities reset, so random repeated draws are independent.
- Without replacement: one item has gone. The next denominator is one smaller and the relevant numerator may also change.
- At every tree node, the outgoing branch probabilities must add to 1.
Worked example
Two reds without replacement
A bag contains 3 red and 2 blue counters.
Common mistake
Multiply along a path; add alternative paths
- A complete path joins events with AND, so multiply its branches.
- Different successful paths are alternatives joined by OR, so add their path probabilities.
- For “at least one”, the complement of no successes is often shorter.
Worked example
One red and one blue in either order
The successful paths are RB and BR.
A tree condition is built from complete paths
- List every path satisfying the condition. Add their probabilities. This is the new denominator.
- Keep the paths satisfying target and condition. Add these probabilities for the numerator.
- Divide. Conditional probability is target-and-condition paths over all condition paths.
Worked example
A coin chooses how many marbles are drawn
A biased coin has . A bag contains 4 red and 5 blue marbles. After H, draw one; after T, draw two without replacement. The probability of at least one red is . (9709/52/M/J/24 Q2)
Worked example
Reverse a three-stage tree
A white counter is chosen with probability and sends us to a box with 4 red and 3 blue marbles. A yellow counter is chosen with probability and sends us to a box with 5 red and 3 blue marbles. Two marbles are then drawn without replacement. Let E mean one red and one blue. (9709/53/O/N/25 Q5)
- Find the success chance from each box. The two orders have equal products, so and .
- Weight the two boxes. The white-box contribution is . The yellow-box contribution is .
- Add every path in the condition. .
For , the numerator keeps only the two successful paths that began with white. The denominator keeps all four paths in E.
Examiner note
A bag contains 4 green and 3 yellow counters. Two are drawn without replacement. Find the probability of at least one green and the probability that the first counter was green, given that the two counters have different colours.
Show worked answer
.
The different-colour paths are GY and YG. Their probabilities are and .
Let F mean “first is green” and D mean “different colours”.
