Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

A coin having probability p of coming up heads is continually flipped until both heads and tails have appeared. Find

(a) the expected number of flips,

(b) the probability that the last flip lands on heads.

Short Answer

Expert verified

A coin having probability of coming up both heads and tails is 1/2.

Step by step solution

01

Given Information

(a)

Suppose that the first flip has landed on Heads. Then, if we are counting the number of flip needed to obtain both sides, we are hoping for Tail in next flips. So, if we are given that the first flip is Head, we have that the remaining number of flips that are needed to obtain both sides has Geometric distribution with parameter 1-p. Similarly, if we are given that the first flip is Tail, we have that the remaining number of flips that are needed to obtain both sides has Geometric distribution with parameter p. Therefore

  • EX=EX/FirstHeadpFirstHead+EX/FirstTailp(FirstTail)=1+11-pp+1+1p1-p=1+p2+1-p2p1-p

(b)

No matter what is the number of total flips, the last flip will be Head with probability pand Tail with probability 1-p. This is because of the fact that all flips are independent and equally distributed.

02

Final Answer

(a) Condition the expectation on the first flip.

(b) The probability is p.

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

The joint density of X and Yis given by f(x,y)=e-x/ye-yy,0<x<โˆž,0<y<โˆž, Compute EX2โˆฃY=y.

How many times would you expect to roll a fair die before all 6sides appeared at least once?

An urn has m black balls. At each stage, a black ball is removed and a new ball that is black with probability p and white with probability 1โˆ’p is put in its place. Find the expected number of stages needed until there are no more black balls in the urn. note: The preceding has possible applications to understanding the AIDS disease. Part of the bodyโ€™s immune system consists of a certain class of cells known as T-cells. There are2 types of T-cells, called CD4 and CD8. Now, while the total number of T-cells in AIDS sufferers is (at least in the early stages of the disease) the same as that in healthy individuals, it has recently been discovered that the mix of CD4 and CD8 T-cells is different. Roughly 60 percent of the T-cells of a healthy person are of the CD4 type, whereas the percentage of the T-cells that are of CD4 type appears to decrease continually in AIDS sufferers. A recent model proposes that the HIV virus (the virus that causes AIDS) attacks CD4 cells and that the bodyโ€™s mechanism for replacing killed T-cells does not differentiate between whether the killed T-cell was CD4 or CD8. Instead, it just produces a new T-cell that is CD4 with probability .6 and CD8 with probability .4. However, although this would seem to be a very efficient way of replacing killed T-cells when each one killed is equally likely to be any of the bodyโ€™s T-cells (and thus has probability .6 of being CD4), it has dangerous consequences when facing a virus that targets only the CD4 T-cells

A total of n balls, numbered 1through n, are put into n urns, also numbered 1through nin such a way that ball iis equally likely to go into any of the urns 1,2,..i.

Find (a) the expected number of urns that are empty.

(b) the probability that none of the urns is empty.

A deck of n cards numbered 1 through n is thoroughly shuf๏ฌ‚ed so that all possible n! orderings can be assumed to be equally likely. Suppose you are to make n guesses sequentially, where the ith one is a guess of the card in position i. Let N denote the number of correct guesses.

(a) If you are not given any information about your earlier guesses, show that for any strategy, E[N]=1.

(b) Suppose that after each guess you are shown the card that was in the position in question. What do you think is the best strategy? Show that under this strategy

E[N]=1n+1nโˆ’1+โ‹ฏ+1โ‰ˆโˆซ1n1xdx=logn

(c) Supposethatyouaretoldaftereachguesswhetheryou are right or wrong. In this case, it can be shown that the strategy that maximizes E[N] is one that keeps on guessing the same card until you are told you are correct and then changes to a new card. For this strategy, show that

E[N]=1+12!+13!+โ‹ฏ+1n!โ‰ˆeโˆ’1

Hint: For all parts, express N as the sum of indicator (that is, Bernoulli) random variables.

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