N2018 P2 Q6

N2018 P2 Q6

7 marks
Past Year National Exams
Free

In a computer game, a bug moves from left to right through a network of connected paths. The bug starts at \(\mathrm{S}\) and, at each junction, randomly takes the left fork with probability \(p\) or the right fork with probability \(q\), where \(q=1-p\). The forks taken at each junction are independent. The bug finishes its journey at one of the \(9\) endpoints labelled \(\mathrm{A}-\mathrm{I}\) (see diagram).

  1. Show that the probability that the bug finishes its journey at \(\mathrm{D}\) is \(56{{p}^{5}}{{q}^{3}}\).[2]
  2. Given that the probability that the bug finishes its journey at \(\mathrm{D}\) is greater than the probability that the bug finishes its journey at any one of the other endpoints, find exactly the possible range of values of \(p\).[4]

In another version of the game, the probability that, at each junction, the bug takes the left fork is \(0.9p\), the probability that the bug takes the right fork is \(0.9q\) and the probability that the bug is swallowed up by a ‘black hole’ is \(0.1\).

  1. Find the probability that, in this version of the game, the bug reaches one of the endpoints \(\mathrm{A}-\mathrm{I}\), without being swallowed up by a black hole.[1]

Video Solution:

Default solution

  1. List item image
  2. List item image
  3. List item image

Need help? Join our JC Math tuition classes.

Learn more