Check out Part I of the problem here . It is less challenging, but I suggest trying it before this one.
Alison and Bob play a game with coins. Alison starts with coin while Bob starts with coins. Each turn, if Alison has coins and Bob has coins, Alison has a chance of receiving a coin from Bob and a chance of giving Bob a coin. Let denote the expected number of coins Alison has after turns. Find rounded to the nearest integer.
A calculator should be used to compute the final answer. You may use a computer program only as last resort.
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 p k be the probability that Alison has k coins after n turns. We can see that A ( n ) = ∑ i = 0 1 0 0 0 i p i .
If Alison has k coins, she has a 1 0 0 0 1 0 0 0 − k chance of gaining a coin and a 1 0 0 0 k chance of losing one next turn. Therefore, her expected net gain each turn would be 1 0 0 0 1 0 0 0 − 2 k .
A ( n + 1 ) = A ( n ) + ∑ i = 0 1 0 0 0 1 0 0 0 1 0 0 0 − 2 i p i = A ( n ) + ∑ i = 0 1 0 0 0 p i − 1 0 0 0 2 ( ∑ i = 0 1 0 0 0 i p i ) = A ( n ) + 1 − 5 0 0 1 A ( n ) = 5 0 0 4 9 9 A ( n ) + 1
Solve with the initial condition A ( 0 ) = 1 , and we get A ( n ) = 1 + 5 0 0 4 9 9 A ( n − 1 ) = 1 + 5 0 0 4 9 9 + ( 5 0 0 4 9 9 ) 2 A ( n − 2 ) = . . . = ∑ i = 0 n ( 5 0 0 4 9 9 ) i = 1 − 5 0 0 4 9 9 1 − ( 5 0 0 4 9 9 ) n + 1 = 5 0 0 ( 1 − ( 5 0 0 4 9 9 ) n + 1 )
When n = 3 0 , A ( n ) = 3 0 . 0 8 7 7 3 , so the answer is 3 0 0 8 7 7 3 .