· H2 Mathematics — Ten-Year Series, worked ← All 10 questions

2018 A-Level · Paper 2 · Question 6

2018 H2 Maths Paper 2, Question 6

Probability 7 marks tree diagrams · paths
Download Paper 2 solutions (PDF)

Part (i)

2 marks

Since there are 99 endpoints A–I, every journey from S to an endpoint passes through exactly 88 junctions, and at each junction the bug independently takes the left fork (probability pp) or the right fork (probability qq). Finishing at the kk-th endpoint from the top (A being k=1k = 1, I being k=9k = 9) requires exactly (k−1)(k - 1) right forks and (9−k)(9 - k) left forks among these 88 junctions — moving one letter further down the row for each extra right fork taken.

D is the 44th endpoint, so reaching D requires exactly 33 right forks and 55 left forks. By independence of the junctions, any one such route has probability p5q3p^{5}q^{3}, and the number of such routes is the number of ways to choose which 33 of the 88 junctions are the right forks, (83)\binom{8}{3}.

P(bug finishes at D)P\left( \text{bug finishes at D} \right)
=(83)p5q3= \binom{8}{3}p^{5}q^{3}
=56p5q3.  (shown)= 56p^{5}q^{3}.\ \ \left( \text{shown} \right)

Part (ii)

4 marks

Let DkD_{k} be the probability that the bug finishes at the kk-th endpoint from the top, so

P(Dk)=(8k−1)p9−kqk−1,k=1,…,9.P\left( D_{k} \right) = \binom{8}{k - 1}p^{9 - k}q^{k - 1},\quad\quad k = 1,\ldots,9.

D is k=4k = 4; its immediate neighbours are C (k=3k = 3) and E (k=5k = 5).

Approach

Comparing P(Dk+1)P\left( D_{k + 1} \right) with P(Dk)P\left( D_{k} \right) gives the ratio P(Dk+1)P(Dk)=9−kk⋅qp\frac{P\left( D_{k + 1} \right)}{P\left( D_{k} \right)} = \frac{9 - k}{k} \cdot \frac{q}{p}, which is strictly decreasing in kk. This means the sequence P(D1),…,P(D9)P\left( D_{1} \right),\ldots,P\left( D_{9} \right) increases and then decreases (it has a single peak), so it is enough to check that P(D)P(D) exceeds its two neighbours C and E — this then guarantees P(D)P(D) exceeds every other endpoint’s probability as well, without checking each one individually.

Comparing D with C:

P(D)P(C)=56p5q328p6q2=2qp.\frac{P(D)}{P(C)} = \frac{56p^{5}q^{3}}{28p^{6}q^{2}} = \frac{2q}{p}.

We need P(D)>P(C)P(D) > P(C), i.e. 2qp>1\frac{2q}{p} > 1:

2q>p2q > p
⇒2(1−p)>p\Rightarrow 2(1 - p) > p
⇒2>3p\Rightarrow 2 > 3p
⇒p<23.\Rightarrow p < \frac{2}{3}.

Comparing D with E:

P(D)P(E)=56p5q370p4q4=4p5q.\frac{P(D)}{P(E)} = \frac{56p^{5}q^{3}}{70p^{4}q^{4}} = \frac{4p}{5q}.

We need P(D)>P(E)P(D) > P(E), i.e. 4p5q>1\frac{4p}{5q} > 1:

4p>5q4p > 5q
⇒4p>5(1−p)\Rightarrow 4p > 5(1 - p)
⇒9p>5\Rightarrow 9p > 5
⇒p>59.\Rightarrow p > \frac{5}{9}.
To check your answer: at p=59p = \frac{5}{9}, P(D)=P(E)P(D) = P(E) exactly, and at p=23p = \frac{2}{3}, P(D)=P(C)P(D) = P(C) exactly — the two boundary values recovered directly by setting each ratio equal to 11. ✓

∴\therefore the possible range of values of pp is 59<p<23\frac{5}{9} < p < \frac{2}{3}.

Part (iii)

1 mark

At each of the 88 junctions, independently of the other junctions, the bug either continues along a fork (probability 0.9p+0.9q=0.9(p+q)=0.90.9p + 0.9q = 0.9(p + q) = 0.9) or is swallowed by the black hole (probability 0.10.1). The bug reaches one of the endpoints A–I if and only if it survives all 88 junctions.

P(reaches an endpoint)=0.98=0.430 (3 s.f., by GC).P\left( \text{reaches an endpoint} \right) = {0.9}^{8} = 0.430\ \text{(3 s.f., by GC).}

Explanation: reaching an endpoint at all does not depend on which endpoint, only on never being swallowed, so the fork probabilities pp and qq do not appear in the answer — only their combined survival probability 0.90.9 at each junction matters.

∴\therefore P(bug reaches an endpoint without being swallowed)=0.430P\left( \text{bug reaches an endpoint without being swallowed} \right) = 0.430.

This is how we mark, and how we teach.

Every Ten-Year Series question, worked in full, with the reasoning written out and the traps named.

Find out more