Waiting times for HHT and for THH
Question
A fair coin is flipped until a given three-flip pattern appears. Find the expected number of flips needed to observe HHT, and separately the expected number needed to observe THH.
Short answer
in both cases. Neither pattern has a proper prefix equal to a suffix, so there is no overlap to exploit and the waiting time is just (confirmable with a small Markov chain on the matched prefix).
Adapted from Zhou, A Practical Guide to Quantitative Finance Interviews, sec. 5.1 Markov Chain, 'Coin triplets A', p.108; question and answer rewritten by SelfMadeQuant.com.
See the hint and the full worked solution in the question bank (free account).
Open the worked solutionLessons behind this question
- Markov Chains — Transition Matrices and the Markov Property
- Expectation, Mean, and Variance
- Conditional Expectation and Variance Revisited
Start with a free lesson: Expectation, Variance and Covariance is part of a free topic. Create a free account, no card needed, to read it in full with worked solutions.
Read it free