Longest Waiting Time in the Coupon Collector’s Problem
C. Brennan, J. Kariv & A. Knopfmacher · Journal of Advances in Mathematics and Computer Science · 2015
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 que...
Open access
Research Article
10.9734/BJMCS/2015/16934