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?
Pick one
Solution
Note Euler's formula where . There are faces and the number of edges is because there are 12 faces each with four edges and each edge is shared by two faces. Now we know that there are vertices on the figure. Now note that the sum of the degrees of all the points is twice the number of edges. Let the amount of vertices with edges. Now we know . Solving this system of equations gives so the answer is .
~aiden22gao ~zgahzlkw (LaTeX) ~ESAOPS (Simplified)
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.