Timeline for From 52 cards, we draw N times one card with the return. Calculate the probability that each card in the deck will be drawn at least once.
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 24 at 6:39 | history | edited | thefool | CC BY-SA 4.0 |
deleted 1 character in body
|
| Jun 23 at 21:08 | vote | accept | thefool | ||
| Jun 17 at 4:52 | comment | added | user2661923 | See also this answer for an explanation of and justification for the Inclusion-Exclusion formula. | |
| Jun 17 at 4:47 | comment | added | user2661923 | +1 to your accurate and valid answer. My only constructive criticism is to suggest that in general with such problems, you (alternatively) express the probability as something like $~\dfrac{A}{D} ~: ~D = (52)^N.~$ So, you compute $~A~$ combinatorically, using Inclusion-Exclusion, bypassing any considerations of probability, thus (arguably) making things easier on yourself. You might end up with something like $$A = \sum_{k=0}^{52} (-1)^{k} \binom{52}{k} (52-k)^N.$$ | |
| Jun 16 at 18:44 | history | answered | thefool | CC BY-SA 4.0 |