1990 AIME Problems/Problem 9

Revision as of 21:20, 2 March 2007 by Azjps (talk | contribs) (solution)

Problem

A fair coin is to be tossed $10_{}^{}$ times. Let $i/j^{}_{}$, in lowest terms, be the probability that heads never occur on consecutive tosses. Find $i+j_{}^{}$.

Solution

Clearly, at least $5$ tails must be flipped; any less, then by the pigeonhole principle there will be heads that appear on consecutive tosses.

Consider the case when $5$ tails occur. The heads must fall between the tails such that no two heads fall between the same tails, and must fall in the positions labeled $(H)$:

$(H)\ T\ (H)\ T\ (H)\ T\ (H)\ T\ (H)\ T\ (H)$

There are six slots for the heads to be placed, but only $5$ heads remaining. Thus, there are ${6\choose5}$ possible combinations of 5 heads. Continuing this pattern, we find that there are $\displaystyle\sum_{i=6}^{11} {i\choose{11-i}} = {6\choose5} + {7\choose4} + {8\choose3} + {9\choose2} + {{10}\choose1} + {{11}\choose0} = 6 + 35 + 56 + 36 + 10 + 1 = 144$. There are a total of $2^{10}$ possible flips of $10$ coins, making the probability $\frac{144}{1024} = \frac{9}{64}$. Thus, our solution is $9 + 64 = 73$.

See also

1990 AIME (ProblemsAnswer KeyResources)
Preceded by
Problem 8
Followed by
Problem 10
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
All AIME Problems and Solutions