2008 AIME I Problems/Problem 15
A square piece of paper has sides of length . 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 upper edges, can be written in the form , where and are positive integers, , and is not divisible by the th power of any prime. Find .
Picture for Solutions
(Used for the following solutions)
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.
The length of the perpendicular from to in is , and the length of the perpendicular from to in is . Adding those two lengths, . (Alternatively, we could have used that .)
Drop a perpendicular from to the side of the square containing and let the intersection be .
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 .
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 .
It follows that the answer is .
|2008 AIME I (Problems • Answer Key • Resources)|
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15|
|All AIME Problems and Solutions|