Difference between revisions of "2010 AMC 12A Problems/Problem 18"

(Solution)
m (Solution)
Line 10: Line 10:
 
There is <math>1</math> path of the first kind, <math>{8\choose 1}^2=64</math> paths of the second kind, and <math>{8\choose 2}^2=28^2=784</math> paths of the third type.  
 
There is <math>1</math> path of the first kind, <math>{8\choose 1}^2=64</math> paths of the second kind, and <math>{8\choose 2}^2=28^2=784</math> paths of the third type.  
 
Each path that goes through the fourth quadrant must pass through exactly one of the points <math>(4,-4)</math>, <math>(3,-3)</math>, and <math>(2,-2)</math>.
 
Each path that goes through the fourth quadrant must pass through exactly one of the points <math>(4,-4)</math>, <math>(3,-3)</math>, and <math>(2,-2)</math>.
Again, there are <math>1</math> paths of the first kind, <math>{8\choose 1}^2=64</math> paths of the second kind, and <math>{8\choose 2}^2=28^2=784</math> paths of the third type.  
+
Again, there is <math>1</math> path of the first kind, <math>{8\choose 1}^2=64</math> paths of the second kind, and <math>{8\choose 2}^2=28^2=784</math> paths of the third type.  
  
 
Hence the total number of paths is <math>2(1+64+784) = \boxed{1698}</math>.
 
Hence the total number of paths is <math>2(1+64+784) = \boxed{1698}</math>.

Revision as of 20:23, 10 June 2018

Problem

A 16-step path is to go from $(-4,-4)$ to $(4,4)$ with each step increasing either the $x$-coordinate or the $y$-coordinate by 1. How many such paths stay outside or on the boundary of the square $-2 \le x \le 2$, $-2 \le y \le 2$ at each step?

$\textbf{(A)}\ 92 \qquad \textbf{(B)}\ 144 \qquad \textbf{(C)}\ 1568 \qquad \textbf{(D)}\ 1698 \qquad \textbf{(E)}\ 12,800$

Solution

Each path must go through either the second or the fourth quadrant. Each path that goes through the second quadrant must pass through exactly one of the points $(-4,4)$, $(-3,3)$, and $(-2,2)$.

There is $1$ path of the first kind, ${8\choose 1}^2=64$ paths of the second kind, and ${8\choose 2}^2=28^2=784$ paths of the third type. Each path that goes through the fourth quadrant must pass through exactly one of the points $(4,-4)$, $(3,-3)$, and $(2,-2)$. Again, there is $1$ path of the first kind, ${8\choose 1}^2=64$ paths of the second kind, and ${8\choose 2}^2=28^2=784$ paths of the third type.

Hence the total number of paths is $2(1+64+784) = \boxed{1698}$.

See also

2010 AMC 12A (ProblemsAnswer KeyResources)
Preceded by
Problem 17
Followed by
Problem 19
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
All AMC 12 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png