Difference between revisions of "2010 AMC 12A Problems/Problem 13"
(→See also) |
Flamedragon (talk | contribs) (→Solution 2:) |
||
Line 40: | Line 40: | ||
This is a total of <math>\boxed{2\ \textbf{(C)}}</math> values. | This is a total of <math>\boxed{2\ \textbf{(C)}}</math> values. | ||
− | == | + | == Solution 2 == |
Revision as of 20:16, 17 February 2014
Contents
Problem
For how many integer values of do the graphs of and not intersect?
Solution
The image below shows the two curves for . The blue curve is , which is clearly a circle with radius , and the red curve is a part of the curve .
In the special case the blue curve is just the point , and as , this point is on the red curve as well, hence they intersect.
The case is symmetric to : the blue curve remains the same and the red curve is flipped according to the axis. Hence we just need to focus on .
Clearly, on the red curve there will always be points arbitrarily far from the origin: for example, as approaches 0, approaches . Hence the red curve intersects the blue one if and only if it contains a point whose distance from the origin is at most .
At this point we can guess that on the red curve the point where is always closest to the origin, and skip the rest of this solution.
For an exact solution, fix and consider any point on the red curve. Its distance from the origin is . To minimize this distance, it is enough to minimize . By the Arithmetic Mean-Geometric Mean Inequality we get that this value is at least , and that equality holds whenever , i.e., .
Now recall that the red curve intersects the blue one if and only if its closest point is at most from the origin. We just computed that the distance between the origin and the closest point on the red curve is . Therefore, we want to find all positive integers such that .
Clearly the only such integer is , hence the two curves are only disjoint for and . This is a total of values.
Solution 2
From the graph shown above, we see that there is a specific point closest to the center of the circle. Using some logic, we realize that as long as said furthest point is not inside or on the graph of the circle. This should be enough to conclude that the hyperbola does not intersect the circle.
Therefore, for each value of k, we only need to check said value to determine intersection. Let said point, closest to the circle have coordinates derived from the equation. Then, all coordinates that satisfy intersect the circle. Squaring, we find After multiplying through by and rearranging, we find . We see this is a quadratic in and consider taking the determinant, which tells us that solutions are real when, after factoring: We plot this inequality on the number line to find it is satisfied for all values except: . We then eliminate 0 because it is extraneous as both and are points which coincide. Therefore, there are a total of values.
See also
2010 AMC 12A (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 • 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.