This problem is about investigating whether it is possible to start at one vertex of a platonic solid and visit every other vertex once only returning to the vertex you started at.
A toy has a regular tetrahedron, a cube and a base with triangular
and square hollows. If you fit a shape into the correct hollow a
bell rings. How many times does the bell ring in a complete game?
Each of these solids is made up with 3 squares and a triangle around each vertex. Each has a total of 18 square faces and 8 faces that are equilateral triangles. How many faces, edges and vertices does each solid have?
Here you see the front and back views of a dodecahedron. Each
vertex has been numbered so that the numbers around each pentagonal
face add up to 65. Can you find all the missing numbers?
Investigate the number of paths you can take from one vertex to
another in these 3D shapes. Is it possible to take an odd number
and an even number of paths to the same vertex?
Can you number the vertices, edges and faces of a tetrahedron so
that the number on each edge is the mean of the numbers on the
adjacent vertices and the mean of the numbers on the adjacent
faces?