4.3.9 problem 47

(a)
Let be the number of cards that are called correctly. .
(b)
Source: https://math.stackexchange.com/a/1078747/649082

Let be the number of cards that are called correctly. . To find , consider the first cards, with the -th card correctly guessed. Let be the number of correctly guessed cards within the cards. For instance, for , , representing a correctly guessed card and representing an incorrectly guessed card, one possible sequence of draws is .

Notice that the second in the sequence has probability , because the second card is guessed correctly. The only piece of information we have is that the third card is not the card that was correctly guessed, leaving a total of possibilities. Generalizing, the probability of a string of length with s is . There are strings of length with s that end in a , and since ,

Thus,

Note that . Thus,

.

(c)
Since at any given time, we know all the cards remaining in the deck, the probability of the -th card being the card guessed correctly is . Thus, .