View source for 2011 AMC 12B Problems/Problem 23

==Problem==

A bug travels in the coordinate plane, moving only along the lines that are parallel to the <math>x</math>-axis or <math>y</math>-axis. Let <math>A = (-3, 2)</math> and <math>B = (3, -2)</math>. Consider all possible paths of the bug from <math>A</math> to <math>B</math> of length at most <math>20</math>. How many points with integer coordinates lie on at least one of these paths?

<math>\textbf{(A)}\ 161 \qquad \textbf{(B)}\ 185 \qquad \textbf{(C)}\  195 \qquad \textbf{(D)}\  227 \qquad \textbf{(E)}\  255</math>

==Solution==
We declare a point <math>(x, y)</math> to make up for the extra steps that the bug has to move. If the point <math>(x, y)</math> satisfies the property that <math>|x - 3| + |y + 2| + |x + 3| + |y - 2| \le 20</math>, then it is in the desirable range because <math>|x - 3| + |y + 2|</math> is the length of the shortest path from <math>(x,y)</math> to <math>(3, -2)</math> and <math>|x + 3| + |y - 2|</math> is the length of the shortest path from <math>(x,y)</math> to <math>(-3, 2)</math>.


If <math>-3\le x \le 3</math>, then <math>-7\le y \le 7</math> satisfy the property. there are <math>15 \times 7 = 105</math> lattice points here.

else let <math>3< x \le 8</math> (and for <math>-8 \le x < -3</math> because it is symmetrical) We set 8 as the upper bound for x because the shortest distance from <math>(-3, 2)</math> to <math>(x, y)</math> added to the shortest distance from <math>(x, y)</math> to <math>(3, -2)</math> is <math>|x - 3| + |y + 2| + |x + 3| + |y - 2|</math>. Since the minimum value for the difference between the y-coordinates is at <math>y = 0</math>, we get <math>2x + 4 = 20</math> or <math>-2x + 4 = 20</math>. Thus, the upper and lower bounds for <math>x</math> are <math>8</math> and <math>-8</math>, respectively.

Now we test each value for x satisfying <math>3< x \le 8</math> and double the result because of symmetry.

For <math>x = 4</math>, the possibles values of y are such that <math>|2y| \le 12</math> for a total of <math>13</math> lattice points,

for <math>x = 5</math>, the possibles values of y are such that <math>|2y| \le 10</math> for a total of <math>11</math> lattice points,

for <math>x = 6</math>, the possibles values of y are such that <math>|2y| \le 8</math> for a total of <math>9</math> lattice points,

for <math>x = 7</math>, the possibles values of y are such that <math>|2y| \le 6</math> for a total of <math>7</math> lattice points,

for <math>x = 8</math>, the possibles values of y are such that <math>|2y| \le 4</math> for a total of <math>5</math> lattice points,
<br />

Hence, there are a total of <math>105 + 2 ( 13 + 11 + 9 + 7 + 5) = \boxed{(C) 195}</math> lattice points.

One may also obtain the result by using Pick's Theorem(how?).

<math>i = a - \frac{b}{2} - 1</math> (Suggestion)

==Solution 2==

<asy>
import graph;
import patterns;
unitsize(1cm);

add("tile",tile());
add("checker",checker());

filldraw((-3,2)--(3,2)--(3,-2)--(-3,-2)--cycle,pattern("checker"));

filldraw((-3,2)--(-3,7)--(3,7)--(3,2)--cycle,pattern("tile"));
filldraw((-3,-2)--(-3,-7)--(3,-7)--(3,-2)--cycle,pattern("tile"));
filldraw((-8,2)--(-3,2)--(-3,-2)--(-8,-2)--cycle,pattern("tile"));
filldraw((8,2)--(3,2)--(3,-2)--(8,-2)--cycle,pattern("tile"));

draw((8,2)--(3,7)--(-3,7)--(-8,2)--(-8,-2)--(-3,-7)--(3,-7)--(8,-2)--cycle,blue);

xaxis(-9,9,Ticks(NoZero,Step=1));
yaxis(-8,8,Ticks(NoZero,Step=1));
dot((-3,2));label("$A$",(-3,2),N);
dot((3,-2));label("$B$",(3,-2),N);
// Asymptote by Technodoggo; August 16, 2024
</asy>
(Diagram for Solution 2 by Technodoggo also don't ask about the patterns, I just figured out how to use the patterns module)

Notice that the bug is basically moving from A to B (length 10) but optionally going on a detour anywhere along its route. 

Specifically, the detour would be of total length 10, 5 to some point and then going back by retracing its path (also length 5). Just to simplify things we can observe that the coordinates don't matter here and all we need to remember is that A and B are the diagonally opposite vertices of a 4 by 6 rectangle (5 by 7 lattice points). The bug can start the "detour" from any point on or inside the rectangle. Notice that the bug can go 5 steps in the y direction, 5 steps in the x direction, or anything in between, so the points covered by possible detours from any point would look like a rhombus or square rotated 45 degrees (with centre at a point on or inside the rectangle). Drawing this out we would get an octagon. 

Finding the final answer is then easy, for this solution I will slice the octagon into 4 rectangles (2 of which are squares) and 4 isosceles triangles. There are <math>(4+1)\cdot (6+1) = 35</math> points on or inside the original triangle, <math>5\cdot 7</math> points covered by the rectangles above and below the original one and <math>5\cdot 5</math> points for the squares to the right and left of the original triangle. Lastly each of the four isosceles triangles cover <math>4+3+2+1 = 10</math> points. (Notice that although the length of the detour is 5, the points on the edge of the triangles were already counted). 

Adding these up, we get <math>3\cdot 35 + 2\cdot 25 + 4\cdot 10 = 195 => \boxed{(C)}</math>

Another way to get to the octagon would be to note that aside from the 4x6/5x7 box of the bare absolutely necessary route (the checkered region), we can go on a 5-step detour anywhere (as above); we need only examine how far we can get through the edges (the border), because that takes us the farthest. Starting from any point on the border, the farthest that it can go is 5 units in some cardinal direction, which gives us the tiled region in the diagram above. Finally, from our corners, we can also go 4-1, 3-2, 2,3, or 1-4, which gives us the rest of the region enclosed in blue. This gives us our octagon. 

tl;dr the interior of the octagon in blue is a result of taking all the points that can be reached from the boundary of the box as described in no more than 5 moves. We can then proceed to find the area in any simple way. (Extra way & diagram by Technodoggo)


==Solution 3 (think about it a lil bit)==

We start with reaching <math>B</math> from <math>A</math> first. It only takes <math>10</math> moves, a sequence of moves down and towards the right. This is a <math>5</math> by <math>7</math> grid of squares. For the remaining <math>10</math> moves, we can move <math>5</math> moves out, and then spend the other <math>5</math> moves "undoing" these <math>5</math> moves. For example, we can move <math>4</math> left and <math>1</math> up at the start, and of the remaining <math>15</math> moves, there must be <math>4</math> "downs" and <math>6</math> "rights", along with <math>5</math> moves that undo the original <math>5</math> at the start.


Drawing it on a grid, we will have one center rectangle, 4 rectangles attached to it (1 on each side), and 1 triangle in each corner. The total number of points is <math>35+35+35+25+25+10+10+10+10 = \boxed{\textbf{(C) }195}</math>.

-skibbysiggy

== See also ==
{{AMC12 box|year=2011|num-b=22|num-a=24|ab=B}}
{{MAA Notice}}