Difference between revisions of "2001 AIME II Problems/Problem 12"
m |
(solution) |
||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
− | Given a triangle, its midpoint triangle is obtained by joining the midpoints of its sides. A sequence of polyhedra <math>P_{i}</math> is defined recursively as follows: <math>P_{0}</math> is a regular tetrahedron whose volume is 1. To obtain <math>P_{i + 1}</math>, replace the midpoint triangle of every face of <math>P_{i}</math> by an outward-pointing regular tetrahedron that has the midpoint triangle as a face. The volume of <math>P_{3}</math> is <math>\frac {m}{n}</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m + n</math>. | + | Given a [[triangle]], its [[midpoint]] triangle is obtained by joining the midpoints of its sides. A sequence of [[polyhedra]] <math>P_{i}</math> is defined recursively as follows: <math>P_{0}</math> is a regular [[tetrahedron]] whose volume is 1. To obtain <math>P_{i + 1}</math>, replace the midpoint triangle of every face of <math>P_{i}</math> by an outward-pointing regular tetrahedron that has the midpoint triangle as a face. The [[volume]] of <math>P_{3}</math> is <math>\frac {m}{n}</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m + n</math>. |
== Solution == | == Solution == | ||
− | {{ | + | On the first construction, <math>P_1</math>, four new tetrahedra will be constructed with side lengths <math>\frac 12</math> 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 <math>\left(\frac 12\right)^3 = \frac 18</math>. The total volume added here is then <math>\Delta P_1 = 4 \cdot \frac 18 = \frac 12</math>. |
+ | |||
+ | We now note that for each midpoint triangle we construct in step <math>P_{i}</math>, there are now <math>6</math> places to construct new midpoint triangles for step <math>P_{i+1}</math>. The outward tetrahedron for the midpoint triangle provides <math>3</math> of the faces, while the three equilateral triangles surrounding the midpoint triangle provide the other <math>3</math>. However, the volume of the tetrahedra being constructed decrease by a factor of <math>\frac 18</math>. Thus we have the recursion <math>\Delta P_{i+1} = \frac{6}{8} \Delta P_i</math>, and so <math>\Delta P_i = \frac 12 \cdot \left(\frac{3}{4}\right)^{i-1} P_1</math>. | ||
+ | |||
+ | The volume of <math>P_3 = P_0 + \Delta P_1 + \Delta P_2 + \Delta P_3 = 1 + \frac 12 + \frac 38 + \frac 9{32} = \frac{69}{32}</math>, and <math>m+n=\boxed{101}</math>. Note that the summation was in fact a [[geometric series]]. | ||
== See also == | == See also == | ||
{{AIME box|year=2001|n=II|num-b=11|num-a=13}} | {{AIME box|year=2001|n=II|num-b=11|num-a=13}} | ||
+ | |||
+ | [[Category:Intermediate Geometry Problems]] |
Revision as of 09:14, 27 July 2008
Problem
Given a triangle, its midpoint triangle is obtained by joining the midpoints of its sides. A sequence of polyhedra is defined recursively as follows: is a regular tetrahedron whose volume is 1. To obtain , replace the midpoint triangle of every face of by an outward-pointing regular tetrahedron that has the midpoint triangle as a face. The volume of is , where and are relatively prime positive integers. Find .
Solution
On the first construction, , four new tetrahedra will be constructed with side lengths 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 . The total volume added here is then .
We now note that for each midpoint triangle we construct in step , there are now places to construct new midpoint triangles for step . The outward tetrahedron for the midpoint triangle provides of the faces, while the three equilateral triangles surrounding the midpoint triangle provide the other . However, the volume of the tetrahedra being constructed decrease by a factor of . Thus we have the recursion , and so .
The volume of , and . Note that the summation was in fact a geometric series.
See also
2001 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 11 |
Followed by Problem 13 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |