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]=nHn≈nln⁡nE[T] = n H_n \approx n \ln n; a die needs 14.714.7 rolls.
Read the lessonThe Coupon Collector, with a checkpoint at the end.