List of representations of e explained

The mathematical constant can be represented in a variety of ways as a real number. Since is an irrational number (see proof that e is irrational), it cannot be represented as the quotient of two integers, but it can be represented as a continued fraction. Using calculus, may also be represented as an infinite series, infinite product, or other types of limit of a sequence.

As a continued fraction

Euler proved that the number is represented as the infinite simple continued fraction^[1] :

e = [ 2 ; 1 , 2 , 1 , 1 , 4 , 1 , 1 , 6 , 1 , 1 , 8 , 1 , \ldots, 1 , 2 n, 1 , \ldots].

Its convergence can be tripled by allowing just one fractional number:

e = [ 1 ; 1 / 2 , 12 , 5 , 28 , 9 , 44 , 13 , 60 , 17 , \ldots, 4 ( 4 n -1 ), 4 n +1 , \ldots].

Here are some infinite generalized continued fraction expansions of . The second is generated from the first by a simple equivalence transformation.

e = 2+ \cfrac{ 1 }{ 1+ \cfrac{ 1 }{ 2+ \cfrac{ 2 }{ 3+ \cfrac{ 3 }{ 4+ \cfrac{ 4 }{ 5+ \ddots}}}}} = 2+ \cfrac{ 2 }{ 2+ \cfrac{ 3 }{ 3+ \cfrac{ 4 }{ 4+ \cfrac{ 5 }{ 5+ \cfrac{ 6 }{ 6+ \ddots}}}}} e = 2+ \cfrac{ 1 }{ 1+ \cfrac{ 2 }{ 5+ \cfrac{ 1 }{ 10+ \cfrac{ 1 }{ 14+ \cfrac{ 1 }{ 18+ \ddots}}}}} = 1+ \cfrac{ 2 }{ 1+ \cfrac{ 1 }{ 6+ \cfrac{ 1 }{ 10+ \cfrac{ 1 }{ 14+ \cfrac{ 1 }{ 18+ \ddots}}}}}

This last, equivalent to [1; 0.5, 12, 5, 28, 9, ...], is a special case of a general formula for the exponential function:

e ^{x/y} = 1+ \cfrac{ 2 x} { 2 y - x + \cfrac{x ^{2}} { 6 y + \cfrac{x ^{2}} { 10 y + \cfrac{x ^{2}} { 14 y + \cfrac{x ^{2}} { 18 y + \ddots}}}}}

As an infinite series

The number can be expressed as the sum of the following infinite series:

e ^{x} = \sum ^{inf ty} _{k =0} (x ^{k})/(k!) for any real number x.

In the special case where x = 1 or -1, we have:

e = \sum ^{inf ty} _{k =0} (1)/(k!) ,^[2] ande ^{-1} = \sum ^{inf ty} _{k =0} (( -1 ) ^{k})/(k!) .

Other series include the following:

e = \left [ \sum ^{inf ty} _{k =0} (1-2 k)/(( 2 k)!) \right ] ^{-1} ^[3] e = (1)/(2) \sum ^{inf ty} _{k =0} (k +1)/(k!) e = 2 \sum ^{inf ty} _{k =0} (k +1)/(( 2 k +1 )!) e = \sum ^{inf ty} _{k =0} (3-4 k ^{2})/(( 2 k +1 )!) e = \sum ^{inf ty} _{k =0} (( 3 k) ^{2+1})/(( 3 k)!) = \sum ^{inf ty} _{k =0} (( 3 k +1 ) ^{2+1})/(( 3 k +1 )!) = \sum ^{inf ty} _{k =0} (( 3 k +2 ) ^{2+1})/(( 3 k +2 )!) e = \left [ \sum ^{inf ty} _{k =0} (4 k +3)/(2 ^{2k+1} ( 2 k +1 )!) \right ] ^{2} e = \sum ^{inf ty} _{k =0} (k ^{n})/(B _{n(k!)}) where B _{n} is the th Bell number.e = \sum ^{inf ty} _{k =0} (2 k +3)/((k +2 )!) ^[4] Consideration of how to put upper bounds on e leads to this descending series:e = 3 - \sum ^{inf ty} _{k =2} (1)/(k! (k -1 ) k) = 3 - (1)/(4) - (1)/(36) - (1)/(288) - (1)/(2400) - (1)/(21600) - (1)/(211680) - (1)/(2257920) - … which gives at least one correct (or rounded up) digit per term. That is, if 1 ≤ n, thene < 3 - \sum ^{n} _{k =2} (1)/(k! (k -1 ) k) < e + 0 . 6 ⋅ 10 ^{1-n} . More generally, if x is not in, thene ^{x} = (2+ x)/(2- x) + \sum ^{inf ty} _{k =2} (- x ^{k+1})/(k! (k - x) (k +1- x)) .

As a recursive function

The series representation of

e , given as $$e\; =\; \backslash frac\; +\; \backslash frac\; +\; \backslash frac\; +\; \backslash frac\; \backslash cdots$$can also be expressed using a form of recursion. When (1)/(n) is iteratively factored from the original series the result is the nested series^[5] $$e\; =\; 1\; +\; \backslash frac(1\; +\; \backslash frac(1\; +\; \backslash frac(1\; +\; \backslash cdots)))$$which equates to $$e\; =\; 1\; +\; \backslash cfrac$$ This fraction is of the form f(n) = 1 + (f(n +1 ))/(n) , where f( 1 ) computes the sum of the terms from 1 to inf ty .

As an infinite product

