What Is an Easy-to-Understand Result of Euler?
At a glance
- 1. Count the parts
For a solid with no holes, count its corners, edges, and flat faces.
- 2. Use Euler’s rule
Subtract the number of edges from the number of corners, then add the number of faces.
- 3. Check the answer
For a cube, the calculation is 8 minus 12 plus 6, which equals 2.
- 4. Notice the limits
The rule applies to ordinary hole-free polyhedra, not every shape or surface.
One of the easiest famous results of Leonhard Euler to explore is a rule about the corners, edges, and faces of a solid. You can test it by counting the parts of a cube, then get a sense of why the same pattern appears in many other solids.
Euler’s rule for solid shapes
For a convex polyhedron—a solid made of flat polygonal faces, with no holes—let be its number of vertices (corners), its number of edges, and its number of faces. Euler’s formula is
The names are more formal than the idea: count the corners, subtract the edges, and add the faces. The answer is always 2 for this class of shapes.
A child can investigate the rule using a toy block, a box, or a solid made from craft sticks and paper. The faces are the flat panels, the edges are where two panels meet, and the vertices are where edges meet. Be consistent: count each edge once, even though it borders two faces.
Check it on a cube
A cube has 8 corners, 12 edges, and 6 faces. Substituting those counts gives
A triangular pyramid gives another test. It has 4 corners, 6 edges, and 4 triangular faces, so
Try a rectangular box as well. Its dimensions may differ from a cube’s, but it still has 8 corners, 12 edges, and 6 faces. The formula concerns how the parts connect, not how long the edges are or how large the faces are.
Why does the count stay at 2?
Here is a way to build intuition without starting from a complicated proof. Imagine drawing the edges and corners of a polyhedron on a flat sheet, as a map. The drawing divides the sheet into regions. Count the outside region too; it corresponds to one of the solid’s faces when the shape is viewed as a surface.
Now imagine simplifying the drawing by erasing edges that lie along loops. Each time you erase such an edge, two neighboring regions join into one. The number of edges goes down by 1, and the number of regions goes down by 1, so the quantity “corners minus edges plus regions” does not change.
Keep erasing until no loops remain. What is left is a tree: a connected drawing with no loops. A tree with corners has edges, and it divides the sheet into just one region (the outside). Its count is therefore
Because erasing the loop edges did not change the count, the original drawing also had a count of 2. This is the basic idea behind the formula. A full proof makes precise how a polyhedron’s surface can be represented by such a drawing.
Common mistakes and limits
- Mixing up vertices and faces: A cube has 8 vertices but only 6 faces. A vertex is a corner; a face is a flat panel.
- Counting the outside inconsistently: In the flat-map explanation, include the outside region. In the solid, count each physical face once.
- Assuming it works for every shape: A shape with a tunnel or hole can have a different count. For example, a torus-shaped surface has Euler characteristic 0, not 2.
- Applying it to curved surfaces as if they were polyhedra: The formula in this form is about vertices, edges, and faces of a polyhedral surface. A ball’s smooth boundary has no such finite face-and-edge count until you choose a mesh.
For a simple classroom activity, have a child predict the result before counting a few different boxes, pyramids, or other hole-free solids. The surprise is that the measurements change, but the combination of counts remains fixed.
References
- Euler’s Gem: The Polyhedron Formula and the Birth of Topology — David S. Richeson
Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.