{
  "id": "e-mathematical-constant",
  "title": "Euler’s Number",
  "lang": "en",
  "source_lang": "en",
  "summary": "Euler’s number, e, is the transcendental constant that serves as the base of natural logarithms and governs continuous exponential growth.",
  "category": "mathematics",
  "subcategory": "analysis",
  "type": "concept",
  "aliases": [
    "e",
    "Euler number",
    "Napier’s constant",
    "base of natural logarithms"
  ],
  "generated_at": "2026-11-02",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/e-mathematical-constant/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/e-mathematical-constant/",
      "json": "https://aiwiki.page/zh/e-mathematical-constant.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Euler’s number, denoted by \\(e\\), is the positive real number\n\n\\[e=2.7182818284590452353602874713527\\ldots\\]\n\nthat serves as the base of natural logarithms. Its defining importance is that the exponential function \\(e^x\\) has a rate of change equal to its own value. This property makes \\(e\\) fundamental to calculus, continuous growth and decay, and the mathematical description of processes whose instantaneous change is proportional to their current state.\n\nThe constant can be defined through a limit describing repeated compounding, an infinite series involving factorials, or the area under the curve \\(y=1/x\\). These definitions connect topics that initially appear unrelated: interest accumulation, differential equations, complex rotations, random events, and the counting of permutations. Named after Leonhard Euler, who established much of its notation and theory, \\(e\\) is irrational and transcendental. It is distinct from the Euler–Mascheroni constant, usually denoted by \\(\\gamma\\), and from the sequence of integers called the Euler numbers."
    },
    {
      "heading": "Equivalent definitions and basic properties",
      "text": "A standard definition of \\(e\\) uses the limit\n\n\\[e=\\lim_{n\\to\\infty}\\left(1+\\frac1n\\right)^n,\\]\n\nwhere \\(n\\) ranges over the positive integers. Each expression represents \\(n\\) successive multiplications by a factor slightly greater than one. Although each individual increment becomes smaller as \\(n\\) increases, their accumulated effect approaches a definite number rather than growing without bound. For example, the expressions for \\(n=1,2,\\) and \\(10\\) are \\(2\\), \\(2.25\\), and approximately \\(2.59374246\\).\n\nThe sequence in this definition increases toward \\(e\\). A companion sequence decreases toward the same limit, giving the useful bounds\n\n\\[\\left(1+\\frac1n\\right)^n <e< \\left(1+\\frac1n\\right)^{n+1} \\qquad(n\\geq1).\\]\n\nThese inequalities provide a direct way to bracket the constant. They also distinguish a limiting definition from a numerical approximation: no finite number of compounding steps produces \\(e\\) exactly.\n\nAn equivalent definition is the infinite series\n\n\\[e=\\sum_{k=0}^{\\infty}\\frac1{k!} =1+1+\\frac12+\\frac16+\\frac1{24}+\\cdots,\\]\n\nwhere \\(k!\\) denotes the factorial of \\(k\\), with \\(0!=1\\). The factorial denominators grow rapidly, so this series converges much faster than the compounding sequence. The equivalence follows by expanding \\((1+1/n)^n\\) with the binomial theorem. For each fixed \\(k\\), its \\(k\\)-th term approaches \\(1/k!\\); suitable bounds on the remaining terms justify passing to the infinite sum.\n\nA third definition starts with the integral\n\n\\[\\ln x=\\int_1^x\\frac{dt}{t},\\qquad x>0.\\]\n\nThe function \\(\\ln x\\) is continuous, strictly increasing, and ranges over all real values. Consequently, there is exactly one positive number \\(e\\) for which\n\n\\[\\int_1^e\\frac{dt}{t}=1.\\]\n\nGeometrically, the region under the rectangular hyperbola \\(y=1/x\\), above the horizontal axis, and between \\(x=1\\) and \\(x=e\\) has area one.\n\nThese definitions offer different starting points for developing the theory. The compounding limit emphasizes multiplicative accumulation; the series connects \\(e\\) to factorials and approximation; the integral explains the special role of natural logarithms. None requires taking a decimal expansion as fundamental. The decimal digits merely represent a number characterized exactly by any of these constructions."
    },
    {
      "heading": "Historical development and notation",
      "text": "The emergence of \\(e\\) was closely connected with the development of logarithms during the seventeenth century. John Napier published his logarithmic method in 1614, providing a powerful aid to astronomical and navigational calculation. His original logarithms used a scaling and a kinematic construction different from the modern function \\(\\ln x\\). Calling \\(e\\) “Napier’s constant” therefore reflects a historical association with logarithms rather than Napier’s explicit use of the modern constant and notation.\n\nAnother strand came from the quadrature of the hyperbola. In 1647, Grégoire de Saint-Vincent published work on areas associated with \\(y=1/x\\). The connection between these areas and logarithmic relationships was developed further by Alphonse Antonio de Sarasa. In modern language, equal multiplicative changes in the horizontal coordinate produce equal increments of hyperbolic area. This is the geometric basis of the identity \\(\\ln(ab)=\\ln a+\\ln b\\).\n\nJacob Bernoulli encountered the constant through compound interest in 1683. The question was whether dividing a fixed annual interest rate into ever more frequent compounding periods would make the final amount arbitrarily large. For an initial unit sum and a nominal annual rate of 100 percent, the limiting amount is instead \\(e\\). This problem exposed the constant without requiring logarithmic tables or the geometry of the hyperbola, revealing that the same number arises naturally from repeated small proportional changes.\n\nThe development of calculus by Isaac Newton and Gottfried Wilhelm Leibniz supplied a framework in which logarithms, infinite series, derivatives, and exponential functions could be treated together. Euler subsequently made the constant central to mathematical analysis. He used the letter \\(e\\) in work dating from the late 1720s, and it appeared in print in his Mechanica in 1736. His Introductio in analysin infinitorum, published in 1748, systematically developed exponential and logarithmic functions and their connections with trigonometry.\n\nThe reason Euler selected the letter \\(e\\) is not established by a definitive explanation from him; the notation should not automatically be interpreted as an abbreviation of his surname. Its widespread adoption reflected the influence and clarity of his mathematical writing. Euler also investigated the constant’s continued fraction and irrationality, while Charles Hermite’s proof of its transcendence in 1873 placed it within a much deeper classification of numbers. Thus the modern concept arose through several interacting traditions rather than through one isolated act of discovery."
    },
    {
      "heading": "Why the natural base is privileged in calculus",
      "text": "For a positive base \\(a\\), the function \\(a^x\\) satisfies\n\n\\[\\frac{d}{dx}a^x=(\\ln a)a^x.\\]\n\nThe multiplier \\(\\ln a\\) measures how the chosen base changes the scale of the exponent. Exactly when \\(a=e\\), this multiplier equals one. Consequently,\n\n\\[\\frac{d}{dx}e^x=e^x.\\]\n\nThis is the precise mathematical sense in which \\(e\\) is the natural base for exponential functions: differentiation introduces no additional constant.\n\nThe same property can be used as a definition. Consider the initial-value problem\n\n\\[f'(x)=f(x),\\qquad f(0)=1.\\]\n\nIts unique solution is \\(f(x)=e^x\\), and \\(e=f(1)\\). Uniqueness also explains the multiplication law\n\n\\[e^{x+y}=e^xe^y:\\]\n\nfor fixed \\(y\\), both sides, viewed as functions of \\(x\\), satisfy the same differential equation and agree at \\(x=0\\). Thus a local condition about instantaneous change determines a global rule for combining increments.\n\nThe logarithmic description supplies another route to the same result. By the fundamental theorem of calculus,\n\n\\[\\frac{d}{dx}\\ln x=\\frac1x.\\]\n\nThe inverse function of \\(\\ln x\\), denoted by \\(\\exp x\\), therefore has derivative equal to itself. The notation \\(\\exp x=e^x\\) extends ordinary integer powers first to rational exponents and then continuously to all real exponents. Every other positive base can be recovered through\n\n\\[a^x=e^{x\\ln a}.\\]\n\nThis identity separates the universal exponential function from a particular choice of logarithmic scale.\n\nThe Taylor series\n\n\\[e^x=\\sum_{n=0}^{\\infty}\\frac{x^n}{n!}\\]\n\nmakes the differential property especially transparent. Termwise differentiation reproduces the original series, and the series converges for every real or complex argument. It also gives\n\n\\[\\int e^x\\,dx=e^x+C, \\qquad \\frac{d}{dx}e^{g(x)}=g'(x)e^{g(x)},\\]\n\nthe second identity being an application of the chain rule.\n\nIn optimization, related properties explain the frequent appearance of \\(e\\). The derivative of \\(x^{1/x}\\), analyzed through its logarithm \\((\\ln x)/x\\), shows that this function reaches its maximum at \\(x=e\\) on the positive real axis. Meanwhile, \\(e^x\\) is strictly convex because its second derivative is positive. The tangent-line inequality\n\n\\[e^x\\geq1+x\\]\n\nholds for every real \\(x\\), with equality only at zero, and underlies many estimates in analysis and probability."
    },
    {
      "heading": "Continuous growth, decay, and dynamical models",
      "text": "The defining application of \\(e\\) is proportional change. If a quantity \\(Q(t)\\) changes at a constant rate relative to its current value, then it satisfies the differential equation\n\n\\[\\frac{dQ}{dt}=kQ.\\]\n\nFor initial value \\(Q(0)=Q_0\\), the solution is\n\n\\[Q(t)=Q_0e^{kt}.\\]\n\nPositive \\(k\\) produces growth, negative \\(k\\) produces decay, and \\(k=0\\) leaves the quantity unchanged. If \\(t\\) has physical units, \\(k\\) must have reciprocal units so that the exponent \\(kt\\) is dimensionless.\n\nCompound interest provides a discrete approximation to this law. At nominal annual rate \\(r\\), compounded \\(m\\) times per year, an initial principal \\(P\\) becomes\n\n\\[P\\left(1+\\frac rm\\right)^{mt}\\]\n\nafter \\(t\\) years, when the number of compounding periods is integral. In the continuous-compounding limit this becomes \\(Pe^{rt}\\). A nominal continuously compounded annual rate of 100 percent therefore multiplies the principal by \\(e\\), not by two. Conversely, a doubling over one time unit corresponds to a continuous rate of \\(\\ln2\\).\n\nThe characteristic times of growth and decay express the same relationship in more practical forms. For \\(k>0\\), the doubling time is\n\n\\[T_d=\\frac{\\ln2}{k}.\\]\n\nFor decay written as \\(Q(t)=Q_0e^{-\\lambda t}\\), the half-life is \\((\\ln2)/\\lambda\\), while the time constant \\(1/\\lambda\\) is the time required for the quantity to fall to \\(1/e\\) of its initial value. Radioactive decay and the discharge of an ideal resistor–capacitor circuit are standard examples, subject to the assumptions of constant decay probability and ideal circuit elements respectively.\n\nMany systems are exponential only over a limited range. A population subject to a fixed carrying capacity \\(K\\), for example, may be modeled by\n\n\\[\\frac{dN}{dt}=rN\\left(1-\\frac NK\\right).\\]\n\nIts solution contains \\(e^{-rt}\\), but the population itself approaches \\(K\\) rather than increasing exponentially forever. The exponential law also appears locally when a nonlinear system is approximated near an equilibrium.\n\nFor coupled linear systems, the scalar exponential generalizes to the matrix exponential,\n\n\\[e^{tA}=\\sum_{n=0}^{\\infty}\\frac{t^nA^n}{n!}.\\]\n\nIf \\(A\\) is a constant matrix, the solution of \\(\\mathbf{x}'=A\\mathbf{x}\\) is \\(e^{tA}\\mathbf{x}(0)\\). The eigenvalues of \\(A\\) determine growth, decay, and oscillation. The familiar scalar constant thus extends naturally to the evolution of interacting quantities in mechanics, electrical networks, and other linear dynamical models."
    },
    {
      "heading": "Complex exponentials and circular geometry",
      "text": "The exponential series converges for every complex number \\(z\\), giving\n\n\\[e^z=\\sum_{n=0}^{\\infty}\\frac{z^n}{n!}.\\]\n\nThis extension preserves the identity \\(e^{z+w}=e^ze^w\\) and makes the exponential an analytic function throughout the complex plane. Substituting \\(z=i\\theta\\), where \\(i^2=-1\\), separates the even and odd powers into the series for cosine and sine:\n\n\\[e^{i\\theta}=\\cos\\theta+i\\sin\\theta.\\]\n\nThis relationship is known as Euler’s formula.\n\nFor real \\(\\theta\\), the number \\(e^{i\\theta}\\) lies on the unit circle. Multiplication by it rotates a complex number through the angle \\(\\theta\\), measured in radians, without changing its magnitude. Thus the same exponential operation that describes growth along the real axis describes rotation along the imaginary axis. More generally,\n\n\\[e^{x+iy}=e^x(\\cos y+i\\sin y),\\]\n\nso the real part \\(x\\) controls magnitude while the imaginary part \\(y\\) controls angle.\n\nTaking \\(\\theta=\\pi\\), with \\pi denoting the circle constant, yields Euler’s identity,\n\n\\[e^{i\\pi}+1=0.\\]\n\nThe identity connects the exponential base, circular geometry, the imaginary unit, and the additive and multiplicative identities. Its importance is structural rather than merely numerical: it expresses the fact that a rotation through half a turn is multiplication by \\(-1\\).\n\nThe complex exponential is periodic:\n\n\\[e^{z+2\\pi i}=e^z.\\]\n\nIt never vanishes and maps the complex plane onto the nonzero complex numbers, but it is not one-to-one. Consequently, the complex logarithm cannot be defined as a single-valued continuous inverse on the entire punctured plane. A nonzero number with modulus \\(r\\) and argument \\(\\theta\\) has logarithmic values\n\n\\[\\ln r+i(\\theta+2\\pi k),\\qquad k\\in\\mathbb Z.\\]\n\nSingle-valued branches require a suitable restriction of the domain.\n\nComplex exponentials also organize oscillatory analysis. A sinusoidal signal can be expressed through \\(e^{i\\omega t}\\), and differentiation then corresponds to multiplication by \\(i\\omega\\). This converts many differential equations into algebraic relations between frequency components. Both Fourier series and the Fourier transform use these exponentials as their basic oscillatory functions. The connection between differentiation, rotation, and frequency is therefore not an isolated identity but a central organizing principle of mathematical physics and signal analysis."
    },
    {
      "heading": "Irrationality, transcendence, and unresolved arithmetic questions",
      "text": "The decimal expansion of \\(e\\) neither terminates nor eventually repeats because \\(e\\) is an irrational number. A short proof begins with its factorial series. Suppose that \\(e=p/q\\) for positive integers \\(p,q\\). Choose an integer \\(n\\geq\\max(q,2)\\). Then \\(n!e\\) is an integer, as is\n\n\\[n!\\sum_{k=0}^{n}\\frac1{k!}.\\]\n\nTheir difference must therefore be an integer.\n\nThat difference is the positive remainder\n\n\\[R_n=\\sum_{j=1}^{\\infty} \\frac1{(n+1)(n+2)\\cdots(n+j)}.\\]\n\nComparing each denominator with \\((n+1)^j\\) gives\n\n\\[0<R_n< \\sum_{j=1}^{\\infty}\\frac1{(n+1)^j} =\\frac1n<1.\\]\n\nA positive integer cannot be smaller than one, so the assumption that \\(e\\) is rational is impossible. The rapidly growing factorials make this argument unusually direct.\n\nEuler also established the regular continued fraction\n\n\\[e=[2;1,2,1,1,4,1,1,6,1,1,8,1,\\ldots].\\]\n\nAfter the initial \\(2\\), its partial quotients occur in triples \\(1,2k,1\\) for \\(k=1,2,\\ldots\\). The resulting convergents provide good rational approximations, including \\(19/7\\), \\(87/32\\), and \\(106/39\\). A simple pattern in the continued fraction is compatible with an apparently patternless decimal expansion because the two representations encode numbers differently.\n\nA stronger result is that \\(e\\) is a transcendental number: it is not a root of any nonzero polynomial with integer coefficients. Charles Hermite proved this in 1873 using carefully constructed approximations and integrals. His result was a landmark in transcendental number theory. Ferdinand von Lindemann’s subsequent work in 1882 established the transcendence of \\(\\pi\\) through related methods. Transcendence also implies that \\(e\\) cannot be constructed as a length from a unit segment using only a straightedge and compass.\n\nDespite these results, elementary-looking questions remain unanswered. It is not known whether \\(e+\\pi\\) or \\(e\\pi\\) is irrational. They cannot both be rational, because that would make \\(e\\) and \\(\\pi\\) roots of a quadratic polynomial with rational coefficients. It is also unknown whether \\(e\\) is a normal number in base ten, meaning that every finite block of digits occurs with its expected limiting frequency. Computed digits do not establish this property. The arithmetic behavior of a familiar constant can therefore remain difficult even when its analytic properties are exceptionally well understood."
    },
    {
      "heading": "Probability distributions and information measures",
      "text": "Euler’s number appears throughout probability because independent small effects often combine multiplicatively. Suppose each of \\(n\\) independent trials has success probability \\(\\lambda/n\\). The probability of no success is\n\n\\[\\left(1-\\frac{\\lambda}{n}\\right)^n,\\]\n\nwhich approaches \\(e^{-\\lambda}\\) as \\(n\\) grows. More generally, the number of successes approaches a Poisson distribution:\n\n\\[\\Pr(X=k)=e^{-\\lambda}\\frac{\\lambda^k}{k!}, \\qquad k=0,1,2,\\ldots.\\]\n\nThe factor \\(e^{-\\lambda}\\) makes the probabilities sum to one, since the remaining series sums to \\(e^\\lambda\\).\n\nIn a Poisson process with constant rate \\(\\lambda\\), the waiting time \\(T\\) to the next event follows an exponential distribution. Its survival probability and density are\n\n\\[\\Pr(T>t)=e^{-\\lambda t}, \\qquad f_T(t)=\\lambda e^{-\\lambda t} \\quad(t\\geq0).\\]\n\nThe defining memoryless property,\n\n\\[\\Pr(T>s+t\\mid T>s)=\\Pr(T>t),\\]\n\nfollows directly from the exponential multiplication law. It characterizes nonnegative, nondegenerate continuous waiting-time distributions with this property.\n\nThe normal distribution provides another prominent occurrence:\n\n\\[f(x)=\\frac1{\\sigma\\sqrt{2\\pi}} \\exp\\left(-\\frac{(x-\\mu)^2}{2\\sigma^2}\\right).\\]\n\nHere the exponential is applied to a negative quadratic rather than a linear expression. The normalizing constant follows from the Gaussian integral\n\n\\[\\int_{-\\infty}^{\\infty}e^{-x^2/2}\\,dx=\\sqrt{2\\pi}.\\]\n\nThe central limit theorem explains why such a density arises when many suitably controlled random contributions are added. Exponential waiting times and Gaussian fluctuations therefore use the same function for quite different probabilistic reasons.\n\nNatural logarithms also provide a standard scale in information theory. The entropy of a discrete distribution can be written\n\n\\[H=-\\sum_i p_i\\ln p_i.\\]\n\nWith this choice of base, information is measured in nats; base-two logarithms instead give bits. The choice changes the unit, not the underlying ordering or comparisons, since \\(\\log_2x=\\ln x/\\ln2\\). Natural logarithms are particularly convenient for differentiation and for exponential expressions involving probabilities.\n\nAn exact probabilistic appearance of the constant itself comes from independent uniform random variables \\(U_1,U_2,\\ldots\\) on \\([0,1]\\). Let \\(N\\) be the first index for which their sum exceeds one. The region where \\(U_1+\\cdots+U_n\\leq1\\) has volume \\(1/n!\\), so\n\n\\[\\Pr(N>n)=\\frac1{n!}.\\]\n\nThe tail-sum formula for expected value then gives\n\n\\[\\mathbb E[N]=\\sum_{n=0}^{\\infty}\\Pr(N>n)=e.\\]"
    },
    {
      "heading": "Counting, factorial growth, and asymptotic formulas",
      "text": "In combinatorics, \\(e\\) frequently arises through factorial denominators. A classical example is a derangement, a permutation with no fixed points. If \\(D_n\\) counts derangements of \\(n\\) labeled objects, the inclusion–exclusion principle gives\n\n\\[D_n=n!\\sum_{k=0}^{n}\\frac{(-1)^k}{k!}.\\]\n\nThere are \\(n!\\) permutations in total, so the probability that a uniformly selected permutation has no fixed points is \\(D_n/n!\\). As \\(n\\) tends to infinity, this probability approaches\n\n\\[\\sum_{k=0}^{\\infty}\\frac{(-1)^k}{k!}=e^{-1}.\\]\n\nThis limit has a simple matching interpretation. If letters are randomly placed into addressed envelopes, the chance that no letter reaches its correct envelope approaches \\(1/e\\), approximately \\(0.367879\\). The approximation is already accurate for fairly small \\(n\\). Indeed, the alternating-series remainder gives\n\n\\[\\left|D_n-\\frac{n!}{e}\\right|<\\frac1{n+1},\\]\n\nso for \\(n\\geq1\\), \\(D_n\\) is the nearest integer to \\(n!/e\\).\n\nThe exponential function also supplies the simplest example of an exponential generating function. A sequence \\(a_n\\) is encoded in the form\n\n\\[A(x)=\\sum_{n=0}^{\\infty}a_n\\frac{x^n}{n!}.\\]\n\nFor the sequence \\(a_n=1\\), this is \\(e^x\\). Factorial denominators are particularly suited to counting labeled structures, since products of such series automatically introduce the binomial coefficients needed to distribute labels between components. For example, the exponential generating function of set partitions is\n\n\\[\\exp(e^x-1).\\]\n\nThe inner series represents a nonempty labeled block, and the outer exponential organizes an unordered collection of such blocks.\n\nA second fundamental appearance is Stirling’s approximation:\n\n\\[n!\\sim\\sqrt{2\\pi n}\\left(\\frac ne\\right)^n.\\]\n\nThe notation means that the ratio of the two sides approaches one as \\(n\\) grows. The factor \\(e^{-n}\\) reflects the leading integral behavior\n\n\\[\\ln(n!)=\\sum_{k=1}^{n}\\ln k \\approx\\int_1^n\\ln x\\,dx =n\\ln n-n+1.\\]\n\nRecovering the factor \\(\\sqrt{2\\pi n}\\) requires a more refined argument.\n\nThese approximations connect counting with statistical information. If \\(k/n\\) approaches \\(p\\), where \\(0<p<1\\), Stirling’s formula gives\n\n\\[\\binom nk\\sim \\frac{\\exp\\!\\left(nh(k/n)\\right)} {\\sqrt{2\\pi n(k/n)(1-k/n)}},\\]\n\nwhere \\(h(u)=-u\\ln u-(1-u)\\ln(1-u)\\). Thus the entropy function controls the exponential growth of binomial coefficients. The constant \\(e\\) links exact counting formulas to smooth approximations that describe how rapidly large combinatorial families grow."
    },
    {
      "heading": "Numerical computation and reliable evaluation",
      "text": "The defining compounding limit is conceptually important but inefficient for computing digits. Expanding its logarithm gives\n\n\\[n\\ln\\left(1+\\frac1n\\right) =1-\\frac1{2n}+\\frac1{3n^2}-\\cdots,\\]\n\nand therefore\n\n\\[\\left(1+\\frac1n\\right)^n =e\\left(1-\\frac1{2n}+O(n^{-2})\\right).\\]\n\nIts leading relative error decreases only in proportion to \\(1/n\\). Multiplying the number of compounding periods by ten therefore produces roughly one additional decimal digit, an unfavorable rate for high-precision computation.\n\nThe factorial series is much more effective. Let\n\n\\[S_N=\\sum_{k=0}^{N}\\frac1{k!}.\\]\n\nFor \\(N\\geq1\\), the remainder satisfies\n\n\\[0<e-S_N<\\frac1{N\\,N!}.\\]\n\nThis follows by expressing the tail relative to \\(1/N!\\) and bounding its successive denominator factors by \\(N+1\\). The bound supplies a rigorous stopping rule: once the remaining interval lies wholly within a single rounding interval, the requested digits are certified.\n\nThe terms can be generated recursively, starting from \\(t_0=1\\) and using \\(t_{k+1}=t_k/(k+1)\\). This avoids repeatedly constructing factorials. With arbitrary-precision arithmetic, only a modest number of terms is needed for many digits because \\(N!\\) grows so rapidly. At much larger precisions, binary-splitting techniques group the rational terms into balanced combinations, reducing the cost of repeated large-integer arithmetic.\n\nComputing \\(e\\) itself is simpler than evaluating \\(e^x\\) reliably for every possible input. General-purpose exponential routines usually employ range reduction, writing\n\n\\[x=k\\ln2+r, \\qquad e^x=2^ke^r,\\]\n\nwith integer \\(k\\) chosen so that \\(r\\) is small. A polynomial or rational approximation then evaluates \\(e^r\\), and multiplication by \\(2^k\\) supplies the appropriate binary scale. The design must account for rounding errors, overflow, underflow, and the accuracy of the stored value of \\(\\ln2\\).\n\nIn floating-point arithmetic, evaluating \\(e^x-1\\) directly can lose relative accuracy when \\(x\\) is close to zero, because two nearly equal numbers are subtracted. Numerical libraries therefore commonly provide a specialized function, expm1, for this expression. Similarly, log1p evaluates \\(\\ln(1+x)\\) accurately for small \\(x\\). These functions illustrate the distinction between a mathematically correct formula and a numerically stable implementation.\n\nFinally, digit calculation and arithmetic classification answer different questions. Finite computations can verify specified digits and test their observed frequencies, but cannot prove normality or exclude a pattern beginning beyond the computed range. Certified numerical intervals establish approximations to \\(e\\); its irrationality, transcendence, and identities depend on arguments about the exact number."
    }
  ],
  "links": [
    "real-number",
    "logarithm",
    "exponential-function",
    "calculus",
    "leonhard-euler",
    "limit",
    "infinite-series",
    "factorial",
    "binomial-theorem",
    "integral",
    "gottfried-wilhelm-leibniz",
    "fundamental-theorem-of-calculus",
    "inverse-function",
    "taylor-series",
    "chain-rule",
    "mathematical-optimization",
    "differential-equation",
    "matrix",
    "eigenvalues-and-eigenvectors",
    "complex-number",
    "analytic-function",
    "eulers-formula",
    "circle",
    "pi",
    "fourier-series",
    "fourier-transform",
    "irrational-number",
    "continued-fraction",
    "rational-number",
    "transcendental-number",
    "polynomial",
    "probability",
    "poisson-distribution",
    "poisson-process",
    "exponential-distribution",
    "normal-distribution",
    "central-limit-theorem",
    "information-theory",
    "information-entropy",
    "expected-value",
    "combinatorics",
    "generating-function",
    "stirlings-approximation",
    "floating-point-arithmetic"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}