Maths Olympiad Prep

Library / HMMT February /497 of 1302

HMMT February

Geometry Difficulty 5.2 AIME, harder Find the answer

A convex polyhedron has nn faces that are all congruent triangles with angles 36∘,72∘36^{\circ}, 72^{\circ}, and 72∘72^{\circ}. Determine, with proof, the maximum possible value of nn.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Answer: 36 Solution: Consider such a polyhedron with VV vertices, EE edges, and F=nF=n faces. By Euler's formula we have V+F=E+2V+F=E+2. Next, note that the number of pairs of incident faces and edges is both 2E2E and 3F3F, so 2E=3F2E=3F. Now, since our polyhedron is convex, the sum of the degree measures at each vertex is strictly less than 360=36⋅10360=36 \cdot 10. As all angle measures of the faces of our polyhedron are divisible by 36, the maximum degree measure at a given vertex is 36⋅9=32436 \cdot 9=324. On the other hand, the total degree measure at all vertices is the total degree measure over all faces, which is 180F180F. Thus we have 180F≤324V180F \leq 324V, or 10F≤18V10F \leq 18V. Putting our three conditions together, we have 10F≤18V=18(E+2−F)=9(2E)+36−18F=9(3F)+36−18F=9F+36 10F \leq 18V=18(E+2-F)=9(2E)+36-18F=9(3F)+36-18F=9F+36 Thus F≤36F \leq 36. F=36F=36 is attainable by taking a 9-gon antiprism with a 9-gon pyramid attached on the top and the bottom. Thus the answer is 36.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: Omni-MATH, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.