Consider the following game From an ordinary deck of 52 card

Consider the following game: From an ordinary deck of 52 cards, cards are drawn at
random and with replacement until three aces are drawn. If it takes more than ten draws to obtain
the three aces, the player loses k dollars; otherwise, he wins 100 dollars. Let X denote the amount
of money that the player wins per game.

Find the value of k such that this game is fair (that is, such that E(X) = 0).

For the fair value of k, nd the variance of X.

Solution

The player wins if and only if there are at least three aces drawn within 10 attempts.

Instead of calculating the probability that he wins, let us instead calculate the probability that he loses.
There are three situations:
1 Out of ten attempts, he draws exactly two aces
2.Out of ten attempts, he draws exactly one ace
3Out of ten attempts, he draws no aces
What is the probability that he draws exactly two aces?

Since drawing is with replacement, pick which two spots out of the ten are occupied by the aces. (10C2) choices.

In order, pick which card it is that appears in each non-ace spot. 48 choices each time. In order, pick which ace appears in each ace-spot. 4 choices each time.

There are then (10C2)*42^*48^8 different possibilities.

There are 52^10 possible ways to draw ten cards with repetition.

Thus, the probability of drawing exactly two aces is (10C2)(4^2*48^8)/52^10

Continue by finding the probability of exactly one ace and no aces, and then adding these together to find the probability of a loss. The probability of a win is then 1P(loss)
Note: instead of the brute force counting above, we could have simply used a binomial distribution with 1/13 as the chance of success (drawing an ace) and 12/13 as the chance of failure (not drawing an ace). The chance of exactly k successes in 10 attempts is then
=(10Ck)(1/13)^k(12/13)^(10k)

Now, letting X denote the random variable for how much money he wins,
E[X]=Pr(Win)*100Pr(Lose)*k
If it were fair, then we want E[X]=0.
Use the information found above to solve for k.