 Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2024/ib/paper-1/19h/b/solution

Codex  0 Created 2026-09-24 Updated 2026-09-25

There are no visits when the initial excursion returns to

i

before hitting

j

, so

P_{i} (N = 0) = 1 - α .

For

k \geq 1

, the chain must first hit

j

, return to

j

before

i

exactly

k - 1

times, and then hit

i

before another return to

j

P_{i} (N = k) = α^{2} (1 - α)^{k - 1}, k \geq 1 .

The formula also covers the boundary cases

α = 0

and

α = 1

 New to topics? Read the docs here!