Difference between revisions of "1997 AIME Problems/Problem 13"
(and a rigorous solution by minsoens) |
|||
Line 84: | Line 84: | ||
[[Category:Intermediate Algebra Problems]] | [[Category:Intermediate Algebra Problems]] | ||
+ | {{MAA Notice}} |
Revision as of 18:36, 4 July 2013
Problem
Let be the set of points in the Cartesian plane that satisfy
If a model of were built from wire of negligible thickness, then the total length of wire required would be , where and are positive integers and is not divisible by the square of any prime number. Find .
Solution
Solution 1
- This solution is non-rigorous.
Let , . Then . We only have a area, so guessing points and graphing won't be too bad of an idea. Since , there's a symmetry about all four quadrants, so just consider the first quadrant. We now gather some points:
We can now graph the pairs of coordinates which add up to . Just using the first column of information gives us an interesting lattice pattern:
Plotting the remaining points and connecting lines, the graph looks like:
Calculating the lengths is now easy; each rectangle has sides of , so the answer is . For all four quadrants, this is , and .
Solution 2
Since and
Also .
Define .
- If :
- If :
- If :
- So the graph of at is symmetric to at (reflected over the line x=3)
- And the graph of at is symmetric to at (reflected over the line x=2)
- And the graph of at is symmetric to at (reflected over the line x=0)
[this is also true for horizontal reflection, with , etc]
So it is only necessary to find the length of the function at and :
(Length = )
This graph is reflected over the line y=3, the quantity of which is reflected over y=2,
- the quantity of which is reflected over y=0,
- the quantity of which is reflected over x=3,
- the quantity of which is reflected over x=2,
- the quantity of which is reflected over x=0..
So a total of doublings = = , the total length = , and .
See also
1997 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 12 |
Followed by Problem 14 | |
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.