TOPICS
Search

Coupon Collector's Problem


Let n objects be picked repeatedly with probability p_i that object i is picked on a given try, with

 sum_(i)p_i=1.

Find the earliest time at which all n objects have been picked at least once.


See also

Birthday Problem

Explore with Wolfram|Alpha

References

Hildebrand, M. V. "The Birthday Problem." Amer. Math. Monthly 100, 643, 1993.

Referenced on Wolfram|Alpha

Coupon Collector's Problem

Cite this as:

Weisstein, Eric W. "Coupon Collector's Problem." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/CouponCollectorsProblem.html

Subject classifications