Original practice · fully worked
Original variant: a geometric doubling score after a checkpoint
Independent attempts continue until a success. The probability that at least three attempts are required is 0.16. After learning that the first two attempts failed, let K be the number of further failures before success. A score is defined as 2ᴷ. Calculate the expected score.
- A
0.600 - B
1.587 - C
1.667 - D
3.000 - E
5.000
Answer and calculation
Two initial failures have probability 0.16, so the failure probability is 0.40 and success probability is 0.60. Memorylessness gives P(K=k)=0.60(0.40)ᵏ, and summing 2ᵏ times this mass yields 3, choice D.
Setup
Setup
Let q be the per-attempt failure probability and recover it from the two known failures.
Pr(T≥3)=q2=0.16 q=0.40,p=1−q=0.60 Model
Model
Memorylessness makes the additional failure count geometric on zero, one, two, and so on.
Pr(K=k)=pqk=0.60(0.40)k,k=0,1,2,… Compute
Compute
Weight each score by its geometric probability and sum the convergent series.
E[2K]=k=0∑∞2k(0.60)(0.40)k E[2K]=0.60k=0∑∞(0.80)k=1−0.800.60=3 Answer
Answer
The expected doubling score is 3.
3.000(D)