Difference between revisions of "1993 AIME Problems/Problem 10"
m (wik) |
(→Problem) |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | [[Euler's formula]] states that for a [[convex polyhedron]] with <math>V | + | [[Euler's formula]] states that for a [[convex polyhedron]] with <math>V</math> [[vertex|vertices]], <math>E</math> [[edge]]s, and <math>F</math> [[face]]s, <math>V-E+F=2</math>. A particular convex polyhedron has 32 faces, each of which is either a [[triangle]] or a [[pentagon]]. At each of its <math>V</math> vertices, <math>T</math> triangular faces and <math>P</math> pentagonal faces meet. What is the value of <math>100P+10T+V</math>? |
== Solution == | == Solution == | ||
Revision as of 15:00, 26 March 2009
Problem
Euler's formula states that for a convex polyhedron with 
vertices, 
edges, and 
faces, 
. A particular convex polyhedron has 32 faces, each of which is either a triangle or a pentagon. At each of its vertices, 
triangular faces and 
pentagonal faces meet. What is the value of 
?
Solution
The convex polyhedron of the problem can be easily visualized; it corresponds to a dodecahedron (a regular solid with 
equilateral pentagons) in which the 
vertices have all been truncated to form equilateral triangles with common vertices. The resulting solid has then 
smaller equilateral pentagons and 
equilateral triangles yielding a total of 
faces. In each vertex, 
triangles and 
pentagons are concurrent. Now, the number of edges 
can be obtained if we count the number of sides that each triangle and pentagon contributes: 
, (the factor 
in the denominator is because we are counting twice each edge, since two adjacent faces share one edge). Thus, 
. Finally, using Euler's formula we have 
.
In summary, the solution to the problem is 
.
See also
| 1993 AIME (Problems • Answer Key • Resources) | ||
| Preceded by Problem 9 |
Followed by Problem 11 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
