Generalized Coupon Collector's Problem

127 Views Asked by At

I just read about the coupon collector's problem where you're trying to find out how many coupons you need to collect on average before you get one complete set. This turns out to be $nH(n)$. I was wondering, how would you go about generalizing this problem to figure out how many coupons you would need on average to get N complete sets?