Euler's Polyhedron Formula
For every convex polyhedron, vertices minus edges plus faces equals two.
Specifications & Metrics
proved
Euler 1758; rigorously by Cauchy 1813
Core Principles & Analysis
Descartes had the equivalent result in 1630, unpublished.
It is the seed of topology: the count survives any deformation, only connectivity matters.
On a doughnut surface the count comes to zero — the genus changes the arithmetic.
Related
Leonhard Euler
Topology
Geometry
More Theorems
Pythagorean Theorem
Infinitude of Primes
Fundamental Theorem of Calculus
Fundamental Theorem of Algebra
Bayes' Theorem
Prime Number Theorem
Central Limit Theorem
Gödel's Incompleteness Theorems
Fermat's Last Theorem
Four Color Theorem
Cantor's Diagonal Argument
Directory
Theorems Registry
Mathematics Hub
Teahann Knowledge Base
Human
Pharmacology
Chemistry
Physics
Astronomy
Botany
Geography
Mesopotamia
Ancient Egypt
Classical Greece
Ancient Rome
Norse & Germanic
Vedic & Classical India
Ancient & Imperial China
Mesoamerica & Andes
Cybersecurity
Network Ports
Web APIs
Computing
Mathematics
Architecture
Philosophy
Psychology
Mythology
Harry Potter
Economics
History
Linguistics
Music
Sources & Licences