Euler’s Number
Summary: §122 of Chapter 7. The base is at the analyst’s disposal; choose it so the constant in equals 1. Then the defining series collapses to
This is the first appearance of the symbol in mathematical history. The resulting logarithms are called natural or hyperbolic — see natural-logarithm.
Sources: chapter7 (§122)
Last updated: 2026-04-26
The defining choice
From §116, every base comes paired with a constant via
For , . For , is some other finite value. Euler observes (source: chapter7, §122) that we are free to choose the base, and the simplest analytical choice is the one that makes .
Substituting in the right side gives
Summing as decimal fractions:
| partial sum | ||
|---|---|---|
| 0 | 1.00000 | 1.00000 |
| 1 | 1.00000 | 2.00000 |
| 2 | 0.50000 | 2.50000 |
| 3 | 0.16667 | 2.66667 |
| 4 | 0.04167 | 2.70833 |
| 5 | 0.00833 | 2.71667 |
| 6 | 0.00139 | 2.71806 |
| … | … | … |
Euler reports the value to twenty-three digits:
(source: chapter7, §122). He denotes it — “for the sake of brevity for this number 2.718281828459… we will use the symbol , which will denote the base for natural or hyperbolic logarithms.”
Why “natural” or “hyperbolic”
Euler gives only a brief etymology: the logarithms with this base are called natural because the resulting series are simplest (the factor in §119 disappears, and for infinitely small — a property unique to base , see §123). They are also called hyperbolic “since the quadrature of a hyperbola can be expressed through these logarithms” — referring to the fact that the area under from to equals . The hyperbolic terminology is older; the natural-logarithm terminology survives in modern use.
Why ?
The series for is (§116). With this becomes the cleanest possible:
Every other base requires the constant to appear in every term, and inverse logarithm series similarly carry a in front. Picking is the analyst’s choice for simplicity, not a forced choice. Euler is explicit (§122) that any base could be used; is just the most convenient one.
Status as a constant
By the time Euler writes down the series , he has already established that:
- The series converges, since decays faster than any geometric.
- Its sum is a real number, computable to arbitrary decimal precision.
- It is not a rational power of any rational base — by §105 applied in reverse, would have to be transcendental for to be transcendental for “generic” . (Euler does not press this, but the argument is implicit.)
He does not prove is irrational in §122 — but in §381 Example III Euler discovers (by running the Euclidean algorithm on the decimal expansion of ) that has partial quotients in arithmetic progression. The infinite, unbounded simple [[continued-fraction-for-e|continued fraction for ]] proves irrationality immediately; Euler asserts the pattern “can be confirmed by infinitesimal calculus” and proved it rigorously in 1737 via the Riccati equation. He does not prove is transcendental either; that is Hermite (1873).
Connection to
§125 returns to the infinite-power form:
with infinitely large. Setting :
In modern notation — the standard limit definition. Euler’s definition and the limit definition are the binomial expansion of one another, related by the same collapse that produced the exponential series.
What changes once is on the table
The whole apparatus of Chapter 7 simplifies once the base is :
| Identity (general ) | Identity (base ) |
|---|---|
| () |
Every other base is recovered via the conversion factor — see change-of-base and §124.
Related pages
- exponential-series
- logarithmic-series
- natural-logarithm
- infinitesimal-and-infinite-numbers
- exponential-function
- logarithm
- change-of-base
- chapter-7-on-exponentials-and-logarithms-expressed-through-series
- continued-fraction-for-e — the §381 Example III simple-CF expansion with arithmetic-progression quotients
- chapter-18-on-continued-fractions