Euler's formula
In the Swiss mathematician Leonhard Euler noticed something astonishing: for every polyhedron with no holes, the numbers of faces, edges, and vertices are connected by a single equation:
It works on a cube, a pyramid, a soccer-ball-shaped polyhedron , anything you can imagine, as long as it has flat faces and no doughnut-style holes.
Concept
The formula. For any convex polyhedron:
Some examples.
| Solid | Check | |||
|---|---|---|---|---|
| Cube | ✓ | |||
| Tetrahedron | ✓ | |||
| Octahedron | ✓ | |||
| Square pyramid | ✓ | |||
| Dodecahedron | ✓ |
Why ? A proof is beyond class VIII, but the intuition is that you can flatten any polyhedron (project it onto a plane) and turn its faces, vertices, and edges into a planar graph. For any connected planar graph, (here counts the regions of the plane including the outer "infinite" region).
Using it. If you know two of , you can compute the third.
Example: a polyhedron has faces, vertices. How many edges?
- .
A constraint on Platonic solids. Suppose a regular polyhedron has -sided faces, meeting at each vertex. Counting edges two ways:
- Each face has edges, each edge shared by faces: .
- Each vertex has edges, each edge has endpoints: .
Plugging into Euler's formula yields constraints on that allow only finite solutions , exactly the five Platonic solids. This is why there are only five.
What about doughnut shapes? A torus (a doughnut) is not a polyhedron, but if you triangulate its surface, you find . For shapes with holes, . This generalisation is the start of topology.
Worked examples
Example 1. A polyhedron has faces and edges. Find .
- .
Example 2. Can a polyhedron have faces, vertices and edges?
- Check: . No, this is not a polyhedron.
Example 3. A prism with a -sided base. Find .
- (sides + two bases).
- (seven per base).
- ().
- Check: . ✓
Example 4. A pyramid with -sided base. Find .
- , , .
- . ✓ (Always holds.)
Try it yourself
- A polyhedron has . Find .
- A pentagonal prism: count and verify the formula.
- A hexagonal pyramid: count and verify.
- Can a polyhedron have ?
- Octahedron has triangular faces. Verify it has edges using .
- An icosahedron has triangular faces. How many vertices and edges?
- Why are there only Platonic solids? Explain in one sentence.
- A polyhedron has all square faces with meeting at each vertex. Identify it.
Activity
Build and verify. Make small polyhedra using straws and pipe cleaners (or sticks and modelling clay). Build a cube, a tetrahedron, and a square pyramid. Count for each by touching them. Note that the formula never fails , over years of mathematics could not find an exception.