e (mathematical constant)

The number e is the limit $${\displaystyle \lim _{n\to \infty }\left(1+{\frac {1}{n}}\right)^{n},}$$  an expression that arises in the computation of compound interest.

It is the sum of the infinite series $${\displaystyle e=\sum \limits _{n=0}^{\infty }{\frac {1}{n!}}=1+{\frac {1}{1}}+{\frac {1}{1\cdot 2}}+{\frac {1}{1\cdot 2\cdot 3}}+\cdots .}$$ 

It is the unique positive number a such that the graph of the function y = a^x has a slope of 1 at x = 0.

One has $${\displaystyle e=\exp(1),}$$  where ${\displaystyle \exp }$  is the (natural) exponential function, the unique function that equals its own derivative and satisfies the equation ${\displaystyle \exp(0)=1.}$  Since the exponential function is commonly denoted as ${\displaystyle x\mapsto e^{x},}$  one has also $${\displaystyle e=e^{1}.}$$ 

The logarithm of base b can be defined as the inverse function of the function ${\displaystyle x\mapsto b^{x}.}$  Since ${\displaystyle b=b^{1},}$  one has ${\displaystyle \log _{b}b=1.}$  The equation ${\displaystyle e=e^{1}}$  implies therefore that e is the base of the natural logarithm.

The number e can also be characterized in terms of an integral:^[9] $${\displaystyle \int _{1}^{e}{\frac {dx}{x}}=1.}$$ 

For other characterizations, see § Representations.

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 ${\displaystyle e}$ . It is assumed that the table was written by William Oughtred. In 1661, Christiaan Huygens studied how to compute logarithms by geometrical methods and calculated a quantity that, in retrospect, is the base-10 logarithm of e, but he did not recognize e itself as a quantity of interest.^[5][10]

The constant itself was introduced by Jacob Bernoulli in 1683, for solving the problem of continuous compounding of interest.^[11][12] In his solution, the constant e occurs as the limit $${\displaystyle \lim _{n\to \infty }\left(1+{\frac {1}{n}}\right)^{n},}$$  where n represents the number of intervals in a year on which the compound interest is evaluated (for example, ${\displaystyle n=12}$  for monthly compounding).

The first symbol used for this constant was the letter b by Gottfried Leibniz in letters to Christiaan Huygens in 1690 and 1691.^[13]

Leonhard Euler started to use the letter e for the constant in 1727 or 1728, in an unpublished paper on explosive forces in cannons,^[14] and in a letter to Christian Goldbach on 25 November 1731.^[15][16] The first appearance of e in a printed publication was in Euler's Mechanica (1736).^[17] It is unknown why Euler chose the letter e.^[18] Although some researchers used the letter c in the subsequent years, the letter e was more common and eventually became standard.^[2]

Euler proved that e is the sum of the infinite series $${\displaystyle e=\sum _{n=0}^{\infty }{\frac {1}{n!}}={\frac {1}{0!}}+{\frac {1}{1!}}+{\frac {1}{2!}}+{\frac {1}{3!}}+{\frac {1}{4!}}+\cdots ,}$$  where n! is the factorial of n.^[5] The equivalence of the two characterizations using the limit and the infinite series can be proved via the binomial theorem.^[19]

 

Jacob Bernoulli discovered this constant in 1683, while studying a question about compound interest:^[5]

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.25 at the end of the year. Compounding quarterly yields $1.00 × 1.25⁴ = $2.44140625, and compounding monthly yields $1.00 × (1 + 1/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)ⁿ.^[20][21]

Bernoulli noticed that this sequence approaches a limit (the force of interest) with larger n and, thus, smaller compounding intervals.^[5] Compounding weekly (n = 52) yields $2.692596..., 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. Here, R is the decimal equivalent of the rate of interest expressed as a percentage, so for 5% interest, R = 5/100 = 0.05.^[20][21]

 

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. As n increases, the probability that gambler will lose all n bets approaches 1/e. For n = 20, this is already approximately 1/2.789509....

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:^[22]

${\displaystyle \Pr[k~\mathrm {wins~of} ~n]={\binom {n}{k}}\left({\frac {1}{n}}\right)^{k}\left(1-{\frac {1}{n}}\right)^{n-k}.}$ 

In particular, the probability of winning zero times (k = 0) is

${\displaystyle \Pr[0~\mathrm {wins~of} ~n]=\left(1-{\frac {1}{n}}\right)^{n}.}$ 

