A person tosses a fair coin until a tail appears for the first time. If the tail appears on the n th flip, the person wins 2n dollars. Let X denote the player's winnings. Show that E[X]=+. This problem is known as the St. Petersburg paradox.

(a) Would you be willing to pay \( 1 million to play this game once?

(b) Would you be willing to pay \) 1 million for each game if you could play for as long as you liked and only had to settle up when you stopped playing?

Short Answer

Expert verified

(a) The individual is not ready to pay $ 1 million to play this game once.

(b) The individuals will never be willing to pay a $ 1 million to play this game.

Step by step solution

01

Given information (Part a)

A person tosses a fair coin until a tail appears for the first time. If the tail appears on the n th flip, the person wins 2n dollars

02

Solution (Part a)

From the given data, a person throws a fair coin until a tail occurs for the first time. If a tail appears on the first toss, the person wins 2 dollars.

If a tail appears on the second toss, the person wins 22dollars.

If a tail appears on nthtoss, the person wins 2ndollars.

Then,

From the comprehended information, the probability that obtaining tail is 12.

The probability that tail on first toss (T)=12.

The probability that tail on second toss (H,T)=12×12=122.

The probability that tail on n th toss, (H,H,,T)=12×12××12=12n.

Let X be the event that player's winnings.

Here, the range of X is, X=1,2,....

So the expected winning of the player will be:

E(X)=2×12+22×122+23×123+.

=n=12n12n

=n=11

=

03

Solution (Part a)

The above-mentioned information tells that, the probability of winning 2 dollars is 0.5,4 dollars is 0.25,8 dollars is 0.125, and so on.

So, the probability of winning $ 1 million is very minor. Existing a risk element, an individual would pay $ 1 million because there is a possibility for loss.

04

Final answer (Part a)

Thus, the individual is not ready to pay $ 1 million to play this game once.

05

Given information (Part b)

A person tosses a fair coin until a tail appears for the first time. If the tail appears on the n th flip, the person wins 2n dollars

06

Solution (Part b)

If an individual is willing to pay $ 1 million for per game, then the probability of winning a million is 12n.

So, the amount that the person will win for each game will be,

2n1000000

(Apply log on both sides)

log102nlog10(1000000)

nlog1026

n6log102

n19.93

n20

The probability of winning a million is,

12n=1220

=0.0000009537

0

07

Final answer (Part b)

So, the probability of succeeding a million is almost equal to zero. Thus, the possibility that people willing to pay $ 1 million to play this game is almost 0. Thus, the individuals will never be willing to pay a $ 1 million to play this game.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Let N be a nonnegative integer-valued random variable. For nonnegative values aj, j Ú 1, show that

j=1a1++ajP{N=j}=i=1aiP[Ni}

Then show that

E[N]=i=1P[Ni}

and

E[N(N+1)]=2i=1iP{Ni}

When three friends go for coffee, they decide who will pay the check by each flipping a coin and then letting the “odd person” pay. If all three flips produce the same result (so that there is no odd person), then they make a second round of flips, and they continue to do so until there is an odd person. What is the probability that

  1. exactly 3rounds of flips are made?
  2. more than 4rounds are needed?

Suppose that Xtakes on one of the values0,1and2. If for some constantc,P{X=i}=cP{X=i-1},i=1,2, findE[X].

A fair coin is continually flipped until heads appears for the 10th time. Let X denote the number of tails that occur. Compute the probability mass function of X.

The National Basketball Association (NBA) draft lottery involves the 11 teams that had the worst won-lost records during the year. A total of 66 balls are placed in an urn. Each of these balls is inscribed with the name of a team: Eleven have the name of the team with the worst record, 10 have the name of the team with the second worst record, 9 have the name of the team with the third worst record, and so on (with 1 ball having the name of the team with the 11 th-worst record). A ball is then chosen at random, and the team whose name is on the ball is given the first pick in the draft of players about to enter the league. Another ball is then chosen, and if it "belongs" to a team different from the one that received the first draft pick, then the team to which it belongs receives the second draft pick. (If the ball belongs to the team receiving the first pick, then it is discarded and another one is chosen; this continues until the ball of another team is chosen.) Finally, another ball is chosen, and the team named on the ball (provided that it is different from the previous two teams) receives the third draft pick. The remaining draft picks 4 through 11 are then awarded to the 8 teams that did not "win the lottery," in inverse order of their won-lost not receive any of the 3 lottery picks, then that team would receive the fourth draft pick. Let X denote the draft pick of the team with the worst record. Find the probability mass function of X.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free