The Two Coupons, Generic Quota Coupon Collector's Problem
The classic coupon collector's problem asks: There are \(n\) distinct coupons, and we wish to collect each coupon at least once. We may draw a random coupon uniformly in each iteration. How many iteration does it take, in expectation, to complete a full collection? The problem attracted significant…