Six original Cambridge-style questions on tree diagrams: with replacement, independent events, at least one, and Extended problems without replacement.
A fair coin is thrown twice. Find the probability of (a) two heads (b) one head and one tail.
The probability that Ali wins a game of chess is 0.65. He plays two games; the results are independent.
Find the probability that he wins (a) both games (b) neither game (c) at least one game.
A bag holds 2 white and 3 black balls. A ball is taken, replaced, and a second ball is taken.
Find the probability that the two balls are different colours.
(Extended) A box contains 6 milk and 4 dark chocolates. Two are taken at random without replacement.
Find the probability that (a) both are dark (b) at least one is milk.
On her way to work, Zara passes two sets of traffic lights. The probability that the first is red is 0.4 and that the second is red is 0.7, independently.
(a) Find the probability that she is stopped by at least one red light. (b) In 20 journeys, how many times would she expect to meet no red light?
(Extended) A bag contains \(x\) red counters and 4 blue counters. Two counters are taken at random without replacement. The probability that both are blue is \(\tfrac{2}{15}\).
Show that \(x^2 + 7x - 78 = 0\), and find the number of red counters.
Mark this once you have attempted all six and checked your working. It records a Practiced badge on the topic and adds a one-time bonus. Revealing the solutions alone does not count.