2023 AMC 10A Problem 18
A rhombic dodecahedron is a solid with congruent rhombus faces. At every vertex, or edges meet, depending on the vertex. How many vertices have exactly edges meet?
Show solution without answering
Key insight
Count edges from the faces (12 times 4, halved), then vertices from Euler's formula. Counting edge ends two ways gives the split into 3-edge and 4-edge vertices.
Solution
We cannot easily picture this solid, so count instead.
1. Edges. There are faces with edges each, which is . But every edge is shared by exactly faces, so each edge was counted twice:
2. Vertices. Euler's formula says that for a solid like this, vertices minus edges plus faces equals : . (Check on a cube: .) Here
3. Split the vertices. Say vertices have edges and vertices have edges. Then .
4. Count edge ends. Every edge has ends, so there are edge ends in total. Each -edge vertex holds ends and each -edge vertex holds :
5. Solve. If all vertices had edges, that would be ends. We need more, and each -edge vertex adds extra, so . Then .
The answer is .
Why this works
For solids you cannot picture, three counts do all the work: faces times sides, divided by , gives edges; Euler's formula gives vertices; and counting edge ends gives a second equation. The same plan works for a soccer ball or any other solid with mixed kinds of corners.
Alternative approach
Count corners of the rhombi instead. Each rhombus has sharp (acute) and wide (obtuse) angles, so there are sharp and wide angles in total. In this solid, a -edge vertex is surrounded by sharp angles and a -edge vertex by wide angles (four wide angles would add up to more than , which cannot happen at a corner of a solid). So gives .
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Count edges first. Each of the rhombi has edges, and every edge belongs to exactly faces, so
Euler's formula for a convex polyhedron, , gives .
Let vertices have edges and vertices have edges. Then , and since every edge has two endpoints, the degrees sum to :
Subtracting gives , so .
The answer is .
Review in the AoPS books
- Introduction to Geometry, Chapter 14: Three-Dimensional Geometry
- Introduction to Algebra, Chapter 5: Multi-Variable Linear Equations (§5.2, §5.3, §5.6)
- Introduction to Algebra, Chapter 11: Special Factorizations
- Introduction to Geometry, Chapter 15: Curved Surfaces
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.