The limit of the above expression, as n tends to infinity, is precisely 1/e.

Exponential growth is a process that increases quantity over time at an ever-increasing rate. It occurs when the instantaneous rate of change (that is, the derivative) of a quantity with respect to time is proportional to the quantity itself.^[21] Described as a function, a quantity undergoing exponential growth is an exponential function of time, that is, the variable representing time is the exponent (in contrast to other types of growth, such as quadratic growth). If the constant of proportionality is negative, then the quantity decreases over time, and is said to be undergoing exponential decay instead. The law of exponential growth can be written in different but mathematically equivalent forms, by using a different base, for which the number e is a common and convenient choice: $${\displaystyle x(t)=x_{0}\cdot e^{kt}=x_{0}\cdot e^{t/\tau }.}$$  Here, ${\displaystyle x_{0}}$  denotes the initial value of the quantity x, k is the growth constant, and ${\displaystyle \tau }$  is the time it takes the quantity to grow by a factor of e.

The normal distribution with zero mean and unit standard deviation is known as the standard normal distribution,^[23] given by the probability density function $${\displaystyle \phi (x)={\frac {1}{\sqrt {2\pi }}}e^{-{\frac {1}{2}}x^{2}}.}$$ 

The constraint of unit standard deviation (and thus also unit variance) results in the ⁠1/2⁠ in the exponent, and the constraint of unit total area under the curve ${\displaystyle \phi (x)}$  results in the factor ${\displaystyle \textstyle 1/{\sqrt {2\pi }}}$ . This function is symmetric around x = 0, where it attains its maximum value ${\displaystyle \textstyle 1/{\sqrt {2\pi }}}$ , 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:^[24] 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 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 ${\displaystyle p_{n}\!}$ , is:

${\displaystyle p_{n}=1-{\frac {1}{1!}}+{\frac {1}{2!}}-{\frac {1}{3!}}+\cdots +{\frac {(-1)^{n}}{n!}}=\sum _{k=0}^{n}{\frac {(-1)^{k}}{k!}}.}$ 

As n 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.^[25]

The maximum value of ${\displaystyle {\sqrt[{x}]{x}}}$  occurs at ${\displaystyle x=e}$ . Equivalently, for any value of the base b > 1, it is the case that the maximum value of ${\displaystyle x^{-1}\log _{b}x}$  occurs at ${\displaystyle x=e}$  (Steiner's problem, discussed below).

This is useful in the problem of a stick of length L that is broken into n equal parts. The value of n that maximizes the product of the lengths is then either^[26]

${\displaystyle n=\left\lfloor {\frac {L}{e}}\right\rfloor }$  or ${\displaystyle \left\lceil {\frac {L}{e}}\right\rceil .}$ 

The quantity ${\displaystyle x^{-1}\log _{b}x}$  is also a measure of information gleaned from an event occurring with probability ${\displaystyle 1/x}$  (approximately ${\displaystyle 36.8\%}$  when ${\displaystyle x=e}$ ), 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:^[27] $${\displaystyle n!\sim {\sqrt {2\pi n}}\left({\frac {n}{e}}\right)^{n}.}$$ 

As a consequence,^[27] $${\displaystyle e=\lim _{n\to \infty }{\frac {n}{\sqrt[{n}]{n!}}}.}$$ 

 

 

The principal motivation for introducing the number e, particularly in calculus, is to perform differential and integral calculus with exponential functions and logarithms.^[28] A general exponential function y = a^x has a derivative, given by a limit:

${\displaystyle {\begin{aligned}{\frac {d}{dx}}a^{x}&=\lim _{h\to 0}{\frac {a^{x+h}-a^{x}}{h}}=\lim _{h\to 0}{\frac {a^{x}a^{h}-a^{x}}{h}}\\&=a^{x}\cdot \left(\lim _{h\to 0}{\frac {a^{h}-1}{h}}\right).\end{aligned}}}$ 

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:

${\displaystyle {\frac {d}{dx}}e^{x}=e^{x}.}$ 

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),^[28] for x > 0:

${\displaystyle {\begin{aligned}{\frac {d}{dx}}\log _{a}x&=\lim _{h\to 0}{\frac {\log _{a}(x+h)-\log _{a}(x)}{h}}\\&=\lim _{h\to 0}{\frac {\log _{a}(1+h/x)}{x\cdot h/x}}\\&={\frac {1}{x}}\log _{a}\left(\lim _{u\to 0}(1+u)^{\frac {1}{u}}\right)\\&={\frac {1}{x}}\log _{a}e,\end{aligned}}}$ 

