/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Problem 24 A coin, having probability \(p\)... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

A coin, having probability \(p\) of landing heads, is continually flipped until at least one head and one tail have been flipped. (a) Find the expected number of flips needed. (b) Find the expected number of flips that land on heads. (c) Find the expected number of flips that land on tails. (d) Repeat part (a) in the case where flipping is continued until a total of at least two heads and one tail have been flipped.

Short Answer

Expert verified
The short answers to each part of the question are: (a) The expected number of flips needed until at least one head and one tail have been flipped is \(E(N) = \frac{1}{2p(1-p)}\). (b) The expected number of flips that land heads is \(\frac{1}{2(1-p)}\). (c) The expected number of flips that land tails is \(\frac{1}{2p}\). (d) The expected number of flips needed until at least two heads and one tail have been flipped is \(E(N) + E(M) = \frac{1}{2p(1-p)} + \frac{1}{p}\).

Step by step solution

01

(a) Expected number of flips needed

We can denote the expected number of flips needed as E(N). We can also split this into two cases: the first flip is heads (with probability p) and the first flip is tails (with probability 1-p). After the first flip, we are essentially waiting for the other side to appear. So, we can write the expected value as: E(N) = p(E(N | First flip is heads)) + (1-p)(E(N | First flip is tails)) Now, let's consider the two conditional expected values: E(N | First flip is heads) = 1 + (1-p)E(N), since the first flip is heads and then we expect to need (1-p) more flips before getting a tail. E(N | First flip is tails) = 1 + pE(N), since the first flip is tails and then we expect to need p more flips before getting a head. Now we can plug these values back into the original equation: E(N) = p(1 + (1-p)E(N)) + (1-p)(1 + pE(N)) Now we can solve for E(N): E(N) = 1 + p(1-p)E(N)+ (1-p)(pE(N)) E(N)(1 - p(1-p) - (1-p)p) = 1 E(N) = \(\frac{1}{1 - p(1-p) - (1-p)p}\) E(N) = \(\frac{1}{2p(1-p)}\)
02

(b) Expected number of flips that land heads

Now, let's consider the ratio of heads to total flips: Ratio of heads = \(\frac{p \cdot E(N)}{E(N)}\) Expected number of flips that land heads = p * E(N) = \(\frac{p}{2p(1-p)}\) = \(\frac{1}{2(1-p)}\)
03

(c) Expected number of flips that land tails

Similarly, the expected number of flips that land tails can be calculated as: Expected number of flips that land tails = (1-p) * E(N) = \(\frac{1-p}{2p(1-p)}\) = \(\frac{1}{2p}\)
04

(d) Expected flips until two heads and one tail

Now, we need to find the expected number of flips needed to get at least two heads and one tail. Let E(M) be the expected number of flips needed to get one more head after getting one head and one tail. E(M) = p(1) + (1-p)(1 + E(M)) E(M) = \(\frac{1}{p}\) Now we can find the expected number of flips needed for two heads and one tail case: Expected number of flips = E(N) + E(M) = \(\frac{1}{2p(1-p)} + \frac{1}{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 91Ó°ÊÓ!

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

You have two opponents with whom you alternate play. Whenever you play \(A\), you win with probability \(p_{A}\); whenever you play \(B\), you win with probability \(p_{B}\), where \(p_{B}>p_{A} .\) If your objective is to minimize the number of games you need to play to win two in a row, should you start with \(A\) or with \(B\) ? Hint: Let \(E\left[N_{i}\right]\) denote the mean number of games needed if you initially play \(i\). Derive an expression for \(E\left[N_{A}\right]\) that involves \(E\left[N_{B}\right]\); write down the equivalent expression for \(E\left[N_{B}\right]\) and then subtract.

In the list problem, when the \(P_{i}\) are known, show that the best ordering (best in the sense of minimizing the expected position of the element requested) is to place the elements in decreasing order of their probabilities. That is, if \(P_{1}>P_{2}>\cdots>P_{n}\), show that \(1,2, \ldots, n\) is the best ordering.

An unbiased die is successively rolled. Let \(X\) and \(Y\) denote, respectively, the number of rolls necessary to obtain a six and a five. Find (a) \(E[X]\), (b) \(E[X \mid Y=1]\), (c) \(E[X \mid Y=5]\).

The opponents of soccer team \(\mathrm{A}\) are of two types: either they are a class 1 or a class 2 team. The number of goals team A scores against a class \(i\) opponent is a Poisson random variable with mean \(\lambda_{i}\), where \(\lambda_{1}=2\), \(\lambda_{2}=3 .\) This weekend the team has two games against teams they are not very familiar with. Assuming that the first team they play is a class 1 team with probability \(0.6\) and the second is, independently of the class of the first team, a class 1 team with probability \(0.3\), determine (a) the expected number of goals team A will score this weekend. (b) the probability that team A will score a total of five goals.

\(\mathrm{A}\) and \(\mathrm{B}\) play a series of games with A winning each game with probability \(p .\) The overall winner is the first player to have won two more games than the other. (a) Find the probability that \(\mathrm{A}\) is the overall winner. (b) Find the expected number of games played.

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.