 Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2023/ii/paper-1/5j/solution

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

For

X = x

, the last flip must be the

r

th head. Among the preceding

x + r - 1

flips, exactly

x

are tails and

r - 1

are heads. There are

(x x + r - 1)

choices for their positions, and every resulting sequence has probability

(1 - p)^{x} p^{r}

P (X = x) = (x x + r - 1) (1 - p)^{x} p^{r}, x = 0, 1, \dots,

X

has the failures-before-the-

r

θ = lo g (1 - p), - \infty < θ < 0.

Since

p = 1 - e^{θ}

P_{θ} (X = x) = (x x + r - 1) exp {θ x + r lo g (1 - e^{θ})} = h (x) exp {θT (x) - A (θ)},

where

T (x) = x, A (θ) = - r lo g (1 - e^{θ}), h (x) = (x x + r - 1) .

θ

T (X) = X

E [X] = A^{'} (θ) = \frac{r e ^{θ}}{1 - e ^{θ}} = \frac{r ( 1 - p )}{p}

and

var (X) = A^{''} (θ) = \frac{r e ^{θ}}{( 1 - e ^{θ} ) ^{2}} = \frac{r ( 1 - p )}{p ^{2}} .

 New to topics? Read the docs here!