In this problem , a casino wanted to introduce the following game and charge for every player that plays:
For example, if somebody flipped tails-tails-tails-heads, then his or her prize would be ( doubled three times).
However, the casino realized that the house will eventually lose with these rules when some lucky person flips an unusually high number of tails in a row, so the casino owner wants to revise the first rule to:
Find the maximum value of so that the house can still expect to make a profit.
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.
Let E ( x ) be the expected payout in relation to the maximum number of coin flips n . We need to find the value of n , such that E ( n ) < $ 2 0 and E ( n + 1 ) ≥ $ 2 0 .
Let k ≤ n . The probability of throwing k − 1 times tails and then throwing heads is ( 2 k ) − 1 , in which case we get $ 2 k . The probability of throwing n times tails is ( 2 n ) − 1 , in which case we get $ 2 n . Thus, E ( x ) is equal to E ( x ) = i = 1 ∑ x ( $ 2 i 2 i 1 ) + $ 2 x 2 x 1 = $ ( x + 1 )
Thus, E ( 1 8 ) = $ 1 9 < $ 2 0 and E ( 1 9 ) = $ 2 0 , which yields a solution of n = 1 8 .