This problem is #19 from the AMC 12 2016A, and goes as follows:
Jerry starts at $0$ on the real number line. He tosses a fair coin $8$ times. When he gets heads, he moves $1$ unit in the positive direction; when he gets tails, he moves $1$ unit in the negative direction. The probability that he reaches $4$ at some time during this process $\frac{a}{b},$ where $a$ and $b$ are relatively prime positive integers. What is $a + b?$
Even though the link above does provide a solution (which I understand), I tried to solve it in a different way. I came up with a different answer, and can’t figure out what’s wrong with my approach.
I tried counting all the ways in which you can reach 4 heads (net) at some point, which can be divided into 3 categories.
- You win if you start with 4 heads, which means the last 4 throws don’t matter, so there are ${2}^{4}$ or 16 possibilities for the last 4 and thus there’s 16 possible solutions from this.
- If you start with 5 heads and 1 tail, the last two throws don’t matter, which contributes 4 different solutions. That tail can come at the first, second, third, or fourth position (if it’s at the 5th or 6th spot, we would be overcounting because it would be covered by the #1), so we multiply by 4 and get 16 more solutions from this one.
- If we start with 6 heads and 2 tails, we get that the two tails can be at the 1,2 | 1,3 | 1,4 | 1,5 | 2,3 | 2,4 | 2,5 | 3,4 | 3,5 | 4,5 positions, which is 10 (if either one is in the 6th or 7th position, we would be over counting), so this leads to 10 more solutions.
Therefore, my solution was $\frac{16+16+10}{{2}^{8}}=\frac{42}{256}=\frac{21}{128}\Rightarrow 149$. However, the solution given by the AoPS is $\frac{46}{256}=\frac{23}{128}\Rightarrow 151$. This means that I am missing 4 different combinations that my method doesn’t cover. What am I doing wrong?
Thank you in advance.