A gambler has 1 dollar in his pocket. He tosses an unbiased coin unless he has lost all his money or unless the coin is tossed for 5 times. For each head he wins a dollar, and for each tail he loses a dollar. Find the probability that the gambler will end up with $0.
If the answer is in the form , where and are coprime positive integers, find .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The gambler's winnings must go up or down 1 dollar after each coin toss unless they have lost all their money. The only possible sequences of dollars on hand that result in them losing all their money are
( 0 ) , ( 2 , 1 , 0 ) , ( 2 , 1 , 2 , 1 , 0 ) and ( 2 , 3 , 2 , 1 , 0 ) .
Bottoming out in a sequence of n coin tosses occurs with probability 2 n 1 , so as there is 1 losing sequence involving 1 toss, 1 involving 3 tosses and 2 involving 5 tosses, the probability that the gambler will lose all their money is
2 1 + 2 3 1 + 2 × 2 5 1 = 2 1 + 8 1 + 3 2 2 = 1 6 8 + 2 + 1 = 1 6 1 1 , and thus a + b = 1 1 + 1 6 = 2 7 .
Comment: The probabilities P ( k ) of possessing k dollars after 5 tosses are
P ( 0 ) = 1 6 1 1 , P ( 1 ) = P ( 3 ) = P ( 5 ) = 0 , P ( 2 ) = 3 2 5 , P ( 4 ) = 8 1 , P ( 6 ) = 3 2 1 .
Follow-up question: If this game were to continue for potentially an infinite number of tosses, what is the probability that the gambler will eventually lose all their money?