AoPSWiki
Looking for a challenging geometry text? Preparing for MATHCOUNTS or the AMC exams? Check out Art of Problem Solving's Introduction to Geometry by Richard Rusczyk.
Personal tools

2001 AIME II Problems/Problem 12

From AoPSWiki

Problem

Given a triangle, its midpoint triangle is obtained by joining the midpoints of its sides. A sequence of polyhedra P_{i} is defined recursively as follows: P_{0} is a regular tetrahedron whose volume is 1. To obtain P_{i + 1}, replace the midpoint triangle of every face of P_{i} by an outward-pointing regular tetrahedron that has the midpoint triangle as a face. The volume of P_{3} is \frac {m}{n}, where m and n are relatively prime positive integers. Find m + n.

Solution

On the first construction, P_1, four new tetrahedra will be constructed with side lengths \frac 12 of the original one. Since the ratio of the volume of similar polygons is the cube of the ratio of their corresponding lengths, it follows that each of these new tetrahedra will have volume \left(\frac 12\right)^3 = \frac 18. The total volume added here is then \Delta P_1 = 4 \cdot \frac 18 = \frac 12.

We now note that for each midpoint triangle we construct in step P_{i}, there are now 6 places to construct new midpoint triangles for step P_{i+1}. The outward tetrahedron for the midpoint triangle provides 3 of the faces, while the three equilateral triangles surrounding the midpoint triangle provide the other 3. However, the volume of the tetrahedra being constructed decrease by a factor of \frac 18. Thus we have the recursion \Delta P_{i+1} = \frac{6}{8} \Delta P_i, and so \Delta P_i = \frac 12 \cdot \left(\frac{3}{4}\right)^{i-1} P_1.

The volume of P_3 = P_0 + \Delta P_1 + \Delta P_2 + \Delta P_3 = 1 + \frac 12 + \frac 38 + \frac 9{32} = \frac{69}{32}, and m+n=\boxed{101}. Note that the summation was in fact a geometric series.

See also

2001 AIME II (ProblemsResources)
Preceded by
Problem 11
Followed by
Problem 13
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Add a glimpse of the Art of Problem Solving Forum to your own site!
Click here for details!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us