Abstract
Two persons turn up cardsalternately,each starting with a similar, but differently shuffled, pack of n cards. What is the probability that before all the cards have been dealt two identical cards are showing at the same time?If the two players deal simultaneously the answer is unity minus the probability that none of thenpairs of cards is an identical pair. The problem is thus reduced to the calculation of the number of ways in whichnletters can be put intonaddressed envelopes without any letter going to the correct addressee. This is the classical example of derangements, and the solution can be found in Chap, IV of Whitworth'sChoice and Chance, viz.
Publisher
Cambridge University Press (CUP)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献