Difference between revisions of "2011 AMC 12B Problems/Problem 23"
Danielguo94 (talk | contribs) m (→Solution) |
(→Solution) |
||
(11 intermediate revisions by 8 users not shown) | |||
Line 8: | Line 8: | ||
Answer: (C) | Answer: (C) | ||
− | If a point <math>(x, y)</math> | + | If a 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 shortest path from <math>(x,y)</math> to <math>B</math>, and <math>|x + 3| + |y - 2|</math> is the shortest path from <math>(x,y)</math> to <math>A</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> | + | 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> it is symmetrical | + | else let <math>3< x \le 8</math> (and for <math>-8 \le x < -3</math> it is symmetrical) <math>-7 + (x - 3)\le y \le 7 - (x - 3)</math>, |
− | <math>- | + | <math>-10 + x\le y \le 10 - x</math> |
− | So for <math>x = 4</math>, there are <math>13</math> | + | So for <math>x = 4</math>, there are <math>13</math> lattice points, |
− | for <math>x = 5</math>, there are <math>11</math> | + | for <math>x = 5</math>, there are <math>11</math> lattice points, |
− | etc | + | etc. |
− | + | For <math>x = 8</math>, there are <math>5</math> lattice points. | |
<br /> | <br /> | ||
− | Hence, there are a total of <math>105 + 2 ( 13 + 11 + 9 + 7 + 5) = 195</math> lattice points. | + | Hence, there are a total of <math>105 + 2 ( 13 + 11 + 9 + 7 + 5) = \boxed{195}</math> lattice points. <math>\square</math> |
+ | |||
+ | One may also obtain the result by using pick's theorem. | ||
== See also == | == See also == | ||
{{AMC12 box|year=2011|num-b=22|num-a=24|ab=B}} | {{AMC12 box|year=2011|num-b=22|num-a=24|ab=B}} | ||
+ | {{MAA Notice}} |
Revision as of 13:05, 29 October 2019
Problem
A bug travels in the coordinate plane, moving only along the lines that are parallel to the -axis or -axis. Let and . Consider all possible paths of the bug from to of length at most . How many points with integer coordinates lie on at least one of these paths?
Solution
Answer: (C)
If a point satisfies the property that , then it is in the desirable range because is the shortest path from to , and is the shortest path from to
If , then satisfy the property. there are lattice points here.
else let (and for it is symmetrical) ,
So for , there are lattice points,
for , there are lattice points,
etc.
For , there are lattice points.
Hence, there are a total of lattice points.
One may also obtain the result by using pick's theorem.
See also
2011 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 22 |
Followed by Problem 24 |
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.