 Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2025/ia/paper-2/4f/a/solution

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

The number of stops is

X \sim Bin (n, 1/ n)

. For each fixed

k \geq 0

P (X = k) = (k n) n^{- k} (1 - n^{- 1})^{n - k} ⟶ \frac{e ^{- 1}}{k !},

 New to topics? Read the docs here!