This is a good article. Click here for more information.

e (mathematical constant)

From Wikipedia, the free encyclopedia
(Redirected from E approximations)
Jump to navigation Jump to search
Euler's number
e
2.71828...[1]
General information
TypeTranscendental
History
Discovered1685
ByJacob Bernoulli
First mentionQuæstiones nonnullæ de usuris, cum solutione problematis de sorte alearum, propositi in Ephem. Gall. A. 1685
Named after
File:Hyperbola E.svg
Graph of the equation y = 1/x. Here, e is the unique number larger than 1 that makes the shaded area under the curve equal to 1.

The number e is a mathematical constant, approximately equal to 2.71828, that is the base of the natural logarithm and exponential function. It is sometimes called Euler's number, after the Swiss mathematician Leonhard Euler, though this can invite confusion with Euler numbers, or with Euler's constant, a different constant typically denoted γ. Alternatively, e can be called Napier's constant after John Napier.[2][3] The Swiss mathematician Jacob Bernoulli discovered the constant while studying compound interest.[4][5]

The number e is of great importance in mathematics,[6] alongside 0, 1, π, and i. All five appear in one formulation of Euler's identity eiπ+1=0 and play important and recurring roles across mathematics.[7][8] Like the constant π, e is irrational, meaning that it cannot be represented as a ratio of integers. Moreover, it is transcendental, meaning that it is not a root of any non-zero polynomial with rational coefficients.[3] To 30 decimal places, the value of e is:[1]

2.718281828459045235360287471352

Definitions

[edit | edit source]

The number e is the limit limn(1+1n)n, an expression that arises in the computation of compound interest.

It is the sum of the infinite series e=n=01n!=1+11+112+1123+.

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

One has e=exp(1), where exp is the (natural) exponential function, the unique function that equals its own derivative and satisfies the equation exp(0)=1. Therefore, e is also the base of the natural logarithm, the inverse of the natural exponential function.

The number e can also be characterized in terms of an integral:[9] 1edxx=1.

For other characterizations, see § Representations.

History

[edit | edit source]

The first references to this 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 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 limn(1+1n)n, where n represents the number of intervals in a year on which the compound interest is evaluated (for example, 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 e=n=01n!=10!+11!+12!+13!+14!+, 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]

Applications

[edit | edit source]

Compound interest

[edit | edit source]
File:Compound Interest with Varying Frequencies.svg
The effect of earning 20% annual interest on an initial $1,000 investment at various compounding frequencies. The limiting curve on top is the graph y=1000e0.2t, where y is in dollars, t in years, and 0.2 = 20%.

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.52 = $2.25 at the end of the year. Compounding quarterly yields $1.00 × 1.254 = $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.[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 eRt 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]

Bernoulli trials

[edit | edit source]
File:Bernoulli trial sequence.svg
Graphs of probability P of not observing independent events each of probability 1/n after n Bernoulli trials, and 1 − P vs n ; it can be observed that as n increases, the probability of a 1/n-chance event never appearing after n tries rapidly converges to 1/e.

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, which is approximately 36.79%. For n = 20, this is already 1/2.789509... (approximately 35.85%).

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]

Pr[kwinsofn]=(nk)(1n)k(11n)nk.

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

Pr[0winsofn]=(11n)n.

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

Exponential growth and decay

[edit | edit source]

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: x(t)=x0ekt=x0et/τ. Here, x0 denotes the initial value of the quantity x, k is the growth constant, and τ is the time it takes the quantity to grow by a factor of e.

Standard normal distribution

[edit | edit source]

The normal distribution with zero mean and unit standard deviation is known as the standard normal distribution,[23] given by the probability density function ϕ(x)=12πe12x2.

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 ϕ(x) results in the factor 1/2π. This function is symmetric around x = 0, where it attains its maximum value 1/2π, and has inflection points at x = ±1.

Derangements

[edit | edit source]

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 pn, is:

pn=111!+12!13!++(1)nn!=k=0n(1)kk!.

As n 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 are in the right box is n!/e, rounded to the nearest integer, for every positive n.[25]

Optimal planning problems

[edit | edit source]

The maximum value of xx occurs at x=e. Equivalently, for any value of the base b > 1, it is the case that the maximum value of x1logbx occurs at 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]

n=Le or Le.

The quantity x1logbx is also a measure of information gleaned from an event occurring with probability 1/x (approximately 36.8% when x=e), so that essentially the same optimal division appears in optimal planning problems like the secretary problem.

Asymptotics

[edit | edit source]

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] n!2πn(ne)n.

As a consequence,[27] e=limnnn!n.

Properties

[edit | edit source]

Calculus

