Difference between revisions of "1993 AIME Problems/Problem 14"
m |
(→Solution: added the solution) |
||
Line 3: | Line 3: | ||
== Solution == | == Solution == | ||
− | {{ | + | Answer: 448. |
+ | |||
+ | Solution: Put the rectangle on the coordinate plane so its vertices are at <math>(\pm4,\pm3)</math>, for all four combinations of positive and negative. Then by symmetry, the other rectangle is also centered at the origin, <math>O</math>. | ||
+ | |||
+ | Note that such a rectangle is unstuck iff its four vertices are in or on the edge of all four quadrants, and it is not the same rectangle as the big one. Let the four vertices of this rectangle be <math>A(4,y)</math>, <math>B(-x,3)</math>, <math>C(-4,-y)</math> and <math>D(x,-3)</math> for nonnegative <math>x,y</math>. Then this is a rectangle, so <math>OA=OB</math>, or <math>16+y^2=9+x^2</math>, so <math>x^2=y^2+7</math>. | ||
+ | |||
+ | [[Image:1993 AIME 14 Diagram.png|center]] | ||
+ | |||
+ | Reflect <math>D</math> across the side of the rectangle containing <math>C</math> to <math>D'(-8-x,-3)</math>. Then <math>BD'=\sqrt{(-8-x-(-x))^2+(3-(-3))^2}=10</math> is constant, and the perimeter of the rectangle is equal to <math>2(BC+CD')</math>. The midpoint of <math>\overline{BD'}</math> is <math>(-4-x,0)</math>, and since <math>-4>-4-x</math> and <math>-y\le0</math>, <math>C</math> always lies below <math>\overline{BD'}</math>. | ||
+ | |||
+ | If <math>y</math> is positive, it can be decreased to <math>y'<y</math>. This causes <math>x</math> to decrease as well, to <math>x'</math>, where <math>x'^2=y'^2+7</math> and <math>x'</math> is still positive. If <math>B</math> and <math>D'</math> are held in place as everything else moves, then <math>C</math> moves <math>(y-y')</math> units up and <math>(x-x')</math> units left to <math>C'</math>, which must lie within <math>\triangle BCD'</math>. Then we must have <math>BC'+C'D'<BC+CD'</math>, and the perimeter of the rectangle is decreased. Therefore, the minimum perimeter must occur with <math>y=0</math>, so <math>x=\sqrt7</math>. | ||
+ | |||
+ | By the distance formula, this minimum perimeter is <cmath>2\left(\sqrt{(4-\sqrt7)^2+3^2}+\sqrt{(4+\sqrt7)^2+3^2}\right)=4\left(\sqrt{8-2\sqrt7}+\sqrt{8+2\sqrt7}\right)</cmath> <cmath>=4(\sqrt7-1+\sqrt7+1)=8\sqrt7=\sqrt{448}.</cmath> | ||
== See also == | == See also == | ||
{{AIME box|year=1993|num-b=13|num-a=15}} | {{AIME box|year=1993|num-b=13|num-a=15}} |
Revision as of 01:07, 21 August 2008
Problem
A rectangle that is inscribed in a larger rectangle (with one vertex on each side) is called unstuck if it is possible to rotate (however slightly) the smaller rectangle about its center within the confines of the larger. Of all the rectangles that can be inscribed unstuck in a 6 by 8 rectangle, the smallest perimeter has the form , for a positive integer . Find .
Solution
Answer: 448.
Solution: Put the rectangle on the coordinate plane so its vertices are at , for all four combinations of positive and negative. Then by symmetry, the other rectangle is also centered at the origin, .
Note that such a rectangle is unstuck iff its four vertices are in or on the edge of all four quadrants, and it is not the same rectangle as the big one. Let the four vertices of this rectangle be , , and for nonnegative . Then this is a rectangle, so , or , so .
Reflect across the side of the rectangle containing to . Then is constant, and the perimeter of the rectangle is equal to . The midpoint of is , and since and , always lies below .
If is positive, it can be decreased to . This causes to decrease as well, to , where and is still positive. If and are held in place as everything else moves, then moves units up and units left to , which must lie within . Then we must have , and the perimeter of the rectangle is decreased. Therefore, the minimum perimeter must occur with , so .
By the distance formula, this minimum perimeter is
See also
1993 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 13 |
Followed by Problem 15 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |