/*! 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 58 A coin having probability \(p\) ... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

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) The expected number of flips until both heads and tails appear is: \[ E = p\left(1+\frac{1}{1-p}\right) \] (b) The probability that the last flip lands on heads is: \[ P(A) = \frac{1-p}{1 + p} \]

Step by step solution

01

Calculate the probability of obtaining both heads and tails in a given number of flips

To find the expected number of flips, let's start by computing the probability of obtaining both heads and tails in a given number of flips. If the first flip is a head (which occurs with probability \(p\)), we can think of this as waiting for a tail to appear. The probability of this happening is the geometric distribution with parameter \((1-p)\). The expected number of flips for this to happen is \(\frac{1}{1-p}\), and since the first flip was a head, we need to add one more flip. Combining these, we get that the expected number of flips for both heads and tails to appear is: \[ E = p\left(1+\frac{1}{1-p}\right) \]
02

Calculate the probability of the last flip landing on heads

To find the probability that the last flip is heads, we need to consider the possible scenarios. Let's denote the last flip landing on heads by event A and the last flip landing on tails by event B. Since the coin can flip either heads or tails at any moment, A and B are complementary events, and therefore: \[ P(A) = 1-P(B) \] Now we need to compute the probability of event B. Let's count the flips from the first occurrence of tails: suppose the first tails appears in the \(i\)-th flip and the flips end with tails. In this case both since head and tails need to occur, \(i\) can take on a value from 1 to n-1. Since there are total \(n\) flips. Let's compute the probability that A happens given that the first tails appears in the \(i\)-th flip: \[ P(A \mid i) = p^{i} \] This is true because tails needed to occur, and the remaining flips, from \(i\) to \(n\), must all be heads. Now we need to compute the likelihood of the first tails appearing in the \(i\)-th flip: \[ P(i) = p^{i-1}(1-p) \] Using the law of total probability, we can compute the probability of the last flip landing on - event A: \[ P(A) = \sum_{i=1}^{n-1} P(A \mid i)P(i) = \sum_{i=1}^{n-1} p^{i}p^{i-1}(1-p) = (1-p)\sum_{i=1}^{n-1} p^{2i-1} \] Finally, as \(n\) goes to infinity, the probability that the last flip is heads becomes: \[ \lim_{n \to \infty} P(A) = \frac{1-p}{1 + p} \]
03

Summarizing the results

(a) The expected number of flips until both heads and tails appear is: \[ E = p\left(1+\frac{1}{1-p}\right) \] (b) The probability that the last flip lands on heads is: \[ P(A) = \frac{1-p}{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

If \(X\) and \(Y\) are independent and identically distributed with mean \(\mu\) and variance \(\sigma^{2},\) find $$ E\left[(X-Y)^{2}\right] $$

The game of Clue involves 6 suspects, 6 weapons, and 9 rooms. One of each is randomly chosen and the object of the game is to guess the chosen three.(a) How many solutions are possible? In one version of the game, the selection is made and then each of the players is randomly given three of the remaining cards. Let \(S, W\) and \(R\) be, respectively, the numbers of suspects, weapons, and rooms in the set of three cards given to a specified player. Also, let \(X\) denote the number of solutions that are possible after that player observes his or her three cards. (b) Express \(X\) in terms of \(S, W,\) and \(R\) (c) Find \(E[X]\)

In an urn containing \(n\) balls, the \(i\) th ball has weight \(W(i), i=1, \ldots, n .\) The balls are removed without replacement, one at a time, according to the following rule: At each selection, the probability that a given ball in the urn is chosen is equal to its weight divided by the sum of the weights remaining in the urn. For instance, if at some time \(i_{1}, \ldots, i_{r}\) is the set of balls remaining in the urn, then the next selection will be \(i_{j}\) with probability \(W\left(i_{j}\right) / \sum_{k=1}^{r} W\left(i_{k}\right), j=1, \ldots, r .\) Compute the expected number of balls that are withdrawn before ball number 1 is removed.

If \(X\) and \(Y\) have joint density function $$f_{X, Y}(x, y)=\left\\{\begin{array}{ll} 1 / y, & \text { if } 0

Let \(X_{1}, X_{2}, \ldots\) be a sequence of independent and identically distributed continuous random variables. Let \(N \geq 2\) be such that $$ X_{1} \geq X_{2} \geq \dots \geq X_{N-1}

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.