Original practice · fully worked
Original variant: hidden verification route after a rejection
An access token is assigned to verification route A with probability 0.60 and route B with probability 0.40. Conditional on its assigned route, repeated attempts are independent and use that same route until one is accepted. Each attempt is accepted with probability 0.50 on route A and 0.25 on route B. Given that the first attempt is rejected, calculate the expected total number of attempts through the first acceptance.
- A
2.0 - B
2.8 - C
3.0 - D
4.0 - E
5.0
Answer and calculation
The first rejection makes the two route posterior probabilities equal: each contributes probability 0.30 to the rejection event. The expected remaining attempts are therefore the average of geometric means 2 and 4, and adding the rejected attempt gives 4.0 and choice D.
Setup
Setup
Weight the first-rejection likelihood by each route's prior probability.
Pr(A∩R1)=0.60(0.50)=0.30 Pr(B∩R1)=0.40(0.75)=0.30 Model
Model
Normalize the equal contributions to update the hidden route after the rejection.
Pr(A∣R1)=Pr(B∣R1)=21 Compute
Compute
Future attempts have geometric means two and four under the two routes. Average them with the posterior weights, then add the completed rejection.
E[T∣R1]=1+21(0.501)+21(0.251) E[T∣R1]=1+1+2=4 Answer
Answer
The conditional expected total is four attempts.
4.0(D)