# FMM16

### From charlesreid1

# Friday Morning Math Problem

## Petersburg Paradox Revisited

**BACKGROUND**

Today's problem is about the famous St. Petersburg paradox.

In the St. Petersburg paradox, Petra von Player and Paul de Bank agree to play a game based on the toss of a coin. If a head is thrown on the first toss (prob = 1/2), Paul de Bank pays Petra von Player a dollar, and the game is over. If the first toss is tails and the second toss is head (prob = 1/4), Paul de Bank pays Petra von Player two dollars, and the game is over. If the first head appears on the Nth toss (prob = 1/2^N), Paul de Bank pays Petra von Player 2^(N-1) dollars, and so on. Each time the winning head does not appear, the payoff doubles.

The paradox comes in the form of the question, "How much should Petra von Player be willing to pay to play this game?" The answer is, she should be willing to pay an infinite amount of money to play this game.

Resolution:

The resolution to the paradox lies in the fact that the expected winnings of Petra von Player are infinite:

EW = 1 * 1/2 + 2 * 1/4 + 4 * 1/8 + ... = 1/2 + 1/2 + 1/2 + ... = infinity

If Petra is to make money off the game, she should be willing to pay a quantity less than the expected payoff to play the game. But if the expected payoff is infinite, Petra should be willing to pay an infinite amount of money to play the game - hence the paradox. (The resolution comes when we recognize that if Petra von Player can play for 10^100 years, there is a good chance that eventually she will win a payoff that makes it worth the wait, and that Paul de Bank will actually have 10^65 dollars or whatever.)

**PROBLEM**

Suppose Paul de Bank has a trillion (10^12) dollars.

a. How many coin tosses would it take Petra von Player to clean out Paul de Bank?

b. How much should Petra von Player be willing to pay to play?

c. What is the probability Paul de Bank will get cleaned out?

d. What is the probability that Petra von Player will lose money on the game (assuming Petra von Player pays the amount from part b)?

Solution |
---|

Part A - number of coin tosses for von Player to clear out de Bank?
We can find the number of times we have to double 1 to reach Paul de Bank's billion dollar fortune: >>> np.log2(1e12) 39.86 >>> np.power(2,39) 549,755,813,888 But remember that bets start at 1, or , so takes 40 wins to reach. If Petra von Player wins 40 times in a row it would leave de Bank with a measely >>> 1e12 - np.power(2,40-1) 450,244,186,112 half a trillion dollars left to live on. If Petra von Player wins 41 times in a row, it leaves de Bank underwater >>> 1e12 - np.power(2,41-1) -99,511,627,776 and de Bank ends up with 99 billion dollars of debt.
An alternative way to think about it is to use the back of the envelope approximation:
so it follows that
Our back of the envelope estimate is about 40 times, which matches the more precise calculations above.
Given our maximum of 40 tosses, and the 50% probaability, a maximum of 40 tosses leads to an E = 1/2 + 1/2 + ... + 1/2 E = 40*1/2 E = 20 So we should expect to win $20 from the game.
The probability of getting a heads once is ; twice is ; and so on. The probability of 40 heads in a row is:
Alternatively, using our back of the envelope estimate of
we get a back of the envelope estimate of
if Paul de Bank paints a single one dollar bill red, and then put all of his dollars into one giant pile, it's the probability of pulling out that one single dollar bill
To make back $20, we would need to win a power of 2 quantity more than 16 - which is 32 >>> np.log2(20) 4.32 >>> np.power(2,5) 32 To make $32 we have to win 6 times (remember, the first bet is $1, so we are starting at and it takes 6 wins to receive a payoff of at least ), which has the probability:
so probability of Petra von Player losing money on the game is >>> 1-(1/np.power(2,6)) 0.9843 |

## Flags

Friday Morning Math ProblemsSpider Socks and Shoes FMM1 Sums of Powers of 2 FMM2 Fifty Coins FMM3 The Zeta Monogram FMM4 The Cthulhus Monogram FMM4B Multiplication Logic FMM5 The Termite and the Cube FMM6 Sharing Dump Trucks FMM7 The Flippant Juror FMM8 Bus Routes FMM9 A Robust Bus System FMM9B Square-Free Sequence FMM10 Inferring Rule from Sequence FMM11 Checkerboard Color Schemes FMM12 One-Handed Chords FMM13 First Ace FMM14 Which Color Cab FMM15 Petersburg Paradox Revisited FMM16 A Binomial Challenge FMM17 A Radical Sum FMM18 Memorable Phone Numbers FMM19 Arrange in Order FMM20 A Pair of Dice Games: FMM21
Category:Puzzles · Template:FMMFlag · e |