Difference between revisions of "2010 AIME I Problems/Problem 8"
m (idk) |
|||
Line 14: | Line 14: | ||
dot((0,5),ds); dot((3,4),ds); dot((4,3),ds); dot((5,0),ds); dot((4,-3),ds); dot((3,-4),ds); dot((0,-5),ds); dot((-3,-4),ds); dot((-4,-3),ds); dot((-4,3),ds); dot((-3,4),ds); dot((-2,4),ds); dot((-2,5),ds); dot((-3,5),ds); dot((4,4),ds); dot((4,5),ds); dot((3,5),ds); dot((5,3),ds); dot((5,4),ds); dot((4,4),ds); dot((6,0),ds); dot((6,1),ds); dot((5,1),ds); dot((5,-3),ds); dot((5,-2),ds); dot((4,-2),ds); dot((3,-3),ds); dot((4,-4),ds); dot((4,-3),ds); dot((1,-5),ds); dot((1,-4),ds); dot((0,-4),ds); dot((-2,-4),ds); dot((-2,-3),ds); dot((-3,-3),ds); dot((-3,-2),ds); dot((-4,-2),ds); dot((-3,3),ds); dot((-3,4),ds); dot((-4,4),ds); dot((-5,0),ds); dot((-4,0),ds); dot((-4,1),ds); dot((-5,1),ds); dot((0,6),ds); dot((1,5),ds); dot((1,6),ds); | dot((0,5),ds); dot((3,4),ds); dot((4,3),ds); dot((5,0),ds); dot((4,-3),ds); dot((3,-4),ds); dot((0,-5),ds); dot((-3,-4),ds); dot((-4,-3),ds); dot((-4,3),ds); dot((-3,4),ds); dot((-2,4),ds); dot((-2,5),ds); dot((-3,5),ds); dot((4,4),ds); dot((4,5),ds); dot((3,5),ds); dot((5,3),ds); dot((5,4),ds); dot((4,4),ds); dot((6,0),ds); dot((6,1),ds); dot((5,1),ds); dot((5,-3),ds); dot((5,-2),ds); dot((4,-2),ds); dot((3,-3),ds); dot((4,-4),ds); dot((4,-3),ds); dot((1,-5),ds); dot((1,-4),ds); dot((0,-4),ds); dot((-2,-4),ds); dot((-2,-3),ds); dot((-3,-3),ds); dot((-3,-2),ds); dot((-4,-2),ds); dot((-3,3),ds); dot((-3,4),ds); dot((-4,4),ds); dot((-5,0),ds); dot((-4,0),ds); dot((-4,1),ds); dot((-5,1),ds); dot((0,6),ds); dot((1,5),ds); dot((1,6),ds); | ||
clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); </asy></center> | clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); </asy></center> | ||
+ | |||
+ | ==Video Solution== | ||
+ | |||
+ | https://youtu.be/lhY7-TKQPAg | ||
== See Also == | == See Also == |
Revision as of 18:12, 28 June 2020
Contents
Problem
For a real number , let denominate the greatest integer less than or equal to . Let denote the region in the coordinate plane consisting of points such that . The region is completely contained in a disk of radius (a disk is the union of a circle and its interior). The minimum value of can be written as , where and are integers and is not divisible by the square of any prime. Find .
Solution
The desired region consists of 12 boxes, whose lower-left corners are integers solutions of , namely Since the points themselves are symmetric about , the boxes are symmetric about . The distance from to the furthest point on a box that lays on an axis, for instance , is The distance from to the furthest point on a box in the middle of a quadrant, for instance , is The latter is the larger, and is , giving an answer of .
Video Solution
See Also
2010 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 7 |
Followed by Problem 9 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.