e (mathematical constant)
Part of a series of articles on the |
mathematical constant e |
---|
Properties |
Applications |
Defining e |
People |
Related topics |
The number e, also known as Euler's number, is a mathematical constant approximately equal to 2.71828 that can be characterized in many ways. It is the base of 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 [math]\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. }[/math]
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 1 (see image). There are various other characterizations.
The number e is sometimes called Euler's number (not to be confused with Euler's constant [math]\displaystyle{ \gamma }[/math])—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]} alongside 0, 1, π, and i. All five appear in one formulation of Euler's identity [math]\displaystyle{ e^{i\pi}+1=0 }[/math] 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:^{[7]}
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. However, this did not contain the constant itself, but simply a list of logarithms to the base [math]\displaystyle{ e }[/math]. It is assumed that the table was written by William Oughtred.^{[3]}
The constant itself was introduced by Jacob Bernoulli in 1683, for solving the problem of continuous compounding of interest.^{[8]}^{[9]} In his solution, the constant e occurs as the limit [math]\displaystyle{ \lim_{n\to \infty} \left( 1 + \frac{1}{n} \right)^n, }[/math] where n represents the fraction of the year on which the compound interest is evaluated (for example, [math]\displaystyle{ n=12 }[/math] for a month).
The first known use of the constant,^{[clarification needed]} represented by the letter b, was in correspondence from Gottfried Leibniz to Christiaan Huygens in 1690 and 1691.^{[10]}
Leonhard Euler started to use the letter e for the constant in 1727 or 1728, in an unpublished paper on explosive forces in cannons,^{[11]} and in a letter to Christian Goldbach on 25 November 1731.^{[12]}^{[13]} The first appearance of e in a printed publication was in Euler's Mechanica (1736).^{[14]} It is unknown why Euler chose the letter e.^{[15]} Although some researchers used the letter c in the subsequent years,^{[citation needed]} the letter e was more common and eventually became standard.
Applications
Compound interest
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.44140625, 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.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.
(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.)
Bernoulli trials
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:
- [math]\displaystyle{ \binom{n}{k} \left(\frac{1}{n}\right)^k\left(1 - \frac{1}{n}\right)^{n-k}. }[/math]
In particular, the probability of winning zero times (k = 0) is
- [math]\displaystyle{ \left(1 - \frac{1}{n}\right)^{n}. }[/math]
The limit of the above expression, as n tends to infinity, is precisely 1/e.
Standard normal distribution
The normal distribution with zero mean and unit standard deviation is known as the standard normal distribution, given by the probability density function
- [math]\displaystyle{ \phi(x) = \frac{1}{\sqrt{2\pi}} e^{-\frac{1}{2} x^2}. }[/math]
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 [math]\displaystyle{ \phi(x) }[/math] results in the factor [math]\displaystyle{ \textstyle 1/\sqrt{2\pi} }[/math].^{[proof]} This function is symmetric around x = 0, where it attains its maximum value [math]\displaystyle{ \textstyle 1/\sqrt{2\pi} }[/math], and has inflection points at x = ±1.
Derangements
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:^{[16]} 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 [math]\displaystyle{ p_n\! }[/math], is:
- [math]\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!}. }[/math]
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.^{[17]}
Optimal planning problems
The maximum value of [math]\displaystyle{ \sqrt[x]{x} }[/math] occurs at [math]\displaystyle{ x = e }[/math]. Equivalently, for any value of the base b > 1, it is the case that the maximum value of [math]\displaystyle{ x^{-1}\log_b x }[/math] occurs at [math]\displaystyle{ x = e }[/math] (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^{[18]}
- [math]\displaystyle{ n = \left\lfloor \frac{L}{e} \right\rfloor }[/math] or [math]\displaystyle{ \left\lceil \frac{L}{e} \right\rceil. }[/math]
The quantity [math]\displaystyle{ x^{-1}\log_b x }[/math] is also a measure of information gleaned from an event occurring with probability [math]\displaystyle{ 1/x }[/math], so that essentially the same optimal division appears in optimal planning problems like the secretary problem.
Asymptotics
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: [math]\displaystyle{ n! \sim \sqrt{2\pi n} \left(\frac{n}{e}\right)^n. }[/math]
As a consequence, [math]\displaystyle{ e = \lim_{n\to\infty} \frac{n}{\sqrt[n]{n!}} . }[/math]
In calculus
The principal motivation for introducing the number e, particularly in calculus, is to perform differential and integral calculus with exponential functions and logarithms.^{[19]} A general exponential function y = a^{x} has a derivative, given by a limit:
- [math]\displaystyle{ \begin{align} \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{align} }[/math]
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:
- [math]\displaystyle{ \frac{d}{dx}e^x = e^x. }[/math]
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),^{[20]} for x > 0:
- [math]\displaystyle{ \begin{align} \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{align} }[/math]
where the substitution u = h/x was made. The base-a logarithm of e is 1, if a equals e. So symbolically,
- [math]\displaystyle{ \frac{d}{dx}\log_e x = \frac{1}{x}. }[/math]
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.
Alternative characterizations
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 number e is the unique positive real number such that [math]\displaystyle{ \frac{d}{dt}e^t = e^t }[/math].
- The number e is the unique positive real number such that [math]\displaystyle{ \frac{d}{dt} \log_e t = \frac{1}{t} }[/math].
The following four characterizations can be proved to be equivalent:
- The number e is the limit
- [math]\displaystyle{ e = \lim_{n\to\infty} \left( 1 + \frac{1}{n} \right)^n }[/math]
Similarly:
- [math]\displaystyle{ e = \lim_{t\to 0} \left( 1 + t \right)^{\frac{1}{t}} }[/math]
- The number e is the sum of the infinite series
- [math]\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 , }[/math]
where n! is the factorial of n. - The number e is the unique positive real number such that
- [math]\displaystyle{ \int_1^e \frac{1}{t} \, dt = 1. }[/math]
- If f(t) is an exponential function, then the quantity [math]\displaystyle{ \tau = f(t)/f'(t) }[/math] is a constant, sometimes called the time constant (it is the reciprocal of the exponential growth constant or decay constant). The time constant is the time it takes for the exponential function to increase by a factor of e: [math]\displaystyle{ f(t+\tau) = e f(t) }[/math].
Properties
Calculus
As in the motivation, the exponential function e^{x} is important in part because it is the unique function (up to multiplication by a constant K) that is equal to its own derivative:
[math]\displaystyle{ \frac{d}{dx}Ke^x = Ke^x, }[/math]
and therefore its own antiderivative as well:
[math]\displaystyle{ \int Ke^x\,dx = Ke^x + C . }[/math]
Equivalently, the family of functions
[math]\displaystyle{ y(x) = Ke^x }[/math]
where K is any real or complex number, is the solution to the differential equation
[math]\displaystyle{ y' = y . }[/math]
Inequalities
The number e is the unique real number such that [math]\displaystyle{ \left(1 + \frac{1}{x}\right)^x \lt e \lt \left(1 + \frac{1}{x}\right)^{x+1} }[/math] for all positive x.^{[21]}
Also, we have the inequality [math]\displaystyle{ e^x \ge x + 1 }[/math] 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.^{[22]} This is a limiting case of Bernoulli's inequality.
Exponential-like functions
Steiner's problem asks to find the global maximum for the function
[math]\displaystyle{ f(x) = x^\frac{1}{x} . }[/math]
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
[math]\displaystyle{ f(x) = x^x . }[/math]
The infinite tetration
- [math]\displaystyle{ x^{x^{x^{\cdot^{\cdot^{\cdot}}}}} }[/math] or [math]\displaystyle{ {^\infty}x }[/math]
converges if and only if x ∈ [e^{−e}, e^{1/e}] ≈ [0.06599, 1.4447] , shown by a theorem of Leonhard Euler.^{[23]}^{[non-primary source needed]}
Number theory
The real number e is irrational. Euler proved this by showing that its simple continued fraction expansion is infinite.^{[24]} (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.
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.^{[25]}
Complex numbers
The exponential function e^{x} may be written as a Taylor series
[math]\displaystyle{ e^{x} = 1 + {x \over 1!} + {x^{2} \over 2!} + {x^{3} \over 3!} + \cdots = \sum_{n=0}^{\infty} \frac{x^n}{n!}. }[/math]
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:
[math]\displaystyle{ e^{ix} = \cos x + i\sin x , }[/math]
which holds for every complex x. The special case with x = π is Euler's identity:
[math]\displaystyle{ e^{i\pi} + 1 = 0 , }[/math]
from which it follows that, in the principal branch of the logarithm,
[math]\displaystyle{ \ln (-1) = i\pi . }[/math]
Furthermore, using the laws for exponentiation,
[math]\displaystyle{ (\cos x + i\sin x)^n = \left(e^{ix}\right)^n = e^{inx} = \cos (nx) + i \sin (nx) , }[/math]
which is de Moivre's formula.
The expressions of cos x and sin x in terms of the exponential function can be deduced from the Taylor series: [math]\displaystyle{ \cos x = \frac{e^{ix} + e^{-ix}}{2} , \qquad \sin x = \frac{e^{ix} - e^{-ix}}{2i}. }[/math]
The expression [math]\displaystyle{ \cos x + i \sin x }[/math] is sometimes abbreviated as cis(x).
Representations
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
- [math]\displaystyle{ e=\lim_{n\to\infty}\left(1 + \frac{1}{n}\right)^n, }[/math]
given above, and the series
- [math]\displaystyle{ e=\sum_{n=0}^\infty \frac{1}{n!} }[/math]
obtained by evaluating at x = 1 the above power series representation of e^{x}.
Less common is the continued fraction
- [math]\displaystyle{ e = [2; 1, 2, 1, 1, 4, 1, 1, 6, 1, ..., 1, 2n, 1, ...], }[/math]^{[26]}^{[27]}
which written out looks like
- [math]\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} } } } } } } . }[/math]
This continued fraction for e converges three times as quickly:^{[citation needed]}
- [math]\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}}}}}}}. }[/math]
Many other series, sequence, continued fraction, and infinite product representations of e have been proved.
Stochastic representations
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:
- [math]\displaystyle{ V = \min\left\{ n \mid X_1 + X_2 + \cdots + X_n \gt 1 \right\}. }[/math]
Then the expected value of V is e: E(V) = e.^{[28]}^{[29]}
Known digits
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.^{[30]}^{[31]}
Date | Decimal digits | Computation performed by |
---|---|---|
1690 | 1 | Jacob Bernoulli^{[8]} |
1714 | 13 | Roger Cotes^{[32]} |
1748 | 23 | Leonhard Euler^{[33]} |
1853 | 137 | William Shanks^{[34]} |
1871 | 205 | William Shanks^{[35]} |
1884 | 346 | J. Marcus Boorman^{[36]} |
1949 | 2,010 | John von Neumann (on the ENIAC) |
1961 | 100,265 | Daniel Shanks and John Wrench^{[37]} |
1978 | 116,000 | Steve Wozniak on the Apple II^{[38]} |
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.^{[39]}
Computing the digits
One way to compute the digits of e is with the series^{[40]} [math]\displaystyle{ e=\sum_{k=0}^\infty \frac{1}{k!}. }[/math]
A faster method involves two recursive function [math]\displaystyle{ p(a,b) }[/math] and [math]\displaystyle{ q(a,b) }[/math]. The functions are defined as [math]\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} }[/math].
The expression [math]\displaystyle{ 1+\frac{p(0,n)}{q(0,n)} }[/math] produces the digits of e.^{[clarification needed]} This method uses binary splitting to compute e with fewer single-digit arithmetic operations and reduced bit complexity. Combining this with Fast Fourier Transform-based methods of multiplying integers makes computing the digits very fast.^{[40]}
In computer culture
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.^{[41]}
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 United States dollar rounded to the nearest dollar.
Google was also responsible for a billboard^{[42]} 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.^{[43]} 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.^{[44]} Solving this second problem finally led to a Google Labs webpage where the visitor was invited to submit a résumé.^{[45]}
References
- ↑ ^{1.0} ^{1.1} Weisstein, Eric W.. "e" (in en). https://mathworld.wolfram.com/e.html.
- ↑ Pickover, Clifford A. (2009). The Math Book: From Pythagoras to the 57th Dimension, 250 Milestones in the History of Mathematics (illustrated ed.). Sterling Publishing Company. p. 166. ISBN 978-1-4027-5796-9. https://books.google.com/books?id=JrslMKTgSZwC. Extract of page 166
- ↑ ^{3.0} ^{3.1} ^{3.2} O'Connor, J J; Robertson, E F. "The number e". MacTutor History of Mathematics. http://www-history.mcs.st-and.ac.uk/HistTopics/e.html.
- ↑ Sawyer, W. W. (1961) (in en). Mathematician's Delight. Penguin. pp. 155. https://archive.org/details/MathemateciansDelight-W.W.Sawyer/page/n153/mode/2up.
- ↑ Wilson, Robinn (2018). Euler's Pioneering Equation: The most beautiful theorem in mathematics (illustrated ed.). Oxford University Press. p. (preface). ISBN 978-0-19-251405-9. https://books.google.com/books?id=345HDwAAQBAJ.
- ↑ Posamentier, Alfred S.; Lehmann, Ingmar (2004). Pi: A Biography of the World's Most Mysterious Number (illustrated ed.). Prometheus Books. p. 68. ISBN 978-1-59102-200-8. https://books.google.com/books?id=QFPvAAAAMAAJ.
- ↑ Sloane, N. J. A., ed. "Sequence A001113". OEIS Foundation. https://oeis.org/A001113.
- ↑ ^{8.0} ^{8.1} 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–23. 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 be owing [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.)
- ↑ Carl Boyer; Uta Merzbach (1991). A History of Mathematics (2nd ed.). Wiley. p. 419. ISBN 978-0-471-54397-8. https://archive.org/details/historyofmathema00boye.
- ↑ Leibniz, Gottfried Wilhelm (2003). "Sämliche Schriften Und Briefe" (in de). https://leibniz.uni-goettingen.de/files/pdf/Leibniz-Edition-III-5.pdf. "look for example letter nr. 6"
- ↑ Euler, Meditatio in experimenta explosione tormentorum nuper instituta. Scribatur pro numero cujus logarithmus est unitas, e, qui est 2,7182817… (English: Written for the number of which the logarithm has the unit, e, that is 2,7182817...")
- ↑ 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 p. 58. From p. 58: " … ( e denotat hic numerum, cujus logarithmus hyperbolicus est = 1), … " ( … (e denotes that number whose hyperbolic [i.e., natural] logarithm is equal to 1) … )
- ↑ Remmert, Reinhold (1991). Theory of Complex Functions. Springer-Verlag. p. 136. ISBN 978-0-387-97195-7.
- ↑ 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 [math]\displaystyle{ \frac{dc}{c} = \frac{dy ds}{rdx} }[/math] seu [math]\displaystyle{ c = e^{\int\frac{dy ds}{rdx}} }[/math] ubi e denotat numerum, cuius logarithmus hyperbolicus est 1. (So it [i.e., c, the speed] will be [math]\displaystyle{ \frac{dc}{c} = \frac{dy ds}{rdx} }[/math] or [math]\displaystyle{ c = e^{\int\frac{dy ds}{rdx}} }[/math], where e denotes the number whose hyperbolic [i.e., natural] logarithm is 1.)
- ↑ Calinger, Ronald (2016). Leonhard Euler: Mathematical Genius in the Enlightenment. Princeton University Press. ISBN 978-0-691-11927-4. p. 124.
- ↑ Grinstead, C.M. and Snell, J.L.Introduction to probability theory (published online under the GFDL), p. 85.
- ↑ Knuth (1997) The Art of Computer Programming Volume I, Addison-Wesley, p. 183 ISBN 0-201-03801-3.
- ↑ Steven Finch (2003). Mathematical constants. Cambridge University Press. p. 14. ISBN 978-0-521-81805-6. https://archive.org/details/mathematicalcons0000finc.
- ↑ 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
- ↑ This is the approach taken by Kline (1998).
- ↑ Dorrie, Heinrich (1965). 100 Great Problems of Elementary Mathematics. Dover. pp. 44–48.
- ↑ A standard calculus exercise using the mean value theorem; see for example Apostol (1967) Calculus, § 6.17.41.
- ↑ Euler, L. "De serie Lambertina Plurimisque eius insignibus proprietatibus." Acta Acad. Scient. Petropol. 2, 29–51, 1783. Reprinted in Euler, L. Opera Omnia, Series Prima, Vol. 6: Commentationes Algebraicae. Leipzig, Germany: Teubner, pp. 350–369, 1921. (facsimile)
- ↑ Sandifer, Ed (Feb 2006). "How Euler Did It: Who proved e is Irrational?". MAA Online. http://vanilla47.com/PDFs/Leonhard%20Euler/How%20Euler%20Did%20It%20by%20Ed%20Sandifer/Who%20proved%20e%20is%20irrational.pdf.
- ↑ Kontsevich, Maxim Kontsevich. "Periods". https://www.ihes.fr/~maxim/TEXTS/Periods.pdf.
- ↑ Hofstadter, D.R., "Fluid Concepts and Creative Analogies: Computer Models of the Fundamental Mechanisms of Thought" Basic Books (1995) ISBN 0-7139-9155-0
- ↑ Sloane, N. J. A., ed. "Sequence A003417". OEIS Foundation. https://oeis.org/A003417.
- ↑ Russell, K.G. (1991) Estimating the Value of e by Simulation The American Statistician, Vol. 45, No. 1. (Feb., 1991), pp. 66–68.
- ↑ Dinov, ID (2007) Estimating e using SOCR simulation, SOCR Hands-on Activities (retrieved December 26, 2007).
- ↑ Sebah, P. and Gourdon, X.; The constant e and its computation
- ↑ Gourdon, X.; Reported large computations with PiFast
- ↑ 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, by the same means, the ratio is between 2.718281828459… and 1, … )
- ↑ Leonhard Euler, Introductio in Analysin Infinitorum (Lausanne, Switzerland: Marc Michel Bousquet & Co., 1748), volume 1, page 90.
- ↑ William Shanks, Contributions to Mathematics, ... (London, England: G. Bell, 1853), page 89.
- ↑ William Shanks (1871) "On the numerical values of e, log_{e} 2, log_{e} 3, log_{e} 5, and log_{e} 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.
- ↑ J. Marcus Boorman (October 1884) "Computation of the Naperian base," Mathematical Magazine, 1 (12) : 204–205.
- ↑ Daniel Shanks and John W Wrench (1962). "Calculation of Pi to 100,000 Decimals". Mathematics of Computation 16 (77): 76–99 (78). doi:10.2307/2003813. https://www.ams.org/journals/mcom/1962-16-077/S0025-5718-1962-0136051-9/S0025-5718-1962-0136051-9.pdf. "We have computed e on a 7090 to 100,265D by the obvious program".
- ↑ Wozniak, Steve (June 1981). "The Impossible Dream: Computing e to 116,000 Places with a Personal Computer". BYTE: pp. 392. https://archive.org/stream/byte-magazine-1981-06/1981_06_BYTE_06-06_Operating_Systems#page/n393/mode/2up.
- ↑ Alexander Yee. "e". http://www.numberworld.org/digits/E/.
- ↑ ^{40.0} ^{40.1} R., Finch, Steven (2005). Mathematical constants. Cambridge Univ. Press. ISBN 978-0-521-81805-6. OCLC 180072364. http://worldcat.org/oclc/180072364.
- ↑ Knuth, Donald (1990-10-03). "The Future of TeX and Metafont". TeX Mag 5 (1): 145. http://www.ntg.nl/maps/05/34.pdf. Retrieved 2017-02-17.
- ↑ "First 10-digit prime found in consecutive digits of e". http://braintags.com/archives/2004/07/first-10digit-prime-found-in-consecutive-digits-of-e/.
- ↑ Kazmierczak, Marcus (2004-07-29). "Google Billboard". mkaz.com. http://mkaz.com/math/google-billboard.
- ↑ The first 10-digit prime in e . Explore Portland Community. Retrieved on 2020-12-09.
- ↑ Shea, Andrea. "Google Entices Job-Searchers with Math Puzzle". NPR. https://www.npr.org/templates/story/story.php?storyId=3916173.
Further reading
- Maor, Eli; e: The Story of a Number, ISBN 0-691-05854-7
- Commentary on Endnote 10 of the book Prime Obsession for another stochastic representation
- McCartin, Brian J. (2006). "e: The Master of All". The Mathematical Intelligencer 28 (2): 10–21. doi:10.1007/bf02987150. http://www.maa.org/sites/default/files/pdf/upload_library/22/Chauvenet/mccartin.pdf.
External links
- 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
Original source: https://en.wikipedia.org/wiki/E (mathematical constant).
Read more |