Discrete Stochastic Processes
Coupon Collector’s Problem for Dummies
How many draws to collect all n types? Each new type is its own geometric wait.
What to remember
- Break the wait into geometric stages and add their means.
- E[T] = n H_n ≈ n ln n; a die needs 14.7 rolls.
Read the lessonThe Coupon Collector, with a checkpoint at the end.