[edit | edit source]
File:Exp derivative at 0.svg
The graphs of the functions xax are shown for a = 2 (dotted), a = e (blue), and a = 4 (dashed). They all pass through the point (0,1), but the red line (which has slope 1) is tangent to only ex there.
File:Ln+e.svg
The value of the natural log function for argument e, i.e. ln e, equals 1.

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 = ax has a derivative, given by a limit:

ddxax=limh0ax+haxh=limh0axahaxh=ax(limh0ah1h).

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:

ddxex=ex.

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

ddxlogax=limh0loga(x+h)loga(x)h=limh0loga(1+h/x)xh/x=1xloga(limu0(1+u)1u)=1xlogae,

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

ddxlogex=1x.

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 ax equal 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. It turns out that these two solutions for a are actually the same: the number e.

File:Area under rectangular hyperbola.svg
The five colored regions are of equal area, and define units of hyperbolic angle along the hyperbola xy=1.

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] ex=n=0xnn!. Setting 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 x of 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 x=1, or equivalently, the number whose natural logarithm is 1. It follows that e is the unique positive real number such that 1e1tdt=1.

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

ddxKex=Kex,

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

Kexdx=Kex+C.

Equivalently, the family of functions

y(x)=Kex

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

y=y.

Inequalities

[edit | edit source]
File:Exponentials vs x+1.pdf
Exponential functions y = 2x and y = 4x intersect the graph of y = x + 1, respectively, at x = 1 and x = −1/2. The number e is the unique base such that y = ex intersects only at x = 0. We may infer that e lies between 2 and 4.

The number e is the unique real number such that (1+1x)x<e<(1+1x)x+1 for all positive x.[31]

Also, we have the inequality exx+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 axx + 1 holds for all x.[32] This is a limiting case of Bernoulli's inequality.

Exponential-like functions

[edit | edit source]
File:Xth root of x.svg
The global maximum of xx occurs at x = e.

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

f(x)=x1x.

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

f(x)=xx.

The infinite tetration

xxx or x

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

Number theory

[edit | edit source]

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 μ(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]

Complex numbers

[edit | edit source]

The exponential function ex may be written as a Taylor series[45][29]

ex=1+x1!+x22!+x33!+=n=0xnn!.

Because this series is convergent for every complex value of x, it is commonly used to extend the definition of ex to the complex numbers.[46] This, with the Taylor series for sin and cos x, allows one to derive Euler's formula:

eix=cosx+isinx,

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

eiπ+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]

ln(1)=iπ.

Furthermore, using the laws for exponentiation,

(cosx+isinx)n=(eix)n=einx=cosnx+isinnx

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

The expressions of sin(x) and cos(x) in terms of the exponential function can be deduced from the Taylor series:[46] cosx=eix+eix2,sinx=eixeix2i.

The expression cosx+isinx is sometimes abbreviated as cis(x).[49]

Entropy

[edit | edit source]

The constant e plays a distinguished role in the theory of entropy in probability theory and ergodic theory.[50] The basic idea is to consider a partition of a probability space into a finite number of measurable sets, ξ=(A1,,Ak), the entropy of which is the expected information gained regarding the probability distribution by performing a random sample (or "experiment"). The entropy of the partition is H(ξ)=i=1kp(Ai)lnp(Ai). The function f(x)=xlnx is thus of fundamental importance, representing the amount of entropy contributed by a particular element of the partition, x=p(Ai). This function is maximized when x=1/e. What this means, concretely, is that the entropy contribution of the particular event Ai is maximized when p(Ai)=1/e; outcomes that are either too likely or too rare contribute less to the total entropy.

Representations

[edit | edit source]

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

e=[2;1,2,1,1,4,1,1,6,1,...,1,2n,1,...],[51][52]

which written out looks like

e=2+11+12+11+11+14+11+11+.

The following infinite product evaluates to e:[26] e=21(43)1/2(6857)1/4(101214169111315)1/8.

Many other series, sequence, continued fraction, and infinite product representations of e have been proved.

Stochastic representations

[edit | edit source]

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 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 observations exceeds 1:

V=min{nX1+X2++Xn>1}.

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

Known digits

[edit | edit source]

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.[55][56]

Number of known decimal digits of e
Date Decimal digits Computation performed by
1690 1 Jacob Bernoulli[11]
1714 13 Roger Cotes[57]
1748 23 Leonhard Euler[58]
1853 137 William Shanks[59]
1871 205 William Shanks[60]
1884 346 J. Marcus Boorman[61]
1949 2,010 John von Neumann (on the ENIAC)
1961 100,265 Daniel Shanks and John Wrench[62]
1978 116,000 Steve Wozniak on the Apple II[63]

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 December 24, 2023, a record-setting calculation was made by Jordan Ranous, giving e to 35,000,000,000,000 digits.[64]

Computing the digits

[edit | edit source]

One way to compute the digits of e is with the series[65] e=k=01k!.

A faster method involves two recursive functions p(a,b) and q(a,b). The functions are defined as (p(a,b)q(a,b))={(1b),if b=a+1,(p(a,m)q(m,b)+p(m,b)q(a,m)q(m,b)),otherwise, where m=(a+b)/2.

The expression 1+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.[65]

In computer culture

[edit | edit source]

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

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.[67]

Google was also responsible for a billboard[68] 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.[69] Solving this problem and visiting the advertised (now defunct) website led to an even more difficult problem to solve, which consisted of 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.[70] Solving this second problem finally led to a Google Labs webpage where the visitor was invited to submit a résumé.[71]

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

In computing

[edit | edit source]

In scientific computing, the constant e is often hard-coded. For example, the Python standard library includes math.e = 2.718281828459045, a floating-point approximation of e. Despite this, it is generally more numerically stable and efficient to use the built-in exponential function—such as math.exp(x) in Python—rather than computing ex via pow(e, x), even when x is an integer.[73]

Most implementations of the exponential function use range reduction, lookup tables, and polynomial or rational approximations (such as Padé approximants or Taylor expansions) to achieve accurate results across a wide range of inputs.[74] In contrast, general-purpose exponentiation functions—like pow—may involve additional intermediate computations, such as logarithms and multiplications, and may accumulate more rounding error, particularly when e is used in floating-point form.[75]

At very high precision, methods based on elliptic functions and fast convergence of the AGM and Newton's method can be used to compute the exponential function.[76] The digit expansion of e can then be obtained as exp(1). Although this is asymptotically faster than other known methods for computing the exponential function, it is impractical because of high overhead cost.[74]

Tools such as y-cruncher are optimized for computing many digits of individual constants like e, and use the Taylor series for e because it converges very rapidly, especially when combined with various optimizations. In particular, the method of binary splitting applies to computing the series for e, as opposed to the series for exp(x), because the summands in the former series are simple rational numbers. This allows the complexity of computing n digits of e to be reduced to O(nlog2n), asymptotically the same as AGM methods, but much cheaper in practice.[77][78]

References

[edit | edit source]
  1. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  3. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  4. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). Extract of page 166
  5. ^ a b c d e Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  6. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  7. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  8. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  9. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value)..
  10. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  11. ^ a b 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 a & minus quam 3a." ( … which our series [a geometric series] is larger [than]. … if a=b, [the lender] will be owed more than 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.)
  12. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  13. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  14. ^ 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...")
  15. ^ 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) … )
  16. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  17. ^ 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 dcc=dydsrdx seu c=edydsrdx ubi e denotat numerum, cuius logarithmus hyperbolicus est 1. (So it [i.e., c, the speed] will be dcc=dydsrdx or c=edydsrdx, where e denotes the number whose hyperbolic [i.e., natural] logarithm is 1.)
  18. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). p. 124.
  19. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  20. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  21. ^ a b c Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  22. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  23. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  24. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  25. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  26. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  27. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  28. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  29. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  30. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  31. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  32. ^ A standard calculus exercise using the mean value theorem; see for example Apostol (1967) Calculus, § 6.17.41.
  33. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  34. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  35. ^ 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)
  36. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  37. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  38. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  39. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  40. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  41. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  42. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  43. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  44. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  45. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  46. ^ a b c d Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  47. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  48. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  49. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  50. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value)., §4.2.
  51. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  52. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  53. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  54. ^ Dinov, ID (2007) Estimating e using SOCR simulation Archived 2020-03-15 at the Wayback Machine, SOCR Hands-on Activities (retrieved December 26, 2007).
  55. ^ Sebah, P. and Gourdon, X.; The constant e and its computation
  56. ^ Gourdon, X.; Reported large computations with PiFast
  57. ^ 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, … )
  58. ^ Leonhard Euler, Introductio in Analysin Infinitorum (Lausanne, Switzerland: Marc Michel Bousquet & Co., 1748), volume 1, page 90.
  59. ^ William Shanks, Contributions to Mathematics, ... (London, England: G. Bell, 1853), page 89.
  60. ^ 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.
  61. ^ J. Marcus Boorman (October 1884) "Computation of the Naperian base," Mathematical Magazine, 1 (12) : 204–205.
  62. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  63. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  64. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  65. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  66. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  67. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  68. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  69. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  70. ^ The first 10-digit prime in e Archived 2021-04-11 at the Wayback Machine. Explore Portland Community. Retrieved on 2020-12-09.
  71. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  72. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  73. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  74. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  75. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  76. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  77. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  78. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).

Further reading

[edit | edit source]
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  • Commentary on Endnote 10 of the book Prime Obsession for another stochastic representation
  • Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
[edit | edit source]

Lua error in Module:Authority_control at line 153: attempt to index field 'wikibase' (a nil value).