Difference between revisions of "1985 AIME Problems/Problem 11"
(→Solution 2 (Calculus)) |
m (→Solution 1) |
||
Line 3: | Line 3: | ||
== Solution 1== | == Solution 1== | ||
− | An ellipse is defined to be the [[locus]] of points <math>P</math> such that the sum of the distances between <math>P</math> and the two foci is constant. Let <math>F_1 = (9, 20)</math>, <math>F_2 = (49, 55)</math> and <math>X = (x, 0)</math> be the point of tangency of the ellipse with the <math>x</math>-axis. Then <math>X</math> must be the point on the axis such that the sum <math>F_1X + F_2X</math> is minimal. (The last claim begs justification: Let <math>F'_2</math> be the reflection of <math>F_2</math> across the <math> | + | An ellipse is defined to be the [[locus]] of points <math>P</math> such that the sum of the distances between <math>P</math> and the two foci is constant. Let <math>F_1 = (9, 20)</math>, <math>F_2 = (49, 55)</math> and <math>X = (x, 0)</math> be the point of tangency of the ellipse with the <math>x</math>-axis. Then <math>X</math> must be the point on the axis such that the sum <math>F_1X + F_2X</math> is minimal. (The last claim begs justification: Let <math>F'_2</math> be the reflection of <math>F_2</math> across the <math>x</math>-axis. Let <math>Y</math> be where the line through <math>F_1</math> and <math>F’_2</math> intersects the ellipse. We will show that <math>X=Y</math>. Note that <math>X F_2 = X F’_2</math> since <math>X</math> is on the <math>x</math>-axis. Also, since the entire ellipse is on or above the <math>x</math>-axis and the line through <math>F_2</math> and <math>F’_2</math> is perpendicular to the <math>x</math>-axis, we must have <math>F_2 Y \leq F’_2 Y</math> with equality if and only if <math>Y</math> is on the <math>x</math>-axis. Now, we have |
<cmath>F_1 X + F'_2 X = F_1 X + F_2 X = F_1 Y + F_2 Y \leq F_1 Y + F’_2 Y</cmath> | <cmath>F_1 X + F'_2 X = F_1 X + F_2 X = F_1 Y + F_2 Y \leq F_1 Y + F’_2 Y</cmath> | ||
But the right most sum is the straight-line distance from <math> F_1</math> to <math>F’_2</math> and the left is the distance of some path from <math> F_1</math> to <math>F_2</math>., so this is only possible if we have equality and thus <math>X = Y</math>). Finding the optimal location for <math>X</math> is a classic problem: for any path from <math>F_1</math> to <math>X</math> and then back to <math>F_2</math>, we can reflect (as above) the second leg of this path (from <math>X</math> to <math>F_2</math>) across the <math>x</math>-axis. Then our path connects <math>F_1</math> to the reflection <math>F_2'</math> of <math>F_2</math> via some point on the <math>x</math>-axis, and this path will have shortest length exactly when our original path has shortest length. This occurs exactly when we have a straight-line path, and by the above argument, this path passes through the point of tangency of the ellipse with the <math>x-</math>axis. | But the right most sum is the straight-line distance from <math> F_1</math> to <math>F’_2</math> and the left is the distance of some path from <math> F_1</math> to <math>F_2</math>., so this is only possible if we have equality and thus <math>X = Y</math>). Finding the optimal location for <math>X</math> is a classic problem: for any path from <math>F_1</math> to <math>X</math> and then back to <math>F_2</math>, we can reflect (as above) the second leg of this path (from <math>X</math> to <math>F_2</math>) across the <math>x</math>-axis. Then our path connects <math>F_1</math> to the reflection <math>F_2'</math> of <math>F_2</math> via some point on the <math>x</math>-axis, and this path will have shortest length exactly when our original path has shortest length. This occurs exactly when we have a straight-line path, and by the above argument, this path passes through the point of tangency of the ellipse with the <math>x-</math>axis. |
Revision as of 16:00, 1 September 2020
Contents
[hide]Problem
An ellipse has foci at and in the -plane and is tangent to the -axis. What is the length of its major axis?
Solution 1
An ellipse is defined to be the locus of points such that the sum of the distances between and the two foci is constant. Let , and be the point of tangency of the ellipse with the -axis. Then must be the point on the axis such that the sum is minimal. (The last claim begs justification: Let be the reflection of across the -axis. Let be where the line through and intersects the ellipse. We will show that . Note that since is on the -axis. Also, since the entire ellipse is on or above the -axis and the line through and is perpendicular to the -axis, we must have with equality if and only if is on the -axis. Now, we have But the right most sum is the straight-line distance from to and the left is the distance of some path from to ., so this is only possible if we have equality and thus ). Finding the optimal location for is a classic problem: for any path from to and then back to , we can reflect (as above) the second leg of this path (from to ) across the -axis. Then our path connects to the reflection of via some point on the -axis, and this path will have shortest length exactly when our original path has shortest length. This occurs exactly when we have a straight-line path, and by the above argument, this path passes through the point of tangency of the ellipse with the axis.
The sum of the two distances and is therefore equal to the length of the segment , which by the distance formula is just .
Finally, let and be the two endpoints of the major axis of the ellipse. Then by symmetry so (because is on the ellipse), so the answer is .
Solution 2 (Calculus)
An ellipse is defined as the set of points where the sum of the distances from the foci to the point is fixed. The length of major axis is equal to the sum of these distances . Thus if we find the sum of the distances, we get the answer. Let k be this fixed sum; then we get, by the distance formula:
This is the equation of the ellipse expressed in terms of . The line tangent to the ellipse at the given point will thus have slope . Taking the derivative gives us the slope of this line. To simplify, let and . Then we get:
Next, we multiply by the conjugate to remove square roots. We next move the resulting form expression into form .
We know and . Simplifying yields:
To further simplify, let and . This means . Solving yields that . Substituting back and yields:
.
Solving for yields . Substituting back into our original distance formula, solving for yields .
See also
1985 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 10 |
Followed by Problem 12 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |