/*! 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} Q.4.70 At time 0, a coin that comes up ... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

At time 0, a coin that comes up heads with probability p is flipped and falls to the ground. Suppose it lands on heads. At times chosen according to a Poisson process with rate λ, the coin is picked up and flipped. (Between these times, the coin remains on the ground.) What is the probability that the coin is on its head side at timet? Hint: What would be the conditional probability if there were no additional flips by time t, and what would it be if there were additional flips by time t?

Short Answer

Expert verified

The required probability ise-λt+p·1-e-λt

Step by step solution

01

Step 1:Given information

At time 0, a coin that comes up heads with probability p is flipped and falls to the ground. Suppose it lands on heads. At times chosen according to a Poisson process with rate λ, the coin is picked up and flipped. (Between these times, the coin remains on the ground.)

02

Step 2:Explanation

Since we select our times of flipping a coin according to the Poisson process with the rate λ, the number of times that we flip a coin before has distribution Pois (λt). Name that random variable Y. If Y=0, by the definition, the probability that we will finish with Head on is 1 since we do not flip a coin and we are told that we begin with Head. If Y≥1, the probability that we finish with Heads is simply psince it only depends on the final throw. Hence, the probability is

p=P(Head∣Y=0)P(Y=0)+P(Head ∣Y≥1)P(Y≥1)

=e-λt+p·1-e-λt

03

Step 3:Final answer

The required probability ise-λt+p·1-e-λt

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

Suppose that a die is rolled twice. What are the possible values that the following random variables can take on:

(a) the maximum value to appear in the two rolls;

(b) the minimum value to appear in the two rolls;

(c) the sum of the two rolls;

(d) the value of the first roll minus the value of the second roll?

Consider a random collection of nindividuals. In approximating the probability that no 3of these individuals share the same birthday, a better Poisson approximation than that obtained in the text (at least for values of nbetween 80and 90) is obtained by letting Eibe the event that there are at least 3 birthdays on dayi,i=1,...,365.

(a) Find PEi.

(b) Give an approximation for the probability that no3individuals share the same birthday.

(c) Evaluate the preceding when n=88(which can be shown to be the smallest value ofnfor which the probability exceeds.5).

Show how the derivation of the binomial probabilities P{X=i}=nipi(1-p)n-i,i=0,…,nleads to a proof of the binomial theorem (x+y)n=∑i=0nnixiyn-iwhen xand yare nonnegative.

Hint: Let p=xx+y.

Here is another way to obtain a set of recursive equations for determining Pn, the probability that there is a string of kconsecutive heads in a sequence of nflips of a fair coin that comes up heads with probability p:

(a) Argue that for k<n, there will be a string of kconsecutive heads if either

1. there is a string of kconsecutive heads within the first n-1flips, or

2. there is no string of kconsecutive heads within the first n-k-1flips, flip n-kis a tail, and flips n-k+1,…,nare all heads.

(b) Using the preceding, relate PntoPn-1. Starting with Pk=pk, the recursion can be used to obtain Pk+1, thenPk+2, and so on, up to Pn.

Five distinct numbers are randomly distributed to players numbered1through 5. Whenever two players compare their numbers, the one with the higher one is declared the winner. Initially, players1and 2 compare their numbers; the winner then compares her number with that of player 3, and so on. Let X denote the number of times player 1 is a winner. FindPX=i,i=0,1,2,3,4.

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.