E (mathematical constant)

{{#invoke:Hatnote|hatnote}}Template:Main other Template:Pp-move-indef Template:E (mathematical constant) The number Template:Mvar is an important mathematical constant that is the base of the natural logarithm. It is approximately equal to 2.71828,[1] and is the limit of (1 + 1/n)n as Template:Mvar approaches infinity, an expression that arises in the study of compound interest. It can also be calculated as the sum of the infinite series[2]

${\displaystyle e=\displaystyle \sum \limits _{n=0}^{\infty }{\dfrac {1}{n!}}=1+{\frac {1}{1}}+{\frac {1}{1\cdot 2}}+{\frac {1}{1\cdot 2\cdot 3}}+\cdots }$

The constant can be defined in many ways. For example, Template:Mvar can be defined as the unique positive number Template:Mvar such that the graph of the function y = ax has unit slope at x = 0.[3] The function f(x) = ex is called the exponential function, and its inverse is the natural logarithm, or logarithm to base Template:Mvar. The natural logarithm of a positive number k can also be defined directly as the area under the curve y = 1/x between x = 1 and x = k, in which case, Template:Mvar is the number whose natural logarithm is 1. There are alternative characterizations.

Sometimes called Euler's number after the Swiss mathematician Leonhard Euler, Template:Mvar is not to be confused with γ—the Euler–Mascheroni constant, sometimes called simply Euler's constant. The number Template:Mvar is also known as Napier's constant, but Euler's choice of the symbol Template:Mvar is said to have been retained in his honor.[4] The constant was discovered by the Swiss mathematician Jacob Bernoulli while studying compound interest.

The number Template:Mvar is of eminent importance in mathematics,[5] alongside 0, 1, π and [[imaginary unit|Template:Mvar]]. All five of these numbers play important and recurring roles across mathematics, and are the five constants appearing in one formulation of Euler's identity. Like the constant π, Template:Mvar is irrational: it is not a ratio of integers; and it is transcendental: it is not a root of any non-zero polynomial with rational coefficients. The numerical value of Template:Mvar truncated to 50 decimal places is

Template:Gaps (sequence A001113 in OEIS).

History

The first references to the constant were published in 1618 in the table of an appendix of a work on logarithms by John Napier.[6] However, this did not contain the constant itself, but simply a list of logarithms calculated from the constant. It is assumed that the table was written by William Oughtred. The discovery of the constant itself is credited to Jacob Bernoulli,[7] who attempted to find the value of the following expression (which is in fact Template:Mvar):

${\displaystyle \lim _{n\to \infty }\left(1+{\frac {1}{n}}\right)^{n}.}$

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. Leonhard Euler introduced the letter Template:Mvar as the base for natural logarithms, writing in a letter to Christian Goldbach of 25 November 1731.[8][9] Euler started to use the letter Template:Mvar for the constant in 1727 or 1728, in an unpublished paper on explosive forces in cannons,[10] and the first appearance of Template:Mvar in a publication was Euler's Mechanica (1736).[11] While in the subsequent years some researchers used the letter c, Template:Mvar was more common and eventually became the standard.

Applications

The effect of earning 20% annual interest on an initial $1,000 investment at various compounding frequencies Jacob Bernoulli discovered this constant by studying a question about compound interest:[6] 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.52 =$2.25 at the end of the year. Compounding quarterly yields $1.00×1.254 =$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..., just two cents more. The limit as n grows large is the number that came to be known as Template:Mvar; with continuous compounding, the account value will reach$2.7182818.... More generally, an account that starts at $1 and offers an annual interest rate of R will, after t years, yield eRt dollars with continuous compounding. (Here R is a fraction, so for 5% interest, R = 5/100 = 0.05) Bernoulli trials The number Template:Mvar itself also has applications to probability theory, where it arises in a way 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 (such as a million) the probability that the gambler will lose every bet is (approximately) 1/e. For n = 20 it is already approximately 1/2.79. This is an example of a Bernoulli trials process. Each time the gambler plays the slots, there is a one in one million chance of winning. Playing one million times is modelled by the binomial distribution, which is closely related to the binomial theorem. The probability of winning k times out of a million trials is; ${\displaystyle {\binom {10^{6}}{k}}\left(10^{-6}\right)^{k}(1-10^{-6})^{10^{6}-k}.}$ In particular, the probability of winning zero times (k = 0) is ${\displaystyle \left(1-{\frac {1}{10^{6}}}\right)^{10^{6}}.}$ This is very close to the following limit for 1/e: ${\displaystyle {\frac {1}{e}}=\lim _{n\to \infty }\left(1-{\frac {1}{n}}\right)^{n}.}$ Derangements Another application of Template:Mvar, also discovered in part by Jacob Bernoulli along with Pierre Raymond de Montmort is in the problem of derangements, also known as the hat check problem:[12] n guests are invited to a party, and at the door each guest checks his hat with the butler who then places them into n boxes, each labelled with the name of one guest. But the butler does not know 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. The answer 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 the number n of guests tends to infinity, pn approaches 1/e. Furthermore, the number of ways the hats can be placed into the boxes so that none of the hats is in the right box is n!/e rounded to the nearest integer, for every positive n.[13] Asymptotics The number Template:Mvar occurs naturally in connection with many problems involving asymptotics. A prominent example is Stirling's formula for the asymptotics of the factorial function, in which both the numbers Template:Mvar and π enter: ${\displaystyle n!\sim {\sqrt {2\pi n}}\,\left({\frac {n}{e}}\right)^{n}.}$ A particular consequence of this is ${\displaystyle e=\lim _{n\to \infty }{\frac {n}{\sqrt[{n}]{n!}}}}$. Standard normal distribution (from Normal distribution) The simplest case of a normal distribution is known as the standard normal distribution, described by this probability density function: ${\displaystyle \phi (x)={\frac {1}{\sqrt {2\pi }}}\,e^{-{\frac {\scriptscriptstyle 1}{\scriptscriptstyle 2}}x^{2}}.}$ The factor ${\displaystyle \scriptstyle \ 1/{\sqrt {2\pi }}}$ in this expression ensures that the total area under the curve ϕ(x) is equal to one[proof]. The Template:Frac2 in the exponent ensures that the distribution has unit variance (and therefore also unit standard deviation). This function is symmetric around x=0, where it attains its maximum value ${\displaystyle \scriptstyle \ 1/{\sqrt {2\pi }}}$; and has inflection points at +1 and −1. Template:Mvar in calculus Function f(x) = ax for several values of a. Template:Mvar is the value of a such that the gradient of f(x) = ax at x = 0 equals 1. This is the blue curve, ex. Functions 2x (dotted curve) and 4x (dashed curve) are also shown; they are not tangent to the line of slope 1 (red). The natural log at (x-axis) Template:Mvar, ln(e), is equal to 1 The principal motivation for introducing the number Template:Mvar, particularly in calculus, is to perform differential and integral calculus with exponential functions and logarithms.[14] A general exponential function y = ax has derivative given as the limit: ${\displaystyle {\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}\left(\lim _{h\to 0}{\frac {a^{h}-1}{h}}\right).}$ The limit on the far right is independent of the variable x: it depends only on the base a. When the base is Template:Mvar, this limit is equal to 1, and so Template:Mvar is symbolically defined by the equation: ${\displaystyle {\frac {d}{dx}}e^{x}=e^{x}.}$ Consequently, the exponential function with base Template:Mvar is particularly suited to doing calculus. Choosing Template:Mvar, as opposed to some other number, as the base of the exponential function makes calculations involving the derivative much simpler. Another motivation comes from considering the base-a logarithm.[15] Considering the definition of the derivative of loga x as the limit: ${\displaystyle {\frac {d}{dx}}\log _{a}x=\lim _{h\to 0}{\frac {\log _{a}(x+h)-\log _{a}(x)}{h}}={\frac {1}{x}}\left(\lim _{u\to 0}{\frac {1}{u}}\log _{a}(1+u)\right),}$ where the substitution u = h/x was made in the last step. The last limit appearing in this calculation is again an undetermined limit that depends only on the base a, and if that base is Template:Mvar, the limit is equal to 1. So symbolically, ${\displaystyle {\frac {d}{dx}}\log _{e}x={\frac {1}{x}}.}$ The logarithm in this special base is called the natural logarithm and is represented as ln; it behaves well under differentiation since there is no undetermined limit to carry through the calculations. There are thus two ways in which to select a special number a = e. One way is to set the derivative of the exponential function ax to ax, 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. In fact, these two solutions for a are actually the same, the number Template:Mvar. Alternative characterizations The area between the x-axis and the graph y = 1/x, between x = 1 and x = e is 1. {{#invoke:see also|seealso}} Other characterizations of Template:Mvar 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: 1. The number Template:Mvar is the unique positive real number such that ${\displaystyle {\frac {d}{dt}}e^{t}=e^{t}.}$ 2. The number Template:Mvar is the unique positive real number such that ${\displaystyle {\frac {d}{dt}}\log _{e}t={\frac {1}{t}}.}$ The following three characterizations can be proven equivalent: 3. The number Template:Mvar is the limit ${\displaystyle e=\lim _{n\to \infty }\left(1+{\frac {1}{n}}\right)^{n}}$ Similarly: ${\displaystyle e=\lim _{x\to 0}\left(1+x\right)^{\frac {1}{x}}}$ 4. The number Template:Mvar 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 number Template:Mvar is the unique positive real number such that ${\displaystyle \int _{1}^{e}{\frac {1}{t}}\,dt=1.}$ Properties Calculus As in the motivation, the exponential function ex is important in part because it is the unique nontrivial function (up to multiplication by a constant) which is its own derivative ${\displaystyle {\frac {d}{dx}}e^{x}=e^{x}}$ and therefore its own antiderivative as well: ${\displaystyle \int e^{x}\,dx=e^{x}+C.}$ Exponential-like functions {{#invoke:see also|seealso}} The global maximum for the function ${\displaystyle f(x)={\sqrt[{x}]{x}}}$ occurs at x = e. Similarly, x = 1/e is where the global minimum occurs for the function ${\displaystyle f(x)=x^{x}\,}$ defined for positive x. More generally, x = e−1/n is where the global minimum occurs for the function ${\displaystyle \!\ f(x)=x^{x^{n}}}$ for any n > 0. The infinite tetration ${\displaystyle x^{x^{x^{\cdot ^{\cdot ^{\cdot }}}}}}$ or ${\displaystyle x}$ converges if and only if eexe1/e (or approximately between 0.0660 and 1.4447), due to a theorem of Leonhard Euler. Number theory The real number Template:Mvar is irrational. Euler proved this by showing that its simple continued fraction expansion is infinite.[16] (See also Fourier's [[proof that e is irrational|proof that Template:Mvar is irrational]].) Furthermore, by the Lindemann–Weierstrass theorem, Template:Mvar 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 Template:Mvar is normal, meaning that when Template:Mvar is expressed in any base the possible digits in that base are uniformly distributed (occur with equal probability in any sequence of given length). Complex numbers The exponential function ex may be written as a Taylor series ${\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 keeps many important properties for ex even when x is complex, it is commonly used to extend the definition of ex to the complex numbers. 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 all x. The special case with x = π is Euler's identity: ${\displaystyle e^{i\pi }+1=0\,\!}$ from which it follows that, in the principal branch of the logarithm, ${\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),}$ which is de Moivre's formula. The expression ${\displaystyle \cos x+i\sin x\,}$ is sometimes referred to as cis(x). Differential equations The general function ${\displaystyle y(x)=Ce^{x}\,}$ is the solution to the differential equation: ${\displaystyle y'=y.\,}$ Representations {{#invoke:main|main}} The number Template:Mvar can be represented as a real number in a variety of ways: as an infinite series, an infinite product, a continued fraction, or a limit of a sequence. The chief among these representations, particularly in introductory calculus courses is the limit ${\displaystyle \lim _{n\to \infty }\left(1+{\frac {1}{n}}\right)^{n},}$ given above, as well as the series ${\displaystyle e=\sum _{n=0}^{\infty }{\frac {1}{n!}}}$ given by evaluating the above power series for ex at x = 1. Less common is the continued fraction (sequence A003417 in OEIS). ${\displaystyle e=[2;1,\mathbf {2} ,1,1,\mathbf {4} ,1,1,\mathbf {6} ,1,1,...,\mathbf {2n} ,1,1,...]=[1;\mathbf {0} ,1,1,\mathbf {2} ,1,1,\mathbf {4} ,1,1,...,\mathbf {2n} ,1,1,...],}$[17] which written out looks like ${\displaystyle e=2+{\cfrac {1}{1+{\cfrac {1}{\mathbf {2} +{\cfrac {1}{1+{\cfrac {1}{1+{\cfrac {1}{\mathbf {4} +{\cfrac {1}{1+{\cfrac {1}{1+\ddots }}}}}}}}}}}}}}=1+{\cfrac {1}{\mathbf {0} +{\cfrac {1}{1+{\cfrac {1}{1+{\cfrac {1}{\mathbf {2} +{\cfrac {1}{1+{\cfrac {1}{1+{\cfrac {1}{\mathbf {4} +{\cfrac {1}{1+{\cfrac {1}{1+\ddots }}}}}}}}}}}}}}}}}}.}$ This continued fraction for Template:Mvar converges three times as quickly: ${\displaystyle e=[1;0.5,12,5,28,9,44,13,\ldots ,4(4n-1),(4n+1),\ldots ],}$ which written out looks like ${\displaystyle e=1+{\cfrac {2}{1+{\cfrac {1}{6+{\cfrac {1}{10+{\cfrac {1}{14+{\cfrac {1}{18+{\cfrac {1}{22+{\cfrac {1}{26+\ddots \,}}}}}}}}}}}}}}.}$ Many other series, sequence, continued fraction, and infinite product representations of Template:Mvar have been developed. Stochastic representations In addition to exact analytical expressions for representation of Template:Mvar, there are stochastic techniques for estimating Template:Mvar. One such approach begins with an infinite sequence of independent random variables X1, X2..., drawn from the uniform distribution on [0, 1]. Let V be the least number n such that the sum of the first n samples exceeds 1: ${\displaystyle V=\min {\left\{n\mid X_{1}+X_{2}+\cdots +X_{n}>1\right\}}.}$ Then the expected value of V is Template:Mvar: E(V) = e.[18][19] Known digits The number of known digits of Template:Mvar has increased substantially during the last decades. This is due both to the increased performance of computers and to algorithmic improvements.[20][21] Number of known decimal digits of Template:Mvar Date Decimal digits Computation performed by 1690 1 Jacob Bernoulli[7] 1714 13 Roger Cotes[22] 1748 23 Leonhard Euler[23] 1853 137 William Shanks[24] 1871 205 William Shanks[25] 1884 346 J. Marcus Boorman[26] 1949 2,010 John von Neumann (on the ENIAC) 1961 100,265 Daniel Shanks and John Wrench[27] 1978 116,000 Steve Wozniak on the Apple II[28] 1994 April 1 1,000,000 Robert J. Nemiroff & Jerry Bonnell [29] 1999 November 21 1,250,000,000 Xavier Gourdon [30] 2000 July 16 3,221,225,472 Colin Martin & Xavier Gourdon [31] 2003 September 18 50,100,000,000 Shigeru Kondo & Xavier Gourdon [32] 2007 April 27 100,000,000,000 Shigeru Kondo & Steve Pagliarulo [33] 2009 May 6 200,000,000,000 Rajesh Bohara & Steve Pagliarulo [33] 2010 July 5 1,000,000,000,000 Shigeru Kondo & Alexander J. Yee [34] 2014 November 15 1,048,576,000,000 David Galilei Natale In computer culture In contemporary internet culture, individuals and organizations frequently pay homage to the number Template:Mvar. For instance, in 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, which is Template:Mvar billion dollars rounded to the nearest dollar. Google was also responsible for a billboard[35] 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 Template:Mvar}.com". Solving this problem and visiting the advertised (now defunct) web site led to an even more difficult problem to solve, which in turn led to Google Labs where the visitor was invited to submit a resume.[36] The first 10-digit prime in Template:Mvar is 7427466391, which starts at the 99th digit.[37]

In another instance, the computer scientist Donald Knuth let the version numbers of his program Metafont approach Template:Mvar. The versions are 2, 2.7, 2.71, 2.718, and so forth. Similarly, the version numbers of his TeX program approach π.[38]

Notes

1. {{#invoke:citation/CS1|citation |CitationClass=book }}
2. Template:Cite web
3. {{#invoke:citation/CS1|citation |CitationClass=book }}
4. Template:Cite web
5. Jacob Bernoulli considered the problem of continuous compounding of interest, which led to a series expression for e. See: Jacob Bernoulli (1690) "Quæstiones nonnullæ de usuris, cum solutione problematis de sorte alearum, propositi in Ephem. Gall. A. 1685" (Some questions about interest, with a solution of a problem about games of chance, proposed in the Journal des Savants (Ephemerides Eruditorum Gallicanæ), in the year (anno) 1685.**), Acta eruditorum, pp. 219-223. On page 222, Bernoulli poses the question: "Alterius naturæ hoc Problema est: Quæritur, si creditor aliquis pecuniæ summam fænori exponat, ea lege, ut singulis momentis pars proportionalis usuræ annuæ sorti annumeretur; quantum ipsi finito anno debeatur?" (This is a problem of another kind: The question is, if some lender were to invest [a] sum of money [at] interest, let it accumulate, so that [at] every moment [it] were to receive [a] proportional part of [its] annual interest; how much would he be owed [at the] end of [the] year?) Bernoulli constructs a power series to calculate the answer, and then writes: " … quæ nostra serie [mathematical expression for a geometric series] &c. major est. … si a=b, debebitur plu quam 2½a & minus quam 3a." ( … which our series [a geometric series] is larger [than]. … if a=b, [the lender] will be owed more than 2½a and less than 3a.) If a=b, the geometric series reduces to the series for a × e, so 2.5 < e < 3. (** The reference is to a problem which Jacob Bernoulli posed and which appears in the Journal des Sçavans of 1685 at the bottom of page 314.)
6. Lettre XV. Euler à Goldbach, dated November 25, 1731 in: P. H. Fuss, ed., Correspondance Mathématique et Physique de Quelques Célèbres Géomètres du XVIIIeme Siècle … (Mathematical and physical correspondence of some famous geometers of the 18th century), vol. 1, (St. Petersburg, Russia: 1843), pp. 56-60 ; see especially page 58. From page 58: " … ( e denotat hic numerum, cujus logarithmus hyperbolicus est = 1), … " ( … (e denotes that number whose hyperbolic [i.e., natural] logarithm is equal to 1) … )
7. {{#invoke:citation/CS1|citation |CitationClass=book }}
8. Leonhard Euler, Mechanica, sive Motus scientia analytice exposita (St. Petersburg (Petropoli), Russia: Academy of Sciences, 1736), vol. 1, Chapter 2, Corollary 11, paragraph 171, p. 68. From page 68: Erit enim ${\displaystyle {\frac {dc}{c}}={\frac {dyds}{rdx}}}$ seu ${\displaystyle c=e^{\int {\frac {dyds}{rdx}}}}$ ubi e denotat numerum, cuius logarithmus hyperbolicus est 1. (So it [i.e., c, the speed] will be ${\displaystyle {\frac {dc}{c}}={\frac {dyds}{rdx}}}$ or ${\displaystyle c=e^{\int {\frac {dyds}{rdx}}}}$, where e denotes the number whose hyperbolic [i.e., natural] logarithm is 1.)
9. Grinstead, C.M. and Snell, J.L.Introduction to probability theory (published online under the GFDL), p. 85.
10. Knuth (1997) The Art of Computer Programming Volume I, Addison-Wesley, p. 183 ISBN 0-201-03801-3.
11. Kline, M. (1998) Calculus: An intuitive and physical approach, section 12.3 "The Derived Functions of Logarithmic Functions.", pp. 337 ff, Courier Dover Publications, 1998, ISBN 0-486-40453-6
12. This is the approach taken by Kline (1998).
13. Template:Cite web
14. Hofstadter, D. R., "Fluid Concepts and Creative Analogies: Computer Models of the Fundamental Mechanisms of Thought" Basic Books (1995) ISBN 0-7139-9155-0
15. Russell, K. G. (1991) Estimating the Value of e by Simulation The American Statistician, Vol. 45, No. 1. (Feb., 1991), pp. 66–68.
16. Dinov, ID (2007) Estimating e using SOCR simulation, SOCR Hands-on Activities (retrieved December 26, 2007).
17. Sebah, P. and Gourdon, X.; The constant e and its computation
18. Gourdon, X.; Reported large computations with PiFast
19. Roger Cotes (1714) "Logometria," Philosophical Transactions of the Royal Society of London, 29 (338) : 5-45; see especially the bottom of page 10. From page 10: "Porro eadem ratio est inter 2,718281828459 &c et 1, … " (Furthermore, the same ratio is between 2.718281828459… and 1, … )
20. Leonhard Euler, Introductio in Analysin Infinitorum (Lausanne, Switzerland: Marc Michel Bousquet & Co., 1748), volume 1, page 90.
21. William Shanks, Contributions to Mathematics, … (London, England: G. Bell, 1853), page 89.
22. William Shanks (1871) "On the numerical values of e, loge 2, loge 3, loge 5, and loge 10, also on the numerical value of M the modulus of the common system of logarithms, all to 205 decimals," Proceedings of the Royal Society of London, 20 : 27-29.
23. J. Marcus Boorman (October 1884) "Computation of the Naperian base," Mathematical Magazine, 1 (12) : 204-205.
24. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
25. Template:Cite news
26. Email from Robert Nemiroff and Jerry Bonnell – The Number e to 1 Million Digits. None. Retrieved on 2012-02-24.
27. Email from Xavier Gourdon to Simon Plouffe – I have made a new e computation (with verification): 1,250,000,000 digits. None. Retrieved on 2012-02-24.
28. PiHacks message 177 – E to 3,221,225,472 D. Groups.yahoo.com. Retrieved on 2012-02-24.
29. PiHacks message 1071 – Two new records: 50 billions for E and 25 billions for pi. Groups.yahoo.com. Retrieved on 2012-02-24.
30. English Version of PI WORLD. Ja0hxv.calico.jp. Retrieved on 2012-02-24.
31. A list of notable large computations of e. Numberworld.org. Last updated: March 7, 2011. Retrieved on 2012-02-24.
32. First 10-digit prime found in consecutive digits of e}. Brain Tags. Retrieved on 2012-02-24.
33. Template:Cite news
34. Template:Cite web
35. {{#invoke:Citation/CS1|citation |CitationClass=journal }}