2010 AMC 12A Problem 18

Attempt Problem 18 of the 2010 AMC 12A below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2010 AMC 12A solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

18.

A 1616-step path is to go from (4,4)(-4,-4) to (4,4)(4,4) with each step increasing either the xx-coordinate or the yy-coordinate by 1.1. How many such paths stay outside or on the boundary of the square 2x2,-2\le x\le2, 2y2-2\le y\le2 at each step?

9292

144144

15681568

16981698

12,80012{,}800

Answer: D
Concepts:lattice pathscombinationssymmetry
Difficulty rating: 1880
Solution:

Every step increases x+yx+y by 1,1, which runs from 8-8 to 8,8, so each path passes through exactly one lattice point with x+y=0.x+y=0.

To stay out of the open square, that point (t,t)(t,-t) must have t2,|t|\ge2, so it is one of (±2,2),(±3,3),(±4,4).(\pm2,\mp2),(\pm3,\mp3),(\pm4,\mp4).

By symmetry consider the three points (4,4),(3,3),(2,2)(-4,4),(-3,3),(-2,2) and double. The number of paths from (4,4)(-4,-4) to ((4j),4j)(-(4-j),4-j) is (8j),\binom{8}{j}, and the number continuing on to (4,4)(4,4) is also (8j).\binom{8}{j}.

Therefore the total is 2((80)2+(81)2+(82)2)=2(1+64+784)=1698. \begin{gathered} 2\left(\binom80^2+\binom81^2+\binom82^2\right) \\ =2(1+64+784) \\ =1698. \end{gathered}

Thus, D is the correct answer.

← Problem 17#17
Full Exam

Problem 18 in Other Years