The number is also given by several infinite product forms including Pippenger's product

e = 2 \left ( (2)/(1) \right ) ^{1/2} \left ( (2)/(3) (4)/(3) \right ) ^{1/4} \left ( (4)/(5) (6)/(5) (6)/(7) (8)/(7) \right ) ^{1/8} …

and Guillera's product ^{[6] [7]}

e = \left ( (2)/(1) \right ) ^{1/1} \left ( (2 ^{2})/(1 ⋅ 3) \right ) ^{1/2} \left ( (2 ^{3} ⋅ 4)/(1 ⋅ 3 ^{3}) \right ) ^{1/3} \left ( (2 ^{4} ⋅ 4 ^{4})/(1 ⋅ 3 ^{6} ⋅ 5) \right ) ^{1/4} … , where the nth factor is the nth root of the product\prod ^{n} _{k =0} (k +1 ) ^{( -1 ) ^{k+1} {n \choose k} },

as well as the infinite product

e = (2 ⋅ 2 ^{( ln ( 2 ) -1 ) ^{2}} …)/(2 ^{ln ( 2 ) -1} ⋅ 2 ^{( ln ( 2 ) -1 ) ^{3}} …) .

More generally, if 1 < B < e² (which includes B = 2, 3, 4, 5, 6, or 7), then

e = (B ⋅ B ^{( ln (B) -1 ) ^{2}} …)/(B ^{ln (B) -1} ⋅ B ^{( ln (B) -1 ) ^{3}} …) .

Also

e = \lim\limits _{n → infty} \prod ^{n{n} _{k =0} \choose k} ^{2/{((n +\alpha)(n+\beta))} }\ \forall\alpha,\beta\in\Bbb R

As the limit of a sequence

The number is equal to the limit of several infinite sequences:

e = \lim _{n} n ⋅ \left ( (\sqrt{ 2 \pi n)/() } \right)^ ande = \lim _{n} (n)/(\sqrt[n]{n!) } (both by Stirling's formula).

The symmetric limit,^[8]

e = \lim _{n} \left [ ((n +1 ) ^{n+1})/(n ^{n}) - (n ^{n})/((n -1 ) ^{n-1}) \right ]

may be obtained by manipulation of the basic limit definition of .

The next two definitions are direct corollaries of the prime number theorem^[9]

e = \lim _{n} (p _{n} \#) ^{1 /p _{n}}

where

p _{n} is the nth prime and p _{n} \# is the primorial of the nth prime.e = \lim _{n} n ^{\pi(n)/n}

where

\pi(n) is the prime-counting function.

Also:

e ^{x=} \lim _{n} \left ( 1+ (x)/(n) \right ) ^{n.}

In the special case that

x = 1 , the result is the famous statement:e = \lim _{n} \left ( 1+ (1)/(n) \right ) ^{n.} n! , that counts all permutations of an ordered set S with cardinality n , and the subfactorial (a.k.a. the derangement function) !n , which counts the amount of permutations where no element appears in its original position, tends to e as n grows.e = \lim _{n} (n!)/(!n) .

As a ratio of ratios

A unique representation of can be found within the structure of Pascal's Triangle, as discovered by Harlan Brothers. Pascal's Triangle is composed of binomial coefficients, which are traditionally summed to derive polynomial expansions. However, Brothers identified a product-based relationship between these coefficients that links to . Specifically, the ratio of the products of binomial coefficients in adjacent rows of Pascal's Triangle tends to as the row number increases. This relationship and its proof are outlined in the discussion on the properties of the rows of Pascal's Triangle.^{[10] [11]}

In trigonometry

Trigonometrically, can be written in terms of the sum of two hyperbolic functions,

e ^{x} = \sinh(x) + \cosh(x) ,

at .

See also

• List of formulae involving π

Notes and References

1. Web site: How Euler Did It: Who proved e is Irrational?. Sandifer. Ed. Feb 2006. MAA Online. 2017-04-23.
2. Web site: It's the Law Too — the Laws of Logarithms. Brown. Stan. 2006-08-27. Oak Road Systems. 2008-08-14. dead. https://web.archive.org/web/20080813175402/http://oakroadsystems.com/math/loglaws.htm. 2008-08-13.
3. Formulas 2–7: H. J. Brothers, Improving the convergence of Newton's series approximation for e, The College Mathematics Journal, Vol. 35, No. 1, (2004), pp. 34–39.
4. Formula 8: A. G. Llorente, A Novel Simple Representation Series for Euler’s Number e, preprint, 2023.
5. .
6. J. Sondow, A faster product for pi and a new integral for ln pi/2, Amer. Math. Monthly 112 (2005) 729–734.
7. J. Guillera and J. Sondow, Double integrals and infinite products for some classical constants via analytic continuations of Lerch's transcendent, Ramanujan Journal 16 (2008), 247–270.
8. H. J. Brothers and J. A. Knox, New closed-form approximations to the Logarithmic Constant e, The Mathematical Intelligencer, Vol. 20, No. 4, (1998), pp. 25–29.
9. S. M. Ruiz 1997
10. Brothers . Harlan . Pascal's Triangle: The Hidden Stor-e . The Mathematical Gazette . 96 . 145–148 . 2012 . 10.1017/S0025557200004204.
11. Brothers . Harlan . Math Bite: Finding e in Pascal’s Triangle . Mathematics Magazine . 85 . 1 . 51 . 2012 . 10.4169/math.mag.85.1.51.