A match would be any one of the same item in each set ending up in the same position. For instance, if two decks of shuffled cards are laid out in pairs, one card from each deck, what are the chances that at least one pair will be of identical cards?
I am more interested in how to solve the general problem than a specific answer. Simple combinatorics doesn't seem to do it. It seems to be devilishly recursive.
2006-12-11
10:45:47
·
3 answers
·
asked by
xaviar_onasis
5
in
Science & Mathematics
➔ Mathematics
The actual answer for two decks is about 60% for at least one match. But I am more interested in a general formula for n items in two sets.
2006-12-11
11:48:15 ·
update #1