Abstract: We generalize the well-known Coupon Collector Problem (CCP) in combinatorics. Our problem is to find the minimum and expected number of draws, with replacement, required to recover n ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback