07-26-2026, 11:48 PM
William Dunham, A tribute to Euler
Sumary
In this lecture hosted by the Clay Mathematics Institute, mathematician William Dunham presents a tribute to Leonhard Euler by exploring his life, surveying his major contributions, and detailing one of his famous proofs. Dunham outlines Euler’s biography—from his mentorship under Johann Bernoulli and graduation at age 15 to his prolific productivity at the Saint Petersburg and Berlin academies, where he continued spouting papers even after becoming completely blind.
The talk highlights renowned Eulerian achievements, including defining the base of the natural logarithm $e$, deriving Euler's identity ($e^{i\pi} + 1 = 0$), solving the Basel problem, establishing the polyhedral formula ($V + F = E + 2$), founding graph theory via the Königsberg bridge problem, and massively expanding the collection of known amicable numbers.
To showcase Euler's clarity and genius, Dunham walks through his 1740 generating-function proof demonstrating that the number of ways to partition any integer into distinct summands equals the number of ways to partition it into odd summands, concluding with audience questions on Euler's calculus texts, transparent thought process, and popular science writings.
LECTURE
Sumary
In this lecture hosted by the Clay Mathematics Institute, mathematician William Dunham presents a tribute to Leonhard Euler by exploring his life, surveying his major contributions, and detailing one of his famous proofs. Dunham outlines Euler’s biography—from his mentorship under Johann Bernoulli and graduation at age 15 to his prolific productivity at the Saint Petersburg and Berlin academies, where he continued spouting papers even after becoming completely blind.
The talk highlights renowned Eulerian achievements, including defining the base of the natural logarithm $e$, deriving Euler's identity ($e^{i\pi} + 1 = 0$), solving the Basel problem, establishing the polyhedral formula ($V + F = E + 2$), founding graph theory via the Königsberg bridge problem, and massively expanding the collection of known amicable numbers.
To showcase Euler's clarity and genius, Dunham walks through his 1740 generating-function proof demonstrating that the number of ways to partition any integer into distinct summands equals the number of ways to partition it into odd summands, concluding with audience questions on Euler's calculus texts, transparent thought process, and popular science writings.
LECTURE
┌────────────────────────────────┐
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