I have a set of N elements. I draw (without replacement) a subset of M elements, then replace it.
What value M do I need, to have a probability greater than p to draw all N elements within X subset draws?
I found the answer when M is 1, but I am not sure how to adapt that in a general case.
Thin coupon problem is different from Coupon Collector Problem with packs since we do not have duplicates when we draw a subset.