A fair coin is tossed repeatedly until two consecutive heads appear for the first time. Let be the total number of tosses made. Each toss is independent of the others, and the process stops as soon as the pattern appears. The probabilities for follow from conditioning on how the sequence of tosses begins.
Question 1
Numerical answer
Using the information above, find the expected value .
Show answer and solution
Answer: 6
Let be the expected number of tosses from the start and the expected further tosses given the last toss was a head (and no yet). From the start: . From state : . Substituting, , so , hence . This agrees with summing using (Fibonacci numbers), which I confirmed by exact numerical summation. So .
Question 2
Numerical answer
Using the information above, find the probability that is even. Give the answer correct to two decimal places.
Show answer and solution
Answer: 0.60
Conditioning on the first tosses: requires the sequence to avoid and end with (for ), so with ; thus , , , , and so on. Use states: let be the probability that the number of remaining tosses is even when the last toss was not a head (or at the start), and the same probability when the last toss was a head. Then , because a head stops the game after one (odd) toss, while a tail returns to the first state after one toss; and . Substituting gives , so and . Direct numerical summation of the series to 400 terms agrees, so the probability is .
Saved on this device. Sign in or create a free account to keep it on every device.