Worked solution
Count tries when keys are tested without replacement
John has four keys, only one of which unlocks a door. He tries the keys randomly without replacement. X is the number of tries needed to unlock the door.
(i) Show that .
(ii) Tabulate the distribution of X.
(iii) Write down and .
(iv) Find .
[2006/CJC/II/23]
CJC · Lecture · Example 16
(i) Follow the unsuccessful, unsuccessful, successful path
After each failed key is removed, the number of keys changes. Thus . This makes the probability/counting scenario explicit, as the Teacher note requests.
(ii) Tabulate the number of tries
The successful key is equally likely to occupy each position in the random testing order (an explanation of the source uniform law). In particular, the source calculates .
| 1 | 2 | 3 | 4 | |
|---|---|---|---|---|
(iii) Calculate the mean and variance
By symmetry . The source second moment is . Therefore .
(iv) Split the squared inequality
Follow the Teacher emphasis: means . Of the possible values , only 1 and 2 qualify. Hence . This completes the Student blank using the Teacher working.
Common mistakes
The key is not replaced after failure. Do not use a geometric law with a constant success probability. Split a squared inequality into both bounds before checking the support.