where the substitution u = h/x was made. The base-a logarithm of e is 1, if a equals e. So symbolically,

${\displaystyle {\frac {d}{dx}}\log _{e}x={\frac {1}{x}}.}$ 

The logarithm with this special base is called the natural logarithm, and is usually 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.

 

The Taylor series for the exponential function can be deduced from the facts that the exponential function is its own derivative and that it equals 1 when evaluated at 0:^[29] $${\displaystyle e^{x}=\sum _{n=0}^{\infty }{\frac {x^{n}}{n!}}.}$$  Setting ${\displaystyle x=1}$  recovers the definition of e as the sum of an infinite series.

The natural logarithm function can be defined as the integral from 1 to ${\displaystyle x}$  of ${\displaystyle 1/t}$ , and the exponential function can then be defined as the inverse function of the natural logarithm. The number e is the value of the exponential function evaluated at ${\displaystyle x=1}$ , or equivalently, the number whose natural logarithm is 1. It follows that e is the unique positive real number such that $${\displaystyle \int _{1}^{e}{\frac {1}{t}}\,dt=1.}$$ 

Because e^x is the unique function (up to multiplication by a constant K) that is equal to its own derivative,

$${\displaystyle {\frac {d}{dx}}Ke^{x}=Ke^{x},}$$ 

it is therefore its own antiderivative as well:^[30]

$${\displaystyle \int Ke^{x}\,dx=Ke^{x}+C.}$$ 

Equivalently, the family of functions

$${\displaystyle y(x)=Ke^{x}}$$ 

where K is any real or complex number, is the full solution to the differential equation

$${\displaystyle y'=y.}$$ 

 

The number e is the unique real number such that $${\displaystyle \left(1+{\frac {1}{x}}\right)^{x}<e<\left(1+{\frac {1}{x}}\right)^{x+1}}$$  for all positive x.^[31]

Also, we have the inequality $${\displaystyle e^{x}\geq x+1}$$  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.^[32] This is a limiting case of Bernoulli's inequality.

 

Steiner's problem asks to find the global maximum for the function

$${\displaystyle f(x)=x^{\frac {1}{x}}.}$$ 

This maximum occurs precisely at x = e. (One can check that the derivative of ln f(x) is zero only for this value of x.)

Similarly, x = 1/e is where the global minimum occurs for the function

$${\displaystyle f(x)=x^{x}.}$$ 

The infinite tetration

${\displaystyle x^{x^{x^{\cdot ^{\cdot ^{\cdot }}}}}}$  or ${\displaystyle {^{\infty }}x}$ 

converges if and only if x ∈ [(1/e)^e, e^1/e] ≈ [0.06599, 1.4447] ,^[33][34] shown by a theorem of Leonhard Euler.^[35][36][37]

The real number e is irrational. Euler proved this by showing that its simple continued fraction expansion does not terminate.^[38] (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-zero 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.^[39] The number e is one of only a few transcendental numbers for which the exact irrationality exponent is known (given by ${\displaystyle \mu (e)=2}$ ).^[40]

An unsolved problem thus far is the question of whether or not the numbers e and π are algebraically independent. This would be resolved by Schanuel's conjecture – a currently unproven generalization of the Lindemann–Weierstrass theorem.^[41][42]

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).^[43]

In algebraic geometry, a period is a number that can be expressed as an integral of an algebraic function over an algebraic domain. The constant π is a period, but it is conjectured that e is not.^[44]

The exponential function e^x may be written as a Taylor series^[45][29]

$${\displaystyle e^{x}=1+{x \over 1!}+{x^{2} \over 2!}+{x^{3} \over 3!}+\cdots =\sum _{n=0}^{\infty }{\frac {x^{n}}{n!}}.}$$ 

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.^[46] This, with the Taylor series for sin and cos x, allows one to derive Euler's formula:

$${\displaystyle e^{ix}=\cos x+i\sin x,}$$ 

which holds for every complex x.^[46] The special case with x = π is Euler's identity:

$${\displaystyle e^{i\pi }+1=0,}$$  which is considered to be an exemplar of mathematical beauty as it shows a profound connection between the most fundamental numbers in mathematics. In addition, it is directly used in a proof that π is transcendental, which implies the impossibility of squaring the circle.^[47][48] Moreover, the identity implies that, in the principal branch of the logarithm,^[46]

$${\displaystyle \ln(-1)=i\pi .}$$ 

Furthermore, using the laws for exponentiation,

$${\displaystyle (\cos x+i\sin x)^{n}=\left(e^{ix}\right)^{n}=e^{inx}=\cos nx+i\sin nx}$$ 

for any integer n, which is de Moivre's formula.^[49]

The expressions of cos x and sin x in terms of the exponential function can be deduced from the Taylor series:^[46] $${\displaystyle \cos x={\frac {e^{ix}+e^{-ix}}{2}},\qquad \sin x={\frac {e^{ix}-e^{-ix}}{2i}}.}$$ 

The expression ${\textstyle \cos x+i\sin x}$  is sometimes abbreviated as cis(x).^[49]

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. In addition to the limit and the series given above, there is also the simple continued fraction

${\displaystyle e=[2;1,2,1,1,4,1,1,6,1,...,1,2n,1,...],}$ ^[50][51]

which written out looks like

${\displaystyle e=2+{\cfrac {1}{1+{\cfrac {1}{2+{\cfrac {1}{1+{\cfrac {1}{1+{\cfrac {1}{4+{\cfrac {1}{1+{\cfrac {1}{1+\ddots }}}}}}}}}}}}}}.}$ 

The following infinite product evaluates to e:^[26] $${\displaystyle e={\frac {2}{1}}\left({\frac {4}{3}}\right)^{1/2}\left({\frac {6\cdot 8}{5\cdot 7}}\right)^{1/4}\left({\frac {10\cdot 12\cdot 14\cdot 16}{9\cdot 11\cdot 13\cdot 15}}\right)^{1/8}\cdots .}$$ 

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₁, X₂..., 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:

${\displaystyle V=\min \left\{n\mid X_{1}+X_{2}+\cdots +X_{n}>1\right\}.}$ 

Then the expected value of V is e: E(V) = e.^[52][53]

The number of known digits of e has increased substantially since the introduction of the computer, due both to increasing performance of computers and to algorithmic improvements.^[54][55]

Since around 2010, the proliferation of modern high-speed desktop computers has made it feasible for 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¹³) digits.^[63]

