Difference between revisions of "2008 AIME I Problems/Problem 15"
I like pie (talk | contribs) m (→Solution 1) |
I like pie (talk | contribs) m (→Solution 1) |
||
Line 47: | Line 47: | ||
<center><asy>import three; import math; | <center><asy>import three; import math; | ||
− | size( | + | size(300); |
pathpen=black; | pathpen=black; | ||
real r = (51^0.5-17^0.5)/200, h=867^0.25/100; | real r = (51^0.5-17^0.5)/200, h=867^0.25/100; |
Revision as of 01:10, 24 March 2008
Problem
A square piece of paper has sides of length 100. From each corner a wedge is cut in the following manner: at each corner, the two cuts for the wedge each start at a distance from the corner, and they meet on the diagonal at an angle of
(see the figure below). The paper is then folded up along the lines joining the vertices of adjacent cuts. When the two edges of a cut meet, they are taped together. The result is a paper tray whose sides are not at right angles to the base. The height of the tray, that is, the perpendicular distance between the plane of the base and the plane formed by the upped edges, can be written in the form
, where
and
are positive integers,
, and
is not divisible by the
th power of any prime. Find
.
![[asy]import cse5; size(200); pathpen=black; real s=sqrt(17); real r=(sqrt(51)+s)/(sqrt(2)); D((0,2*s)--(0,0)--(2*s,0)); D((0,s)--(r*dir(45))); D((s,0)--(r*dir(45))); D((0,0)--(r*dir(45))); D((r*dir(45))--((r*dir(45)).x,2*s)); D((r*dir(45))--(2*s,(r*dir(45)).y)); MP("30^\circ",r*dir(45)-(0.25,1),SW); MP("30^\circ",r*dir(45)-(1,0.5),SW); MP("\sqrt{17}",(0,s/2),W); MP("\sqrt{17}",(s/2,0),S);[/asy]](http://latex.artofproblemsolving.com/d/5/f/d5ff5767d7d98bbf56571ddd01736df94b3581b7.png)
Solution
import three; import math; size(500); pathpen=black; real r = (51^0.5-17^0.5)/200, h=867^0.25/100; triple A=(0,0,0),B=(1,0,0),C=(1,1,0),D=(0,1,0); triple F=B+(r,-r,h),G=(1,-r,h),H=(1+r,0,h),I=B+(0,0,h); D(B--F--H--cycle); D(B--F--G--cycle); D(G--I--H); D(B--I); D(A--B--C--D--cycle); triple Fa=A+(-r,-r, h), Fc=C+(r,r, h), Fd=D+(-r,r, h); triple Ia = A+(0,0,h), Ic = C+(0,0,h), Id = D+(0,0,h); D(Ia--I--Ic); D(Fa--F--Fc--Fd--cycle); D(A--Fa); D(C--Fc); D(D--Fd); (Error making remote request. Unknown error_msg)
Solution 1
In the original picture, let be the corner, and
and
be the two points whose distance is
from
. Also, let
be the point where the two cuts intersect.
Using (a 45-45-90 triangle),
.
is equilateral, so
. (Alternatively, we could find this by the Law of Sines.)
The length of the perpendicular from to
in
is
, and the length of the perpendicular from
to
in $\traignel{MNR}$ (Error compiling LaTeX. Unknown error_msg) is
. Adding those two lengths,
. (Alternatively, we could have used that
.)
Drop a perpendicular from to line
and let the intersection be
.
import three; import math; size(300); pathpen=black; real r = (51^0.5-17^0.5)/200, h=867^0.25/100; triple B=(1,0,0),F=B+(r,-r,h),G=(1,-r,h),H=(1+r,0,h),I=B+(0,0,h); D(B--F--H--cycle); D(B--F--G--cycle); D(G--I--H); D(B--I); MP("\sqrt{34}",(F+B)/2,N); MP("\frac{\sqrt{51}-\sqrt{17}}{2}",(I+G)/2,N); MP("\sqrt[4]{867}",(I+B)/2,E); D(rightanglemark(G,I,B,0.05)); D(rightanglemark(F,G,B,0.05)); D(rightanglemark(F,H,I,0.05)); (Error making remote request. Unknown error_msg)
Let be the smaller square base of the tray and let
be the larger square, such that
, etc, are edges. Let
be the foot of the perpendicular from
to plane
.
We know and
. Now, use the Pythagorean Theorem on triangle
to find
:
The answer is .
Solution 2
In the final pyramid, let be the smaller square and let
be the larger square such that
, etc are edges. It is obvious from the diagram that
. Let
and
be the positive
and
axes in a 3-d coordinate system such that
has a positive
coordinate. Let
be the angle made with the positive
axis. Define
and
analogously. It is easy to see that if
, then
. Furthermore, this means that
We have that
, so
It is easy to see from the law of sines that
Now
It follows that the answer is
.
See also
2008 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 14 |
Followed by Last Question | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |