Longest Waiting Time in the Coupon Collector's Problem

摘要

The coupon collector’s problem is a classical problem usually solved by summing independent but not identically distributed geometric random variables. These geometric random variables represent waiting times for the j -th coupon for j = 1, 2,..... In this paper we address the question about the longest of these waiting times. In particular, we evaluate the moments of the longest waiting time.