One way to compute the digits of e is with the series^[64] $${\displaystyle e=\sum _{k=0}^{\infty }{\frac {1}{k!}}.}$$ 

A faster method involves two recursive functions ${\displaystyle p(a,b)}$  and ${\displaystyle q(a,b)}$ . The functions are defined as $${\displaystyle {\binom {p(a,b)}{q(a,b)}}={\begin{cases}{\binom {1}{b}},&{\text{if }}b=a+1{\text{,}}\\{\binom {p(a,m)q(m,b)+p(m,b)}{q(a,m)q(m,b)}},&{\text{otherwise, where }}m=\lfloor (a+b)/2\rfloor .\end{cases}}}$$ 

The expression $${\displaystyle 1+{\frac {p(0,n)}{q(0,n)}}}$$  produces the nth partial sum of the series above. This method uses binary splitting to compute e with fewer single-digit arithmetic operations and thus reduced bit complexity. Combining this with fast Fourier transform-based methods of multiplying integers makes computing the digits very fast.^[64]

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.^[65]

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.^[66]

Google was also responsible for a billboard^[67] 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.^[68] 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.^[69] Solving this second problem finally led to a Google Labs webpage where the visitor was invited to submit a résumé.^[70]

The last release of the official Python 2 interpreter has version number 2.7.18, a reference to e.^[71]

• Maor, Eli, ed. (2009). e: The Story of a Number. Princeton science library. Princeton, N.J: Princeton University Press. ISBN 978-0-691-05854-2.
• Commentary on Endnote 10 of the book Prime Obsession for another stochastic representation
• McCartin, Brian J. (March 2006). "e: The Master of All" (PDF). The Mathematical Intelligencer. 28 (2): 10–21. doi:10.1007/BF02987150. ISSN 0343-6993. S2CID 123033482.

 

Wikimedia Commons has media related to e (mathematical constant).

 

Wikiquote has quotations related to e (mathematical constant).

• The number e to 1 million places and NASA.gov 2 and 5 million places
• e Approximations – Wolfram MathWorld
• Earliest Uses of Symbols for Constants Jan. 13, 2008
• "The story of e", by Robin Wilson at Gresham College, 28 February 2007 (available for audio and video download)
• e Search Engine 2 billion searchable digits of e, π and √2