Past exam of the mathematics course of the University of Cambridge / 2022 / ia / Paper 2 / 11F / b

Table of contents
- Solution b

Solution

Conditioned on exactly

k

heads, every

k

-element set of head positions is equally likely. There are

(k n)

such sets. A run containing all

k

heads can begin at any of the positions

1, 2, \dots, n - k + 1,

and each beginning determines one admissible set. Thus, for

k \geq 1

,

P (the k heads are consecutive ∣ exactly k heads) = \frac{n - k + 1}{( k n )} .

 Ancestors (10)

 View article source

 Discussion (0)

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic Create my own version