A Kaboobly Dooist discovers an infinite pool of coins with
,
and
coins distributed uniformly in it.
He takes a coin at random from the pool and puts it in his bag.
He does so until the sum of the values of all coins in his bag is equal to or more than .
If the expected number of coins in the bag is , what is the value of ?
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.
I'm not completely sure about this. Given that P ( $ 1 ) = P ( $ 2 ) = P ( $ 5 ) = 3 1 , than the average amount summed up at each iteration is μ = 3 1 ( 1 + 2 + 5 ) = 3 8 . So, the expected numer of iterations N to get to 2 0 0 is E ( N ) = μ 2 0 0 = 7 5 . Since the distribution is uniform, E ( $ 1 ) = E ( $ 2 ) = E ( $ 5 ) = 3 E ( N ) = 2 5 . I suspect that E ( $ 1 ) is slightly bigger though.