The number e, also known as Euler's number, is a mathematical constant approximately equal to 2.71828 which can be characterized in many ways. It is the base of the natural logarithms. It is the limit of (1 + 1/n)^{n} as n approaches infinity, an expression that arises in the study of compound interest. It can also be calculated as the sum of the infinite series
It is also the unique positive number a such that the graph of the function y = a^{x} has a slope of 1 at x = 0.
The (natural) exponential function f(x) = e^{x} is the unique function f that equals its own derivative and satisfies the equation f(0) = 1; hence one can also define e as f(1). The natural logarithm, or logarithm to base e, is the inverse function to the natural exponential function. The natural logarithm of a number k > 1 can be defined directly as the area under the curve y = 1/x between x = 1 and x = k, in which case e is the value of k for which this area equals one (see image). There are various other characterizations.
The number e is sometimes called Euler's number (not to be confused with Euler's constant ), after the Swiss mathematician Leonhard Euler, or Napier's constant, after John Napier.^{[1]} The constant was discovered by the Swiss mathematician Jacob Bernoulli while studying compound interest.^{[2]}^{[3]}
The number e is of great importance in mathematics,^{[4]}^{[page needed]} alongside 0, 1, π, and i. All five appear in one formulation of Euler's identity , and play important and recurring roles across mathematics.^{[5]}^{[6]} Like the constant π, e is irrational (it cannot be represented as a ratio of integers) and transcendental (it is not a root of any non-zero polynomial with rational coefficients).^{[1]} To 50 decimal places the value of e is:
The first references to the constant were published in 1618 in the table of an appendix of a work on logarithms by John Napier. However, this did not contain the constant itself, but simply a list of logarithms to the base . It is assumed that the table was written by William Oughtred.^{[3]}
The discovery of the constant itself is credited to Jacob Bernoulli in 1683,^{[7]}^{[8]} who attempted to find the value of the following expression (which is equal to e):
The first known use of the constant, represented by the letter b, was in correspondence from Gottfried Leibniz to Christiaan Huygens in 1690 and 1691.^{[9]} Leonhard Euler introduced the letter e as the base for natural logarithms, writing in a letter to Christian Goldbach on 25 November 1731.^{[10]}^{[11]} Euler started to use the letter e for the constant in 1727 or 1728, in an unpublished paper on explosive forces in cannons,^{[12]} while the first appearance of e in a publication was in Euler's Mechanica (1736).^{[13]} Although some researchers used the letter c in the subsequent years, the letter e was more common and eventually became standard.^{[citation needed]}
In mathematics, the most common typographical convention is to typeset the constant as "e", in italics, although sometimes "e" in roman is used. On the other hand, the ISO 80000-2:2019 standard recommends typesetting constants in an upright style.^{[citation needed]}
Jacob Bernoulli discovered this constant in 1683, while studying a question about compound interest:^{[3]}
An account starts with $1.00 and pays 100 percent interest per year. If the interest is credited once, at the end of the year, the value of the account at year-end will be $2.00. What happens if the interest is computed and credited more frequently during the year?
If the interest is credited twice in the year, the interest rate for each 6 months will be 50%, so the initial $1 is multiplied by 1.5 twice, yielding $1.00 × 1.5^{2} = $2.25 at the end of the year. Compounding quarterly yields $1.00 × 1.25^{4} = $2.4414..., and compounding monthly yields $1.00 × (1 + 1/12)^{12} = $2.613035… If there are n compounding intervals, the interest for each interval will be 100%/n and the value at the end of the year will be $1.00 × (1 + 1/n)^{n}.
Bernoulli noticed that this sequence approaches a limit (the force of interest) with larger n and, thus, smaller compounding intervals. Compounding weekly (n = 52) yields $2.692597..., while compounding daily (n = 365) yields $2.714567... (approximately two cents more). The limit as n grows large is the number that came to be known as e. That is, with continuous compounding, the account value will reach $2.718281828...
More generally, an account that starts at $1 and offers an annual interest rate of R will, after t years, yield e^{Rt} dollars with continuous compounding.
(Note here that R is the decimal equivalent of the rate of interest expressed as a percentage, so for 5% interest, R = 5/100 = 0.05.)
The number e itself also has applications in probability theory, in a way that is not obviously related to exponential growth. Suppose that a gambler plays a slot machine that pays out with a probability of one in n and plays it n times. Then, for large n, the probability that the gambler will lose every bet is approximately 1/e. For n = 20, this is already approximately 1/2.79.
This is an example of a Bernoulli trial process. Each time the gambler plays the slots, there is a one in n chance of winning. Playing n times is modeled by the binomial distribution, which is closely related to the binomial theorem and Pascal's triangle. The probability of winning k times out of n trials is:
In particular, the probability of winning zero times (k = 0) is
The limit of the above expression, as n tends to infinity, is precisely 1/e.
The normal distribution with zero mean and unit standard deviation is known as the standard normal distribution, given by the probability density function
The constraint of unit variance (and thus also unit standard deviation) results in the 1/2 in the exponent, and the constraint of unit total area under the curve results in the factor .^{[proof]} This function is symmetric around x = 0, where it attains its maximum value , and has inflection points at x = ±1.
Another application of e, also discovered in part by Jacob Bernoulli along with Pierre Remond de Montmort, is in the problem of derangements, also known as the hat check problem:^{[14]} n guests are invited to a party, and at the door, the guests all check their hats with the butler, who in turn places the hats into n boxes, each labelled with the name of one guest. But the butler has not asked the identities of the guests, and so he puts the hats into boxes selected at random. The problem of de Montmort is to find the probability that none of the hats gets put into the right box. This probability, denoted by , is:
As the number n of guests tends to infinity, p_{n} approaches 1/e. Furthermore, the number of ways the hats can be placed into the boxes so that none of the hats are in the right box is n!/e, rounded to the nearest integer, for every positive n.^{[15]}
A stick of length L is broken into n equal parts. The value of n that maximizes the product of the lengths is then either^{[16]}
The stated result follows because the maximum value of occurs at (Steiner's problem, discussed below). The quantity is a measure of information gleaned from an event occurring with probability , so that essentially the same optimal division appears in optimal planning problems like the secretary problem.
The number e occurs naturally in connection with many problems involving asymptotics. An example is Stirling's formula for the asymptotics of the factorial function, in which both the numbers e and π appear:
As a consequence,
The principal motivation for introducing the number e, particularly in calculus, is to perform differential and integral calculus with exponential functions and logarithms.^{[17]} A general exponential function y = a^{x} has a derivative, given by a limit:
The parenthesized limit on the right is independent of the variable x. Its value turns out to be the logarithm of a to base e. Thus, when the value of a is set to e, this limit is equal to 1, and so one arrives at the following simple identity:
Consequently, the exponential function with base e is particularly suited to doing calculus. Choosing e (as opposed to some other number as the base of the exponential function) makes calculations involving the derivatives much simpler.
Another motivation comes from considering the derivative of the base-a logarithm (i.e., log_{a} x),^{[18]} for x > 0:
where the substitution u = h/x was made. The base-a logarithm of e is 1, if a equals e. So symbolically,
The logarithm with this special base is called the natural logarithm, and is denoted as ln; it behaves well under differentiation since there is no undetermined limit to carry through the calculations.
Thus, there are two ways of selecting such special numbers a. One way is to set the derivative of the exponential function a^{x} equal to a^{x}, and solve for a. The other way is to set the derivative of the base a logarithm to 1/x and solve for a. In each case, one arrives at a convenient choice of base for doing calculus. It turns out that these two solutions for a are actually the same: the number e.
Other characterizations of e are also possible: one is as the limit of a sequence, another is as the sum of an infinite series, and still others rely on integral calculus. So far, the following two (equivalent) properties have been introduced:
The following four characterizations can be proven to be equivalent:
Similarly:
As in the motivation, the exponential function e^{x} is important in part because it is the unique nontrivial function that is its own derivative (up to multiplication by a constant):
and therefore its own antiderivative as well:
The number e is the unique real number such that
for all positive x.^{[19]}
Also, we have the inequality
for all real x, with equality if and only if x = 0. Furthermore, e is the unique base of the exponential for which the inequality a^{x} ≥ x + 1 holds for all x.^{[20]} This is a limiting case of Bernoulli's inequality.
Steiner's problem asks to find the global maximum for the function
This maximum occurs precisely at x = e.
The value of this maximum is 1.44466786100976613365... (sequence A073229 in the OEIS).
For proof, the inequality , from above, evaluated at and simplifying gives . So for all positive x.^{[21]}
Similarly, x = 1/e is where the global minimum occurs for the function
defined for positive x. More generally, for the function
the global maximum for positive x occurs at x = 1/e for any n < 0; and the global minimum occurs at x = e^{−1/n} for any n > 0.
The infinite tetration
converges if and only if e^{−e} ≤ x ≤ e^{1/e} (or approximately between 0.0660 (A073230) and 1.4447 (A073229)), due to a theorem of Leonhard Euler.^{[22]}
The real number e is irrational. Euler proved this by showing that its simple continued fraction expansion is infinite.^{[23]} (See also Fourier's proof that e is irrational.)
Furthermore, by the Lindemann–Weierstrass theorem, e is transcendental, meaning that it is not a solution of any non-constant polynomial equation with rational coefficients. It was the first number to be proved transcendental without having been specifically constructed for this purpose (compare with Liouville number); the proof was given by Charles Hermite in 1873.
It is conjectured that e is normal, meaning that when e is expressed in any base the possible digits in that base are uniformly distributed (occur with equal probability in any sequence of given length).
It is conjectured that e is not a Kontsevich-Zagier period.^{[24]}
The exponential function e^{x} may be written as a Taylor series
Because this series is convergent for every complex value of x, it is commonly used to extend the definition of e^{x} to the complex numbers. This, with the Taylor series for sin and cos x, allows one to derive Euler's formula:
which holds for every complex x. The special case with x = π is Euler's identity:
from which it follows that, in the principal branch of the logarithm,
Furthermore, using the laws for exponentiation,
which is de Moivre's formula.
The expression
is sometimes referred to as cis(x).
The expressions of sin x and cos x in terms of the exponential function can be deduced:
The family of functions
where C is any real number, is the solution to the differential equation
The number e can be represented in a variety of ways: as an infinite series, an infinite product, a continued fraction, or a limit of a sequence. Two of these representations, often used in introductory calculus courses, are the limit
given above, and the series
obtained by evaluating at x = 1 the above power series representation of e^{x}.
Less common is the continued fraction
which written out looks like
This continued fraction for e converges three times as quickly:^{[citation needed]}
Many other series, sequence, continued fraction, and infinite product representations of e have been proved.
In addition to exact analytical expressions for representation of e, there are stochastic techniques for estimating e. One such approach begins with an infinite sequence of independent random variables X_{1}, X_{2}..., drawn from the uniform distribution on [0, 1]. Let V be the least number n such that the sum of the first n observations exceeds 1:
Then the expected value of V is e: E(V) = e.^{[27]}^{[28]}
The number of known digits of e has increased substantially during the last decades. This is due both to the increased performance of computers and to algorithmic improvements.^{[29]}^{[30]}
Date | Decimal digits | Computation performed by |
---|---|---|
1690 | 1 | Jacob Bernoulli^{[7]} |
1714 | 13 | Roger Cotes^{[31]} |
1748 | 23 | Leonhard Euler^{[32]} |
1853 | 137 | William Shanks^{[33]} |
1871 | 205 | William Shanks^{[34]} |
1884 | 346 | J. Marcus Boorman^{[35]} |
1949 | 2,010 | John von Neumann (on the ENIAC) |
1961 | 100,265 | Daniel Shanks and John Wrench^{[36]} |
1978 | 116,000 | Steve Wozniak on the Apple II^{[37]} |
Since around 2010, the proliferation of modern high-speed desktop computers has made it feasible for most amateurs to compute trillions of digits of e within acceptable amounts of time. On Dec 5, 2020, a record-setting calculation was made, giving e to 31,415,926,535,897 (approximately π×10^{13}) digits.^{[38]}
One way to compute the digits of e is with the series^{[39]}
A faster method involves two recursive function and . The functions are defined as
The expression
During the emergence of internet culture, individuals and organizations sometimes paid homage to the number e.
In an early example, the computer scientist Donald Knuth let the version numbers of his program Metafont approach e. The versions are 2, 2.7, 2.71, 2.718, and so forth.^{[40]}
In another instance, the IPO filing for Google in 2004, rather than a typical round-number amount of money, the company announced its intention to raise 2,718,281,828 USD, which is e billion dollars rounded to the nearest dollar.
Google was also responsible for a billboard^{[41]} that appeared in the heart of Silicon Valley, and later in Cambridge, Massachusetts; Seattle, Washington; and Austin, Texas. It read "{first 10-digit prime found in consecutive digits of e}.com". The first 10-digit prime in e is 7427466391, which starts at the 99th digit.^{[42]} Solving this problem and visiting the advertised (now defunct) website led to an even more difficult problem to solve, which consisted in finding the fifth term in the sequence 7182818284, 8182845904, 8747135266, 7427466391. It turned out that the sequence consisted of 10-digit numbers found in consecutive digits of e whose digits summed to 49. The fifth term in the sequence is 5966290435, which starts at the 127th digit.^{[43]} Solving this second problem finally led to a Google Labs webpage where the visitor was invited to submit a résumé.^{[44]}
look for example letter nr. 6
We have computed e on a 7090 to 100,265D by the obvious program