Needed subset draws to get all elements with a given probability

Asked Jul 04 '20 at 10:19

Active Jul 05 '20 at 08:37

Viewed 21 times

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.

edited Jul 05 '20 at 08:37

asked Jul 04 '20 at 10:19

rools

If you search the site for coupon collector you will find other versions of the problem. – Ross Millikan Jul 04 '20 at 14:49
Thanks, I have no knowledge in probability, I did not know about this classic problem. It will give me a lead to find a solution later when I will have time. I will post the solution here if I find it. – rools Jul 05 '20 at 08:43
I found these interesting links: How many stickers do I need to complete my FIFA Panini album? and A variation of the coupon collector's problem for Panini Albums?. – rools Jul 05 '20 at 08:57

0 Answers0