Proof that e is irrational

The number was introduced by Jacob Bernoulli in 1683.

Uses your system voice; voice and rate in settings.

≈ 5 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

The number was introduced by Jacob Bernoulli in 1683. More than half a century later, Euler, who had been a student of Jacob's younger brother Johann, proved that is irrational; that is, that it cannot be expressed as the quotient of two integers.

Euler's proof

Euler wrote the first proof of the fact that is irrational in 1737 (but the text was only published seven years later). He computed the representation of as a simple continued fraction, which is e = [2; 1, 2, 1, 1, 4, 1, 1, 6, 1, 1, 8, 1, 1, \ldots, 2n, 1, 1, \ldots]. Since this continued fraction is infinite and every rational number has a terminating continued fraction, is irrational.

A short proof of the previous equality is known. Since the simple continued fraction of is not periodic, this also proves that is not a root of a quadratic polynomial with rational coefficients; in particular, is irrational.

Fourier's proof

The most well-known proof is Joseph Fourier's proof by contradiction, which is based upon the equality e = \sum_{n = 0}^\infty \frac{1}{n!}. Initially is assumed to be a rational number of the form . The idea is to then analyze the scaled-up difference (here denoted ) between the series representation of and its strictly smaller partial sum, which approximates the limiting value .

By choosing the scale factor to be the factorial of  , the fraction and the partial sum are turned into integers, hence must be a positive integer. However, the fast convergence of the series representation implies that is still strictly smaller than 1. From this contradiction we deduce that is irrational.

The detailed proof goes as follows: If is a rational number, there exist positive integers and such that . Define the number x = b!\left(e - \sum_{n = 0}^{b} \frac{1}{n!}\right). Use the assumption that to obtain x = b!\left (\frac{a}{b} - \sum_{n = 0}^{b} \frac{1}{n!}\right) = a(b - 1)! - \sum_{n = 0}^{b} \frac{b!}{n!}.

The first term is an integer, and every fraction in the sum is actually an integer because for each term. Therefore, under the assumption that is rational, is an integer. We now prove that .

First, to prove that is strictly positive, we insert the above series representation of into the definition of and obtain x = b!\left(\sum_{n = 0}^{\infty} \frac{1}{n!} - \sum_{n = 0}^{b} \frac{1}{n!}\right) = \sum_{n = b+1}^{\infty} \frac{b!}{n!}>0, because all the terms are strictly positive. We now prove that .

For all terms with we have the upper estimate \frac{b!}{n!} =\frac1{(b + 1)(b + 2) \cdots \big(b + (n - b)\big)} \le \frac1{(b + 1)^{n-b}}. This inequality is strict for every .

Changing the index of summation to and using the formula for the infinite geometric series, we obtain x =\sum_{n = b + 1}^\infty \frac{b!}{n!} And therefore x Since there is no integer strictly between 0 and 1, we have reached a contradiction, and so is irrational, Q.E.D.

Alternative proofs

Another proof can be obtained from the previous one by noting that (b + 1)x = 1 + \frac1{b + 2} + \frac1{(b + 2)(b + 3)} + \cdots and this inequality is equivalent to the assertion that . This is impossible, of course, since and are positive integers. Still another proof can be obtained from the fact that \frac{1}{e} = e^{-1} = \sum_{n=0}^\infty \frac{(-1)^n}{n!}.

Define s_n as follows: s_n = \sum_{k=0}^n \frac{(-1)^{k}}{k!}. Then e^{-1} - s_{2n-1} = \sum_{k=0}^\infty \frac{(-1)^{k}}{k!} - \sum_{k=0}^{2n-1} \frac{(-1)^{k}}{k!} which implies 0 for any positive integer n . Note that (2n - 1)!s_{2n-1} is always an integer. Assume that e^{-1} is rational, so e^{-1} = p/q, where p, q are co-prime, and q \neq 0.

It is possible to appropriately choose n so that (2n - 1)!e^{-1} is an integer, i.e. n \geq (q + 1)/2. Hence, for this choice, the difference between (2n - 1)!e^{-1} and (2n - 1)!s_{2n-1} would be an integer. But from the above inequality, that is not possible.

So, e^{-1} is irrational. This means that e is irrational.

Generalizations

In 1840, Liouville published a proof of the fact that is irrational followed by a proof that is not a root of a second-degree polynomial with rational coefficients. This last fact implies that is irrational. His proofs are similar to Fourier's proof of the irrationality of .

In 1891, Hurwitz explained how it is possible to prove along the same line of ideas that is not a root of a third-degree polynomial with rational coefficients, which implies that is irrational. More generally, is irrational for any non-zero rational .

Charles Hermite further proved that is a transcendental number, in 1873, which means that is not a root of any polynomial with rational coefficients, as is for any non-zero algebraic .

See also

Characterizations of the exponential function Transcendental number, including a proof that is transcendental Lindemann–Weierstrass theorem Proof that is irrational

Text derived from https://en.wikipedia.org/w/index.php?oldid=1351084053 under CC BY-SA 4.0; modifications have been made.

Words in each sectionFourier's proofFourier's proofFourier's proof: 361 words361Alternative proofsAlternative proofsAlternative proofs: 210 words210GeneralizationsGeneralizationsGeneralizations: 119 words119Euler's proofEuler's proofEuler's proof: 108 words108See alsoSee alsoSee also: 41 words41
Words in each section. Measured from the stored article body; sections below the minimum are not plotted.

Provenance

snapshot enwiki-001351084053 · captured 2026-04-25 · ledger · version history

Cite this page as: encyclopegia.org, “Proof that e is irrational”, snapshot enwiki-001351084053. https://encyclopegia.org/a/proof-that-e-is-irrational

Sources cited in this revision

4 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.