Difference between revisions of "1983 AIME Problems/Problem 4"
(→Solution 2: Synthetic Solution) |
(→Solution 1) |
||
Line 43: | Line 43: | ||
Applying the Pythagorean Theorem, <math>OA^2 = OD^2 + AD^2</math> and <math>OC^2 = EC^2 + EO^2</math>. | Applying the Pythagorean Theorem, <math>OA^2 = OD^2 + AD^2</math> and <math>OC^2 = EC^2 + EO^2</math>. | ||
− | Thus, <math>(\sqrt{50})^2 = y^2 + (6-x)^2</math>, and <math>(\sqrt{50})^2 = x^2 + (y+2)^2</math>. We solve this system to get <math>x = 1</math> and <math>y = 5</math>, resulting in | + | Thus, <math>(\sqrt{50})^2 = y^2 + (6-x)^2</math>, and <math>(\sqrt{50})^2 = x^2 + (y+2)^2</math>. We solve this system to get <math>x = 1</math> and <math>y = 5</math>, resulting in <math>1^2 + 5^2 = 026</math>. Our final answer is <math>26^2 = \boxed{676}</math> |
+ | |||
=== Solution 2: Synthetic Solution === | === Solution 2: Synthetic Solution === | ||
Drop perpendiculars from <math>O</math> to <math>AB</math> (<math>T_1</math>), <math>M</math> to <math>OT_1</math> (<math>T_2</math>), and <math>M</math> to <math>AB</math> (<math>T_3</math>). | Drop perpendiculars from <math>O</math> to <math>AB</math> (<math>T_1</math>), <math>M</math> to <math>OT_1</math> (<math>T_2</math>), and <math>M</math> to <math>AB</math> (<math>T_3</math>). |
Revision as of 00:18, 25 February 2011
Problem
A machine shop cutting tool is in the shape of a notched circle, as shown. The radius of the circle is cm, the length of
is 6 cm, and that of
is 2 cm. The angle
is a right angle. Find the square of the distance (in centimeters) from
to the center of the circle.
![[asy] size(150); defaultpen(linewidth(0.6)+fontsize(11)); real r=10; pair O=(0,0),A=r*dir(45),B=(A.x,A.y-r),C; path P=circle(O,r); C=intersectionpoint(B--(B.x+r,B.y),P); draw(P); draw(C--B--O--A--B); dot(O); dot(A); dot(B); dot(C); label("$O$",O,SW); label("$A$",A,NE); label("$B$",B,S); label("$C$",C,SE); [/asy]](http://latex.artofproblemsolving.com/1/7/6/176e7aff44ffcb4a35dde174c0fde108ce69cbe7.png)
Solution
Solution 1
Because we are given a right angle, we look for ways to apply the Pythagorean Theorem. Let the foot of the perpendicular from to
be
and let the foot of the perpendicular from
to the line
be
. Let
and
. We're trying to find
.
![[asy] size(150); defaultpen(linewidth(0.6)+fontsize(11)); real r=10; pair O=(0,0),A=r*dir(45),B=(A.x,A.y-r),C; pair D=(A.x,0),F=(0,B.y); path P=circle(O,r); C=intersectionpoint(B--(B.x+r,B.y),P); draw(P); draw(C--B--O--A--B); draw(D--O--F--B,dashed); dot(O); dot(A); dot(B); dot(C); label("$O$",O,SW); label("$A$",A,NE); label("$B$",B,S); label("$C$",C,SE); label("$D$",D,NE); label("$E$",F,SW); [/asy]](http://latex.artofproblemsolving.com/0/0/5/005734c82fcbb09bb1717995c009ee75839e265e.png)
Applying the Pythagorean Theorem, and
.
Thus, , and
. We solve this system to get
and
, resulting in
. Our final answer is
Solution 2: Synthetic Solution
Drop perpendiculars from to
(
),
to
(
), and
to
(
).
Also, draw the midpoint
of
.
Then the problem is trivialized. Why?
![[asy] size(200); pair dl(string name, pair loc, pair offset) { dot(loc); label(name,loc,offset); return loc; }; pair a[] = {(0,0),(0,5),(1,5),(1,7),(-2,6),(-5,5),(-2,5),(-2,6),(0,6)}; string n[] = {"O","$T_1$","B","C","M","A","$T_3$","M","$T_2$"}; for(int i=0;i<a.length;++i) { dl(n[i],a[i],dir(degrees(a[i],false) ) ); draw(a[(i-1)%a.length]--a[i]); }; dot(a); draw(a[5]--a[1]); draw(a[0]--a[3]); draw(a[0]--a[4]); draw(a[0]--a[2]); draw(a[0]--a[5]); draw(a[5]--a[2]--a[3]--cycle,blue+linewidth(0.7)); draw(a[0]--a[8]--a[7]--cycle,blue+linewidth(0.7)); [/asy]](http://latex.artofproblemsolving.com/e/c/8/ec8178dd6f1c58944b30643b6498df4a33724323.png)
First notice that by computation, is a
isosceles triangle; thus
.
Then, notice that
. Thus the two blue triangles are congruent.
So, . As
, we subtract and get
. Then the Pythagorean Theorem shows
.
We square this to get our final answer of
.
See also
1983 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 3 |
Followed by Problem 5 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |