Euler's constant

Constant value used in mathematics From Wikipedia, the free encyclopedia

Euler's constant

Euler's constant (sometimes called the Euler–Mascheroni constant) is a mathematical constant, usually denoted by the lowercase Greek letter gamma (γ), defined as the limiting difference between the harmonic series and the natural logarithm, denoted here by log:

Quick Facts General information, Type ...
Euler's constant
γ
0.57721...[1]
General information
TypeUnknown
Fields
History
Discovered1734
ByLeonhard Euler
First mentionDe Progressionibus harmonicis observationes
Named after
Close
Thumb
The area of the blue region converges to Euler's constant.

Here, ⌊·⌋ represents the floor function.

The numerical value of Euler's constant, to 50 decimal places, is:[1]

0.57721566490153286060651209008240243104215933593992...

History

Summarize
Perspective

The constant first appeared in a 1734 paper by the Swiss mathematician Leonhard Euler, titled De Progressionibus harmonicis observationes (Eneström Index 43), where he described it as "worthy of serious consideration".[2][3] Euler initially calculated the constant's value to 6 decimal places. In 1781, he calculated it to 16 decimal places. Euler used the notations C and O for the constant. The Italian mathematician Lorenzo Mascheroni attempted to calculate the constant to 32 decimal places, but made errors in the 20th–22nd and 31st–32nd decimal places; starting from the 20th digit, he calculated ...1811209008239 when the correct value is ...0651209008240. In 1790, he used the notations A and a for the constant. Other computations were done by Johann von Soldner in 1809, who used the notation H. The notation γ appears nowhere in the writings of either Euler or Mascheroni, and was chosen at a later time, perhaps because of the constant's connection to the gamma function.[3] For example, the German mathematician Carl Anton Bretschneider used the notation γ in 1835,[4] and Augustus De Morgan used it in a textbook published in parts from 1836 to 1842.[5] Euler's constant was also studied by the Indian mathematician Srinivasa Ramanujan who published one paper on it in 1917.[6] David Hilbert mentioned the irrationality of γ as an unsolved problem that seems "unapproachable" and, allegedly, the English mathematician Godfrey Hardy offered to give up his Savilian Chair at Oxford to anyone who could prove this.[2]

Appearances

Summarize
Perspective

Euler's constant appears frequently in mathematics, especially in number theory and analysis.[7] Examples include, among others, the following places: (where '*' means that this entry contains an explicit equation):

Analysis

Number theory

In other fields

Properties

Summarize
Perspective

Irrationality and transcendence

The number γ has not been proved algebraic or transcendental. In fact, it is not even known whether γ is irrational. The ubiquity of γ revealed by the large number of equations below and the fact that γ has been called the third most important mathematical constant after π and e[38][12] makes the irrationality of γ a major open question in mathematics.[2][39][40][32]

Unsolved problem in mathematics
Is Euler's constant irrational? If so, is it transcendental?

However, some progress has been made. In 1959 Andrei Shidlovsky proved that at least one of Euler's constant γ and the Gompertz constant δ is irrational;[41][27] Tanguy Rivoal proved in 2012 that at least one of them is transcendental.[42] Kurt Mahler showed in 1968 that the number is transcendental, where and are the usual Bessel functions.[43][3] It is known that the transcendence degree of the field is at least two.[3]

In 2010, M. Ram Murty and N. Saradha showed that at most one of the Euler-Lehmer constants, i. e. the numbers of the form is algebraic, if q ≥ 2 and 1 ≤ a < q; this family includes the special case γ(2,4) = γ/4.[3][44]

Using the same approach, in 2013, M. Ram Murty and A. Zaytseva showed that the generalized Euler constants have the same property, [3][45] [46] where the generalized Euler constant are defined as where is a fixed list of prime numbers, if at least one of the primes in is a prime factor of , and otherwise. In particular, .

Using a continued fraction analysis, Papanikolaou showed in 1997 that if γ is rational, its denominator must be greater than 10244663.[47][48] If eγ is a rational number, then its denominator must be greater than 1015000.[3]

Euler's constant is conjectured not to be an algebraic period,[3] but the values of its first 109 decimal digits seem to indicate that it could be a normal number.[49]

Continued fraction

The simple continued fraction expansion of Euler's constant is given by:[50]

which has no apparent pattern. It is known to have at least 16,695,000,000 terms,[50] and it has infinitely many terms if and only if γ is irrational.

Thumb
The Khinchin limits for (red), (blue) and (green).

Numerical evidence suggests that both Euler's constant γ as well as the constant eγ are among the numbers for which the geometric mean of their simple continued fraction terms converges to Khinchin's constant. Similarly, when are the convergents of their respective continued fractions, the limit appears to converge to Lévy's constant in both cases.[51] However neither of these limits has been proven.[52]

There also exists a generalized continued fraction for Euler's constant.[53]

A good simple approximation of γ is given by the reciprocal of the square root of 3 or about 0.57735:[54]

with the difference being about 1 in 7,429.

Formulas and identities

Summarize
Perspective

Relation to gamma function

γ is related to the digamma function Ψ, and hence the derivative of the gamma function Γ, when both functions are evaluated at 1. Thus:

This is equal to the limits:

Further limit results are:[55]

A limit related to the beta function (expressed in terms of gamma functions) is

Relation to the zeta function

γ can also be expressed as an infinite sum whose terms involve the Riemann zeta function evaluated at positive integers:

The constant can also be expressed in terms of the sum of the reciprocals of non-trivial zeros of the zeta function:[56]

Other series related to the zeta function include:

The error term in the last equation is a rapidly decreasing function of n. As a result, the formula is well-suited for efficient computation of the constant to high precision.

Other interesting limits equaling Euler's constant are the antisymmetric limit:[57]

and the following formula, established in 1898 by de la Vallée-Poussin:

where   are ceiling brackets. This formula indicates that when taking any positive integer n and dividing it by each positive integer k less than n, the average fraction by which the quotient n/k falls short of the next integer tends to γ (rather than 0.5) as n tends to infinity.

Closely related to this is the rational zeta series expression. By taking separately the first few terms of the series above, one obtains an estimate for the classical series limit:

where ζ(s, k) is the Hurwitz zeta function. The sum in this equation involves the harmonic numbers, Hn. Expanding some of the terms in the Hurwitz zeta function gives:

where 0 < ε < 1/252n6.

γ can also be expressed as follows where A is the Glaisher–Kinkelin constant:

γ can also be expressed as follows, which can be proven by expressing the zeta function as a Laurent series:

Relation to triangular numbers

Numerous formulations have been derived that express in terms of sums and logarithms of triangular numbers.[58][59][60][61] One of the earliest of these is a formula[62][63] for the th harmonic number attributed to Srinivasa Ramanujan where is related to in a series that considers the powers of (an earlier, less-generalizable proof[64][65] by Ernesto Cesàro gives the first two terms of the series, with an error term):

From Stirling's approximation[58][66] follows a similar series:

The series of inverse triangular numbers also features in the study of the Basel problem[67][68] posed by Pietro Mengoli. Mengoli proved that , a result Jacob Bernoulli later used to estimate the value of , placing it between and . This identity appears in a formula used by Bernhard Riemann to compute roots of the zeta function,[69] where is expressed in terms of the sum of roots plus the difference between Boya's expansion and the series of exact unit fractions :

Integrals

γ equals the value of a number of definite integrals:

where Hx is the fractional harmonic number, and is the fractional part of .

The third formula in the integral list can be proved in the following way:

The integral on the second line of the equation is the definition of the Riemann zeta function, which is m!ζ(m + 1).

Definite integrals in which γ appears include:[2][13]

We also have Catalan's 1875 integral[70]

One can express γ using a special case of Hadjicostas's formula as a double integral[40][71] with equivalent series:

An interesting comparison by Sondow[71] is the double integral and alternating series

It shows that log 4/π may be thought of as an "alternating Euler constant".

The two constants are also related by the pair of series[72]

where N1(n) and N0(n) are the number of 1s and 0s, respectively, in the base 2 expansion of n.

Series expansions

In general,

for any α > −n. However, the rate of convergence of this expansion depends significantly on α. In particular, γn(1/2) exhibits much more rapid convergence than the conventional expansion γn(0).[73][74] This is because

while

Even so, there exist other series expansions which converge more rapidly than this; some of these are discussed below.

Euler showed that the following infinite series approaches γ:

The series for γ is equivalent to a series Nielsen found in 1897:[55][75]

In 1910, Vacca found the closely related series[76][77][78][79][80][55][81]

where log2 is the logarithm to base 2 and   is the floor function.

This can be generalized to:[82]

where:

In 1926 Vacca found a second series:

From the MalmstenKummer expansion for the logarithm of the gamma function[13] we get:

Ramanujan, in his lost notebook gave a series that approaches γ[83]:

An important expansion for Euler's constant is due to Fontana and Mascheroni

where Gn are Gregory coefficients.[55][81][84] This series is the special case k = 1 of the expansions

convergent for k = 1, 2, ...

A similar series with the Cauchy numbers of the second kind Cn is[81][85]

Blagouchine (2018) found an interesting generalisation of the Fontana–Mascheroni series

where ψn(a) are the Bernoulli polynomials of the second kind, which are defined by the generating function

For any rational a this series contains rational terms only. For example, at a = 1, it becomes[86][87]

Other series with the same polynomials include these examples:

and

where Γ(a) is the gamma function.[84]

A series related to the Akiyama–Tanigawa algorithm is

where Gn(2) are the Gregory coefficients of the second order.[84]

As a series of prime numbers:

Asymptotic expansions

γ equals the following asymptotic formulas (where Hn is the nth harmonic number):

  • (Euler)
  • (Negoi)
  • (Cesàro)

The third formula is also called the Ramanujan expansion.

Alabdulmohsin derived closed-form expressions for the sums of errors of these approximations.[85] He showed that (Theorem A.1):

Exponential

The constant eγ is important in number theory. Its numerical value is:[88]

1.78107241799019798523650410310717954916964521430343....

eγ equals the following limit, where pn is the nth prime number:

This restates the third of Mertens' theorems.[89]

We further have the following product involving the three constants e, π and γ:[29]

Other infinite products relating to eγ include:

These products result from the Barnes G-function.

In addition,

where the nth factor is the (n + 1)th root of

This infinite product, first discovered by Ser in 1926, was rediscovered by Sondow using hypergeometric functions.[90]

It also holds that[91]

Published digits

More information Date, Decimal digits ...
Published decimal expansions of γ
DateDecimal digitsAuthorSources
17345Leonhard Euler[3]
173515Leonhard Euler[3]
178116Leonhard Euler[3]
179032Lorenzo Mascheroni, with 20–22 and 31–32 wrong[3]
180922Johann G. von Soldner[3]
181122Carl Friedrich Gauss[3]
181240Friedrich Bernhard Gottfried Nicolai[3]
186141Ludwig Oettinger[92]
186749William Shanks[93]
1871100James W.L. Glaisher[3]
1877263J. C. Adams[3]
1952328John William Wrench Jr.[3]
19611050Helmut Fischer and Karl Zeller[94]
19621271Donald Knuth[95]
19633566Dura W. Sweeney[96]
19734879William A. Beyer and Michael S. Waterman[97]
197720700Richard P. Brent[51]
198030100Richard P. Brent & Edwin M. McMillan[98]
1993172000Jonathan Borwein[99]
19971000000Thomas Papanikolaou[99]
19987286255Xavier Gourdon[99]
1999108000000Patrick Demichel and Xavier Gourdon[99]
March 13, 200929844489545Alexander J. Yee & Raymond Chan[100][101]
December 22, 2013119377958182Alexander J. Yee[101]
March 15, 2016160000000000Peter Trueb[101]
May 18, 2016250000000000Ron Watkins[101]
August 23, 2017477511832674Ron Watkins[101]
May 26, 2020600000000100Seungmin Kim & Ian Cutress[101][102]
May 13, 2023700000000000Jordan Ranous & Kevin O'Brien[101]
September 7, 20231337000000000Andrew Sun[101]
Close

Generalizations

Summarize
Perspective

Stieltjes constants

Thumb
Euler's generalized constants abm(-) for α > 0.

Euler's generalized constants are given by

for 0 < α < 1, with γ as the special case α = 1.[103] Extending for α > 1 gives:

with again the limit:

This can be further generalized to

for some arbitrary decreasing function f. Setting

gives rise to the Stieltjes constants , that occur in the Laurent series expansion of the Riemann zeta function:

with

n approximate value of γn OEIS
0 +0.5772156649015 A001620
1 −0.0728158454836 A082633
2 −0.0096903631928 A086279
3 +0.0020538344203 A086280
4 +0.0023253700654 A086281
100 −4.2534015717080 × 1017
1000 −1.5709538442047 × 10486

Euler-Lehmer constants

Euler–Lehmer constants are given by summation of inverses of numbers in a common modulo class:[44]

The basic properties are

and if the greatest common divisor gcd(a,q) = d then

Masser-Gramain constant

A two-dimensional generalization of Euler's constant is the Masser-Gramain constant. It is defined as the following limiting difference:[104]

where is the smallest radius of a disk in the complex plane containing at least Gaussian integers.

The following bounds have been established: .[105]

See also

References

Further reading

Loading related searches...

Wikiwand - on

Seamless Wikipedia browsing. On steroids.