A remarkable relationship between vertices, edges, and faces — true for every convex polyhedron, regardless of shape.
The Mnemonic
One Equation Links All Three Counts
For any convex polyhedron (a 3D solid with flat polygon faces and no dents or holes), Euler's Formula states: V − E + F = 2, where V is the number of vertices (corner points), E is the number of edges, and F is the number of faces.
This holds true for every convex polyhedron that exists — cubes, prisms, pyramids of any base, and much more exotic shapes — always resulting in exactly 2, never any other number.
A cube (rectangular prism): 8 vertices, 12 edges, 6 faces — plugging in confirms V − E + F = 2
💡 Memory Trick
"A remarkable relationship between vertices, edges, and faces." V − E + F = 2 — vertices minus edges plus faces always equals 2. A useful check: verify this equation on a familiar solid (like a cube: 8 − 12 + 6 = 2) any time you're unsure you've remembered the formula correctly.
Why It Works
Why the Answer Is Always Exactly 2
One intuitive way to see this: start with a single vertex (V=1, E=0, F=0, giving V−E+F = 1). Each time you add a new edge connecting to an existing vertex without closing a loop, V increases by 1 and E increases by 1 — these cancel out, so V−E+F stays at 1. Only when you finally close off a face does F increase by 1 without changing V or E, bumping the total from 1 to 2 — and it stays at 2 from then on as you continue building out the rest of the solid, since every subsequent piece you add keeps the same kind of balanced trade-off.
This is a genuinely deep topological fact (related to the fact that the solid's surface is equivalent to a sphere, with no holes) rather than an arbitrary coincidence — Euler's Formula fails for shapes WITH holes (like a torus/donut shape), which is exactly why the "convex, no holes" condition matters.
Using It In A Proof
Solving for Any Missing Value
Euler's Formula is most often used to find one missing count (V, E, or F) when the other two are already known — this connects directly to the face/edge/vertex counting patterns from Prisms and Pyramids.
1
Identify which two values are given
A problem typically gives (or lets you count) two of the three values, and asks for the third.
2
Rearrange the formula for the missing value
V = 2 − F + E. E = V + F − 2. F = 2 − V + E — pick whichever rearrangement isolates the unknown.
3
Substitute and solve
Plug in the two known values and solve for the third.
Full Worked Example
Finding the Number of Edges of a Solid
Given: A convex polyhedron has 10 vertices and 7 faces. Find: its number of edges.
1
Start from Euler's Formula
V − E + F = 2.
2
Substitute known values
10 − E + 7 = 2.
3
Solve for E
17 − E = 2, so E = 15.
4
Sanity-check against a real solid
This matches a pentagonal prism: n=5 gives V=2n=10, F=n+2=7, and E=3n=15. ✓ All three values line up with a real, buildable solid.
Cross-checking against the Prisms and Pyramids counting formulas is a great way to confirm an Euler's Formula answer actually corresponds to a real shape.
🎯 Quick Worked Example
A convex polyhedron has 6 faces and 12 edges. Find its number of vertices.
1
Start from the formula. V − E + F = 2.
2
Substitute. V − 12 + 6 = 2.
3
Solve. V − 6 = 2, so V = 8. (This matches a cube, as shown in the diagram above.)
📌 Exam Application
Euler's Formula problems are a favorite way to test whether a described solid could actually exist — if a problem gives you three specific values for V, E, and F, quickly check whether V−E+F actually equals 2; if it doesn't, that combination of counts describes an impossible (or non-convex) shape.
⚠️ Most Common Euler's Formula Mistakes
Trap 1 — Mixing up addition and subtraction in the formula: It's V minus E plus F, not some other combination — writing V+E+F=2 or V−E−F=2 gives a completely different (and wrong) equation.
Trap 2 — Applying the formula to a non-convex solid or one with a hole: Euler's Formula specifically requires a convex polyhedron with no holes — shapes with holes (like a torus) genuinely don't satisfy V−E+F=2, so the formula isn't universal to every 3D shape, only this specific well-behaved category.
✓ Quick Self-Test
1) State Euler's Formula. 2) Verify Euler's Formula on a square pyramid (5 vertices, 8 edges, 5 faces). 3) A polyhedron has 12 vertices and 30 edges — find its number of faces. 4) Why does Euler's Formula require the solid to be convex with no holes? 5) A polyhedron has 6 vertices, 10 edges, and 5 faces — does this describe a valid convex polyhedron? Why or why not?