A fair coin is tossed repeatedly until two consecutive heads appear for the first time. Let denote the number of tosses required. It is known that the number of head-tail sequences of length that end in (for , in ) and contain no earlier occurrence of two consecutive heads is the Fibonacci number , where , , and so on. Give each answer correct to two decimal places.
Question 1
Numerical answer
The probability is
Show answer and solution
Answer: 0.08
With we have . Equivalently, a valid length-6 sequence must end in THH, and its first three tosses must contain no HH; there are exactly such three-toss prefixes (TTT, TTH, THT, HTT, HTH), each followed by THH, giving 5 sequences out of .
Question 2
Numerical answer
The probability is
Show answer and solution
Answer: 0.67
Using : , , , , . Over the common denominator these are , summing to .
Saved on this device. Sign in or create a free account to keep it on every device.