2014 AIME II Problems/Problem 9

Revision as of 09:58, 28 March 2014 by Suli (talk | contribs) (Created page with "==Solution== Starting with small cases, we see that four chairs give 4 + 1 = 5, five chairs give 5 + 5 + 1 = 11, and six chairs give 6 + 6 + 6 + 6 + 1 = 25. Thus, I claim that n ...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Solution

Starting with small cases, we see that four chairs give 4 + 1 = 5, five chairs give 5 + 5 + 1 = 11, and six chairs give 6 + 6 + 6 + 6 + 1 = 25. Thus, I claim that n chairs give $n 2^{n-4} + 1$, as confirmed above. This claim can be verified by PIE: there are $n 2^(n-3}$ (Error compiling LaTeX. ! Extra }, or forgotten $.) ways to arrange 3 adjacent chairs, but then we subtract $n 2^{n-4}$ ways to arrange 4. Finally, we add 1 to account for all chairs case (the other cases have been taken care of). Thus, for n = 10 we get $\boxed{641}$.

Invalid username
Login to AoPS