A fair coin is tossed 5 times then the probability that no two consecutive heads occur, is:
Step-by-Step Solution
Key Concept: Use recurrence relation $a_{n+2} = a_{n+1} + a_n$ to count binary strings with no consecutive heads, where strings either end in T (giving $a_{n+1}$ possibilities) or end in HT (giving $a_n$ possibilities). Divide by total outcomes $2^5 = 32$.
Let $a_n$ denote strings of H and T with length $n$ and no adjacent H's. We have $a_1 = 2, a_2 = 3$, and the recurrence $a_{n+2} = a_{n+1} + a_n$ (string must start with T or HT). Computing: $a_3 = 5, a_4 = 8, a_5 = 13$. The probability is $ rac{13}{2^5} = rac{13}{32}$.
Correct Answer: 3