I really like the mathematics and probability threads on this board, so here’s one for you guys…
First the problem: Let’s say I have two decks of playing cards (52 unique cards each), each deck shuffled independently. I then proceed to draw pairs of cards off the top, one card from each at a time, and put the drawn cards face up on the table. How many pairs of cards do I need to draw before I have a greater than 50% chance of any two drawn cards being the same? How about for 75% or 95% chances?
The above assumes a 52 card deck, but what about arbitrarily sized decks? (The decks are always exactly the same in makeup, but not ordering.) Is there a (reasonably) simple formula for approximating where the 50% threshold is, if given the size of the deck?
This is actually a real-world problem, although it’s mostly just a discussion point now. There is a component of an application I work on that randomly pulls items from a population in the manner described above, and something I noticed was that it did not take very long (on average) for there to be overlaps in the randomly selected pools. This value is so far below what we expected that there was some suspicion about how random the selection really was! I figured this was a variation on the birthday paradox, but figuring out the actual probabilities involved is beyond my meager math skills.