Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

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

(Created page with '== Problem 18 == A 16-step path is to go from <math>(-4,-4)</math> to <math>(4,4)</math> with each step increasing either the <math>x</math>-coordinate or the <math>y</math>-coor…')
 
(→‎Brute Force Solution)
Line 4: Line 4:
 
<math>\textbf{(A)}\ 92 \qquad \textbf{(B)}\ 144 \qquad \textbf{(C)}\ 1568 \qquad \textbf{(D)}\ 1698 \qquad \textbf{(E)}\ 12,800</math>
 
<math>\textbf{(A)}\ 92 \qquad \textbf{(B)}\ 144 \qquad \textbf{(C)}\ 1568 \qquad \textbf{(D)}\ 1698 \qquad \textbf{(E)}\ 12,800</math>
  
−
== Brute Force Solution ==
+
== Solution ==
 +
=== Brute Force Solution ===
 
The number of ways to reach any point <math>(x,y)</math> on the grid is equal to the number of ways to reach <math>(x-1,y)</math> plus the number of ways to reach <math>(x,y-1)</math>. Using this recursion, we can draw the diagram and label each point with the number of ways to reach it and go up until we reach the end. Luckily, the figure is not so big that this is too time-consuming or difficult to do.
 
The number of ways to reach any point <math>(x,y)</math> on the grid is equal to the number of ways to reach <math>(x-1,y)</math> plus the number of ways to reach <math>(x,y-1)</math>. Using this recursion, we can draw the diagram and label each point with the number of ways to reach it and go up until we reach the end. Luckily, the figure is not so big that this is too time-consuming or difficult to do.
  
Line 30: Line 31:
  
 
We soon reach <math>(4,4) \Rightarrow 1698\ \boxed{\textbf{(D)}}</math>
 
We soon reach <math>(4,4) \Rightarrow 1698\ \boxed{\textbf{(D)}}</math>
 +
 +
=== A more combinatorial solution ===
 +
 +
By symmetry we only need to count the paths that go through the second quadrant (<math>x<0</math>, <math>y>0</math>).
 +
 +
For each of these paths, let <math>(a,2)</math> be the first point when it reaches <math>y=2</math>. Clearly <math>a\in\{-4,-3,-2\}</math> and the previous point on such path has to be <math>(a,1)</math>.
 +
 +
Fix the value of <math>a</math>. There are <math>{a+9 \choose 5}</math> ways how the path can go from <math>(-4,-4)</math> to <math>(a,1)</math>, and then there are <math>{6-a \choose 2}</math> ways how the path can go from <math>(a,2)</math> to <math>(4,4)</math>.
 +
 +
Hence for <math>a=-4</math> we get <math>{5 \choose 5}{10 \choose 2}=45</math> paths, for <math>a=-3</math> we get <math>{6 \choose 5}{9 \choose 2}=6\cdot 36=216</math> paths, and for <math>a=-2</math> we get <math>{7 \choose 5}{8 \choose 2}=21\cdot 28=588</math> paths. This gives us <math>45+216+588 = 849</math> paths through the second quadrant, hence the total number of paths is <math>2\cdot 849 = 1698</math>.
 +
 +
=== Another combinatorial solution ===
 +
 +
Each path that goes through the second quadrant must pass through exactly one of the points <math>(-4,4)</math>, <math>(-3,3)</math>, and <math>(-2,2)</math>.
 +
 +
There is exactly <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. The conclusion remains the same.

Revision as of 08:19, 16 February 2010

Problem 18

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

Brute Force Solution

The number of ways to reach any point $(x,y)$ on the grid is equal to the number of ways to reach $(x-1,y)$ plus the number of ways to reach $(x,y-1)$. Using this recursion, we can draw the diagram and label each point with the number of ways to reach it and go up until we reach the end. Luckily, the figure is not so big that this is too time-consuming or difficult to do.

For example:

$(-4,-4) \Rightarrow 1$

$(-3,-4) \Rightarrow 1$

$(-2,-4) \Rightarrow 1$

$(-4,-3) \Rightarrow 1$

$(-4,-2) \Rightarrow 1$

$(-3,-3) \Rightarrow 2$

$(-2,-3) \Rightarrow 3$

$(-3,-2) \Rightarrow 3$

$(-2,-2) \Rightarrow 6$

etc.

We soon reach $(4,4) \Rightarrow 1698\ \boxed{\textbf{(D)}}$

A more combinatorial solution

By symmetry we only need to count the paths that go through the second quadrant ($x<0$, $y>0$).

For each of these paths, let $(a,2)$ be the first point when it reaches $y=2$. Clearly $a\in\{-4,-3,-2\}$ and the previous point on such path has to be $(a,1)$.

Fix the value of $a$. There are ${a+9 \choose 5}$ ways how the path can go from $(-4,-4)$ to $(a,1)$, and then there are ${6-a \choose 2}$ ways how the path can go from $(a,2)$ to $(4,4)$.

Hence for $a=-4$ we get ${5 \choose 5}{10 \choose 2}=45$ paths, for $a=-3$ we get ${6 \choose 5}{9 \choose 2}=6\cdot 36=216$ paths, and for $a=-2$ we get ${7 \choose 5}{8 \choose 2}=21\cdot 28=588$ paths. This gives us $45+216+588 = 849$ paths through the second quadrant, hence the total number of paths is $2\cdot 849 = 1698$.

Another combinatorial solution

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 exactly $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. The conclusion remains the same.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2010_AMC_12A_Problems/Problem_18&oldid=33559"