TGM adapted model: one round consists of exactly eight moves from \(X\) on a square lattice. The diagram shows the part of the lattice containing \(X\), \(Y\) and \(A\) to \(E\).
• The counter can only either move up or to the right along the grid lines.
• At every movement, including the first from \(X\), the player randomly moves the counter to the right with probability \(p\) or up with probability \(q\), \(p+q=1\). The moves taken at each junction are independent.
• A round is won if the counter passes through \(Y\) and is at \(B\) after its eighth move. Reaching the right-hand boundary earlier does not end the round; moves continue on the lattice. Every other final position is a loss.
It is given that \(p=\frac{4}{5}\). Wang plays one game which comprises \(15\) rounds. Each round is independent of one another. Let the random variable \(W\) be the number of rounds that Wang wins.
TGM adaptation note: the original source does not specify what happens on first reaching the right-hand boundary. The eight-move rule above makes the retained \(30p^5q^3\) calculation valid. The final central-limit-theorem task is optional extension beyond IB AA SL and HL.
Video solution locked
A free account saves your progress; this video needs tuition enrolment.
680+ questions here come with free worked solutions. A free account saves your questions and progress; this one needs tuition enrolment.
Create a free account to practise similar questions.
Need help? Join our JC Math tuition classes.
Learn more