Q 7.33

Question

A coin that lands on heads with probability p is continually flipped. Compute the expected number of flips that are made until a string of r heads in a row is obtained. Hint: Condition on the time of the first occurrence of tails to obtain the equation E[X] = (1 − p) r i=1 pi−1(i + E[X]) +(1 − p) q i=r+1 pi−1r Simplify and solve for E[X]. 

Step-by-Step Solution

Verified
Answer

E[X]=1-p'p'(1-p)2

1Step 1 Given Information

A coin that lands on heads with probability p is continually flipped. 

We have to find the expected number of flips that are made until a string of r heads in a row is obtained.  

2Step 2 Explanation

A coin that lands on heads with probability is continually flipped. Compute the expected number of flips that are made until a string of r heads in a row is obtained.

Let X denote the number of flips are made until a string of r heads in a row is obtained.

Let Ydenote the number of flips until the first occurrence of tails. Then,

E[X]=E{E[XY]}

=i=1E[XY=i]P(Y=i)

 Note P(Y=i)=pi-1(1-p)

Forir, then on the i+1 flip, the rconsecutive heads is, 
E[XY=i]=i+E[X] 

For i>r, then the first r flips are heads is 


E[XY=i]=r

 




3Step 3 Final Answer

E[X]=(1-p)i=1ripi-1+E[X]1-pr+rp2

=(1-p)1-(1-p)rP'-p'(1-p)2+E[X]1-p'+rp'

=1-p'1-p+E[X]1-p2

=1-p'p'(1-p)2