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:

$${\displaystyle {\begin{aligned}\gamma &=\lim _{n\to \infty }\left(-\log n+\sum _{k=1}^{n}{\frac {1}{k}}\right)\\[5px]&=\int _{1}^{\infty }\left(-{\frac {1}{x}}+{\frac {1}{\lfloor x\rfloor }}\right)\,\mathrm {d} x.\end{aligned}}}$$

Here, ⌊·⌋ represents the floor function.

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

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". 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. For example, the German mathematician Carl Anton Bretschneider used the notation γ in 1835, and Augustus De Morgan used it in a textbook published in parts from 1836 to 1842. Euler's constant was also studied by the Indian mathematician Srinivasa Ramanujan who published one paper on it in 1917. 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.

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

• The Weierstrass product formula for the gamma function and the Barnes G-function.
• The asymptotic expansion of the gamma function, ${\displaystyle \Gamma (1/x)\sim x-\gamma }$.
• Evaluations of the digamma function at rational values.
• The Laurent series expansion for the Riemann zeta function*, where it is the first of the Stieltjes constants.
• Values of the derivative of the Riemann zeta function and Dirichlet beta function.
• In connection to the Laplace and Mellin transform.
• In the regularization/renormalization of the harmonic series as a finite value.
• Expressions involving the exponential and logarithmic integral.*
• A definition of the cosine integral.*
• In relation to Bessel functions.
• Asymptotic expansions of modified Struve functions.
• In relation to other special functions.

• An inequality for Euler's totient function.
• The growth rate of the divisor function.
• A formulation of the Riemann hypothesis.
• The third of Mertens' theorems.*
• The calculation of the Meissel–Mertens constant.
• Lower bounds to specific prime gaps.
• An approximation of the average number of divisors of all numbers from 1 to a given n.
• The Lenstra–Pomerance–Wagstaff conjecture on the frequency of Mersenne primes.
• An estimation of the efficiency of the euclidean algorithm.
• Sums involving the Möbius and von Mangolt function.
• Estimate of the divisor summatory function of the Dirichlet hyperbola method.

• In some formulations of Zipf's law.
• The answer to the coupon collector's problem.*
• The mean of the Gumbel distribution.
• An approximation of the Landau distribution.
• The information entropy of the Weibull and Lévy distributions, and, implicitly, of the chi-squared distribution for one or two degrees of freedom.
• An upper bound on Shannon entropy in quantum information theory.
• In dimensional regularization of Feynman diagrams in quantum field theory.
• In the BCS equation on the critical temperature in BCS theory of superconductivity.*
• Fisher–Orr model for genetics of adaptation in evolutionary biology.

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 makes the irrationality of γ a major open question in mathematics.

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; Tanguy Rivoal proved in 2012 that at least one of them is transcendental. Kurt Mahler showed in 1968 that the number ${\textstyle {\frac {\pi }{2}}{\frac {Y_{0}(2)}{J_{0}(2)}}-\gamma }$is transcendental, where ${\displaystyle J_{0}}$and ${\displaystyle Y_{0}}$are the usual Bessel functions. It is known that the transcendence degree of the field ${\displaystyle \mathbb {Q} (e,\gamma ,\delta )}$is at least two.

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 $${\displaystyle \gamma (a,q)=\lim _{n\rightarrow \infty }\left(-{\frac {\log {(a+nq})}{q}}+\sum _{k=0}^{n}{\frac {1}{a+kq}}\right)}$$is algebraic, if q ≥ 2 and 1 ≤ a < q; this family includes the special case γ(2,4) = γ/4.

Using the same approach, in 2013, M. Ram Murty and A. Zaytseva showed that the generalized Euler constants have the same property, where the generalized Euler constant are defined as $${\displaystyle \gamma (\Omega )=\lim _{x\rightarrow \infty }\left(\sum _{n=1}^{x}{\frac {1_{\Omega }(n)}{n}}-\log x\cdot \lim _{x\rightarrow \infty }{\frac {\sum _{n=1}^{x}1_{\Omega }(n)}{x}}\right),}$$where ⁠${\displaystyle \Omega }$⁠ is a fixed list of prime numbers, ${\displaystyle 1_{\Omega }(n)=0}$if at least one of the primes in ⁠${\displaystyle \Omega }$⁠ is a prime factor of ⁠${\displaystyle n}$⁠, and ${\displaystyle 1_{\Omega }(n)=1}$otherwise. In particular, ⁠${\displaystyle \gamma (\emptyset )=\gamma }$⁠.

Using a continued fraction analysis, Papanikolaou showed in 1997 that if γ is rational, its denominator must be greater than 10²⁴⁴⁶⁶³. If e^γ is a rational number, then its denominator must be greater than 10¹⁵⁰⁰⁰.

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

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

${\displaystyle \gamma =0+{\cfrac {1}{1+{\cfrac {1}{1+{\cfrac {1}{2+{\cfrac {1}{1+{\cfrac {1}{2+{\cfrac {1}{1+{\cfrac {1}{4+\dots }}}}}}}}}}}}}}}$

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

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 ${\displaystyle p_{n}/q_{n}}$are the convergents of their respective continued fractions, the limit ${\displaystyle \lim _{n\to \infty }q_{n}^{1/n}}$appears to converge to Lévy's constant in both cases. However neither of these limits has been proven.

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

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

${\displaystyle {\frac {1}{\sqrt {3}}}=0+{\cfrac {1}{1+{\cfrac {1}{1+{\cfrac {1}{2+{\cfrac {1}{1+{\cfrac {1}{2+{\cfrac {1}{1+{\cfrac {1}{2+\dots }}}}}}}}}}}}}}}$

with the difference being about 1 in 7,429.

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

$${\displaystyle -\gamma =\Gamma '(1)=\Psi (1).}$$

This is equal to the limits:

$${\displaystyle {\begin{aligned}-\gamma &=\lim _{z\to 0}\left(\Gamma (z)-{\frac {1}{z}}\right)\\&=\lim _{z\to 0}\left(\Psi (z)+{\frac {1}{z}}\right).\end{aligned}}}$$

Further limit results are:

$${\displaystyle {\begin{aligned}\lim _{z\to 0}{\frac {1}{z}}\left({\frac {1}{\Gamma (1+z)}}-{\frac {1}{\Gamma (1-z)}}\right)&=2\gamma \\\lim _{z\to 0}{\frac {1}{z}}\left({\frac {1}{\Psi (1-z)}}-{\frac {1}{\Psi (1+z)}}\right)&={\frac {\pi ^{2}}{3\gamma ^{2}}}.\end{aligned}}}$$

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

$${\displaystyle {\begin{aligned}\gamma &=\lim _{n\to \infty }\left({\frac {\Gamma \left({\frac {1}{n}}\right)\Gamma (n+1)\,n^{1+{\frac {1}{n}}}}{\Gamma \left(2+n+{\frac {1}{n}}\right)}}-{\frac {n^{2}}{n+1}}\right)\\&=\lim \limits _{m\to \infty }\sum _{k=1}^{m}{m \choose k}{\frac {(-1)^{k}}{k}}\log {\big (}\Gamma (k+1){\big )}.\end{aligned}}}$$

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

$${\displaystyle {\begin{aligned}\gamma &=\sum _{m=2}^{\infty }(-1)^{m}{\frac {\zeta (m)}{m}}\\&=\log {\frac {4}{\pi }}+\sum _{m=2}^{\infty }(-1)^{m}{\frac {\zeta (m)}{2^{m-1}m}}.\end{aligned}}}$$The constant ${\displaystyle \gamma }$can also be expressed in terms of the sum of the reciprocals of non-trivial zeros ${\displaystyle \rho }$of the zeta function:

${\displaystyle \gamma =\log 4\pi +\sum _{\rho }{\frac {2}{\rho }}-2}$

Other series related to the zeta function include:

$${\displaystyle {\begin{aligned}\gamma &={\tfrac {3}{2}}-\log 2-\sum _{m=2}^{\infty }(-1)^{m}\,{\frac {m-1}{m}}{\big (}\zeta (m)-1{\big )}\\&=\lim _{n\to \infty }\left({\frac {2n-1}{2n}}-\log n+\sum _{k=2}^{n}\left({\frac {1}{k}}-{\frac {\zeta (1-k)}{n^{k}}}\right)\right)\\&=\lim _{n\to \infty }\left({\frac {2^{n}}{e^{2^{n}}}}\sum _{m=0}^{\infty }{\frac {2^{mn}}{(m+1)!}}\sum _{t=0}^{m}{\frac {1}{t+1}}-n\log 2+O\left({\frac {1}{2^{n}\,e^{2^{n}}}}\right)\right).\end{aligned}}}$$

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:

$${\displaystyle {\begin{aligned}\gamma &=\lim _{s\to 1^{+}}\sum _{n=1}^{\infty }\left({\frac {1}{n^{s}}}-{\frac {1}{s^{n}}}\right)\\&=\lim _{s\to 1}\left(\zeta (s)-{\frac {1}{s-1}}\right)\\&=\lim _{s\to 0}{\frac {\zeta (1+s)+\zeta (1-s)}{2}}\end{aligned}}}$$

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

$${\displaystyle \gamma =\lim _{n\to \infty }{\frac {1}{n}}\,\sum _{k=1}^{n}\left(\left\lceil {\frac {n}{k}}\right\rceil -{\frac {n}{k}}\right)}$$

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:

$${\displaystyle \gamma =\lim _{n\to \infty }\left(\sum _{k=1}^{n}{\frac {1}{k}}-\log n-\sum _{m=2}^{\infty }{\frac {\zeta (m,n+1)}{m}}\right),}$$

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

$${\displaystyle H_{n}=\log(n)+\gamma +{\frac {1}{2n}}-{\frac {1}{12n^{2}}}+{\frac {1}{120n^{4}}}-\varepsilon ,}$$where 0 < ε <⁠1/252n⁶⁠.

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

$${\displaystyle \gamma =12\,\log(A)-\log(2\pi )+{\frac {6}{\pi ^{2}}}\,\zeta '(2)}$$

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

$${\displaystyle \gamma =\lim _{n\to \infty }\left(-n+\zeta \left({\frac {n+1}{n}}\right)\right)}$$

Numerous formulations have been derived that express ${\displaystyle \gamma }$in terms of sums and logarithms of triangular numbers. One of the earliest of these is a formula for the ${\displaystyle n}$th harmonic number attributed to Srinivasa Ramanujan where ${\displaystyle \gamma }$is related to ${\displaystyle \textstyle \ln 2T_{k}}$in a series that considers the powers of ${\displaystyle \textstyle {\frac {1}{T_{k}}}}$(an earlier, less-generalizable proof by Ernesto Cesàro gives the first two terms of the series, with an error term):

${\displaystyle {\begin{aligned}\gamma &=H_{u}-{\frac {1}{2}}\ln 2T_{u}-\sum _{k=1}^{v}{\frac {R(k)}{T_{u}^{k}}}-\Theta _{v}\,{\frac {R(v+1)}{T_{u}^{v+1}}}\end{aligned}}}$

From Stirling's approximation follows a similar series:

${\displaystyle \gamma =\ln 2\pi -\sum _{k=2}^{\infty }{\frac {\zeta (k)}{T_{k}}}}$

The series of inverse triangular numbers also features in the study of the Basel problem posed by Pietro Mengoli. Mengoli proved that ${\displaystyle \textstyle \sum _{k=1}^{\infty }{\frac {1}{2T_{k}}}=1}$, a result Jacob Bernoulli later used to estimate the value of ${\displaystyle \zeta (2)}$, placing it between ${\displaystyle 1}$and ${\displaystyle \textstyle \sum _{k=1}^{\infty }{\frac {2}{2T_{k}}}=\sum _{k=1}^{\infty }{\frac {1}{T_{k}}}=2}$. This identity appears in a formula used by Bernhard Riemann to compute roots of the zeta function, where ${\displaystyle \gamma }$is expressed in terms of the sum of roots ${\displaystyle \rho }$plus the difference between Boya's expansion and the series of exact unit fractions ${\displaystyle \textstyle \sum _{k=1}^{\infty }{\frac {1}{T_{k}}}}$:

${\displaystyle \gamma -\ln 2=\ln 2\pi +\sum _{\rho }{\frac {2}{\rho }}-\sum _{k=1}^{\infty }{\frac {1}{T_{k}}}}$

γ equals the value of a number of definite integrals:

$${\displaystyle {\begin{aligned}\gamma &=-\int _{0}^{\infty }e^{-x}\log x\,dx\\&=-\int _{0}^{1}\log \left(\log {\frac {1}{x}}\right)dx\\&=\int _{0}^{\infty }\left({\frac {1}{e^{x}-1}}-{\frac {1}{x\cdot e^{x}}}\right)dx\\&=\int _{0}^{1}{\frac {1-e^{-x}}{x}}\,dx-\int _{1}^{\infty }{\frac {e^{-x}}{x}}\,dx\\&=\int _{0}^{1}\left({\frac {1}{\log x}}+{\frac {1}{1-x}}\right)dx\\&=\int _{0}^{\infty }\left({\frac {1}{1+x^{k}}}-e^{-x}\right){\frac {dx}{x}},\quad k>0\\&=2\int _{0}^{\infty }{\frac {e^{-x^{2}}-e^{-x}}{x}}\,dx,\\&=\log {\frac {\pi }{4}}-\int _{0}^{\infty }{\frac {\log x}{\cosh ^{2}x}}\,dx,\\&=\int _{0}^{1}H_{x}\,dx,\\&={\frac {1}{2}}+\int _{0}^{\infty }\log \left(1+{\frac {\log \left(1+{\frac {1}{t}}\right)^{2}}{4\pi ^{2}}}\right)dt\\&=1-\int _{0}^{1}\{1/x\}dx\end{aligned}}}$$where H_x is the fractional harmonic number, and ${\displaystyle \{1/x\}}$is the fractional part of ${\displaystyle 1/x}$.

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

$${\displaystyle {\begin{aligned}&\int _{0}^{\infty }\left({\frac {1}{e^{x}-1}}-{\frac {1}{xe^{x}}}\right)dx=\int _{0}^{\infty }{\frac {e^{-x}+x-1}{x[e^{x}-1]}}dx=\int _{0}^{\infty }{\frac {1}{x[e^{x}-1]}}\sum _{m=1}^{\infty }{\frac {(-1)^{m+1}x^{m+1}}{(m+1)!}}dx\\[2pt]&=\int _{0}^{\infty }\sum _{m=1}^{\infty }{\frac {(-1)^{m+1}x^{m}}{(m+1)![e^{x}-1]}}dx=\sum _{m=1}^{\infty }\int _{0}^{\infty }{\frac {(-1)^{m+1}x^{m}}{(m+1)![e^{x}-1]}}dx=\sum _{m=1}^{\infty }{\frac {(-1)^{m+1}}{(m+1)!}}\int _{0}^{\infty }{\frac {x^{m}}{e^{x}-1}}dx\\[2pt]&=\sum _{m=1}^{\infty }{\frac {(-1)^{m+1}}{(m+1)!}}m!\zeta (m+1)=\sum _{m=1}^{\infty }{\frac {(-1)^{m+1}}{m+1}}\zeta (m+1)=\sum _{m=1}^{\infty }{\frac {(-1)^{m+1}}{m+1}}\sum _{n=1}^{\infty }{\frac {1}{n^{m+1}}}=\sum _{m=1}^{\infty }\sum _{n=1}^{\infty }{\frac {(-1)^{m+1}}{m+1}}{\frac {1}{n^{m+1}}}\\[2pt]&=\sum _{n=1}^{\infty }\sum _{m=1}^{\infty }{\frac {(-1)^{m+1}}{m+1}}{\frac {1}{n^{m+1}}}=\sum _{n=1}^{\infty }\left[{\frac {1}{n}}-\log \left(1+{\frac {1}{n}}\right)\right]=\gamma \end{aligned}}}$$

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:

$${\displaystyle {\begin{aligned}\int _{0}^{\infty }e^{-x^{2}}\log x\,dx&=-{\frac {(\gamma +2\log 2){\sqrt {\pi }}}{4}}\\\int _{0}^{\infty }e^{-x}\log ^{2}x\,dx&=\gamma ^{2}+{\frac {\pi ^{2}}{6}}\\\int _{0}^{\infty }{\frac {e^{-x}\log x}{e^{x}+1}}\,dx&={\frac {1}{2}}\log ^{2}2-\gamma \end{aligned}}}$$

We also have Catalan's 1875 integral

$${\displaystyle \gamma =\int _{0}^{1}\left({\frac {1}{1+x}}\sum _{n=1}^{\infty }x^{2^{n}-1}\right)\,dx.}$$

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

$${\displaystyle {\begin{aligned}\gamma &=\int _{0}^{1}\int _{0}^{1}{\frac {x-1}{(1-xy)\log xy}}\,dx\,dy\\&=\sum _{n=1}^{\infty }\left({\frac {1}{n}}-\log {\frac {n+1}{n}}\right).\end{aligned}}}$$

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

$${\displaystyle {\begin{aligned}\log {\frac {4}{\pi }}&=\int _{0}^{1}\int _{0}^{1}{\frac {x-1}{(1+xy)\log xy}}\,dx\,dy\\&=\sum _{n=1}^{\infty }\left((-1)^{n-1}\left({\frac {1}{n}}-\log {\frac {n+1}{n}}\right)\right).\end{aligned}}}$$

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

$${\displaystyle {\begin{aligned}\gamma &=\sum _{n=1}^{\infty }{\frac {N_{1}(n)+N_{0}(n)}{2n(2n+1)}}\\\log {\frac {4}{\pi }}&=\sum _{n=1}^{\infty }{\frac {N_{1}(n)-N_{0}(n)}{2n(2n+1)}},\end{aligned}}}$$

where N₁(n) and N₀(n) are the number of 1s and 0s, respectively, in the base 2 expansion of n.

In general,

$${\displaystyle \gamma =\lim _{n\to \infty }\left({\frac {1}{1}}+{\frac {1}{2}}+{\frac {1}{3}}+\ldots +{\frac {1}{n}}-\log(n+\alpha )\right)\equiv \lim _{n\to \infty }\gamma _{n}(\alpha )}$$

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). This is because

$${\displaystyle {\frac {1}{2(n+1)}}<\gamma _{n}(0)-\gamma <{\frac {1}{2n}},}$$

while

$${\displaystyle {\frac {1}{24(n+1)^{2}}}<\gamma _{n}(1/2)-\gamma <{\frac {1}{24n^{2}}}.}$$

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 γ: $${\displaystyle \gamma =\sum _{k=1}^{\infty }\left({\frac {1}{k}}-\log \left(1+{\frac {1}{k}}\right)\right).}$$

The series for γ is equivalent to a series Nielsen found in 1897:

$${\displaystyle \gamma =1-\sum _{k=2}^{\infty }(-1)^{k}{\frac {\left\lfloor \log _{2}k\right\rfloor }{k+1}}.}$$

In 1910, Vacca found the closely related series

$${\displaystyle {\begin{aligned}\gamma &=\sum _{k=1}^{\infty }(-1)^{k}{\frac {\left\lfloor \log _{2}k\right\rfloor }{k}}\\[5pt]&={\tfrac {1}{2}}-{\tfrac {1}{3}}+2\left({\tfrac {1}{4}}-{\tfrac {1}{5}}+{\tfrac {1}{6}}-{\tfrac {1}{7}}\right)+3\left({\tfrac {1}{8}}-{\tfrac {1}{9}}+{\tfrac {1}{10}}-{\tfrac {1}{11}}+\cdots -{\tfrac {1}{15}}\right)+\cdots ,\end{aligned}}}$$

where log₂ is the logarithm to base 2 and ⌊ ⌋ is the floor function.

This can be generalized to:

$${\displaystyle \gamma =\sum _{k=1}^{\infty }{\frac {\left\lfloor \log _{B}k\right\rfloor }{k}}\varepsilon (k)}$$where:$${\displaystyle \varepsilon (k)={\begin{cases}B-1,&{\text{if }}B\mid n\\-1,&{\text{if }}B\nmid n\end{cases}}}$$

In 1926 Vacca found a second series:

$${\displaystyle {\begin{aligned}\gamma +\zeta (2)&=\sum _{k=2}^{\infty }\left({\frac {1}{\left\lfloor {\sqrt {k}}\right\rfloor ^{2}}}-{\frac {1}{k}}\right)\\[5pt]&=\sum _{k=2}^{\infty }{\frac {k-\left\lfloor {\sqrt {k}}\right\rfloor ^{2}}{k\left\lfloor {\sqrt {k}}\right\rfloor ^{2}}}\\[5pt]&={\frac {1}{2}}+{\frac {2}{3}}+{\frac {1}{2^{2}}}\sum _{k=1}^{2\cdot 2}{\frac {k}{k+2^{2}}}+{\frac {1}{3^{2}}}\sum _{k=1}^{3\cdot 2}{\frac {k}{k+3^{2}}}+\cdots \end{aligned}}}$$

From the Malmsten–Kummer expansion for the logarithm of the gamma function we get:

$${\displaystyle \gamma =\log \pi -4\log \left(\Gamma ({\tfrac {3}{4}})\right)+{\frac {4}{\pi }}\sum _{k=1}^{\infty }(-1)^{k+1}{\frac {\log(2k+1)}{2k+1}}.}$$

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

$${\displaystyle \gamma =\log 2-\sum _{n=1}^{\infty }\sum _{k={\frac {3^{n-1}+1}{2}}}^{\frac {3^{n}-1}{2}}{\frac {2n}{(3k)^{3}-3k}}}$$

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

$${\displaystyle \gamma =\sum _{n=1}^{\infty }{\frac {|G_{n}|}{n}}={\frac {1}{2}}+{\frac {1}{24}}+{\frac {1}{72}}+{\frac {19}{2880}}+{\frac {3}{800}}+\cdots ,}$$where G_n are Gregory coefficients. This series is the special case k = 1 of the expansions

$${\displaystyle {\begin{aligned}\gamma &=H_{k-1}-\log k+\sum _{n=1}^{\infty }{\frac {(n-1)!|G_{n}|}{k(k+1)\cdots (k+n-1)}}&&\\&=H_{k-1}-\log k+{\frac {1}{2k}}+{\frac {1}{12k(k+1)}}+{\frac {1}{12k(k+1)(k+2)}}+{\frac {19}{120k(k+1)(k+2)(k+3)}}+\cdots &&\end{aligned}}}$$

convergent for k = 1, 2, ...

A similar series with the Cauchy numbers of the second kind C_n is

$${\displaystyle \gamma =1-\sum _{n=1}^{\infty }{\frac {C_{n}}{n\,(n+1)!}}=1-{\frac {1}{4}}-{\frac {5}{72}}-{\frac {1}{32}}-{\frac {251}{14400}}-{\frac {19}{1728}}-\ldots }$$

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

$${\displaystyle \gamma =\sum _{n=1}^{\infty }{\frac {(-1)^{n+1}}{2n}}{\Big \{}\psi _{n}(a)+\psi _{n}{\Big (}-{\frac {a}{1+a}}{\Big )}{\Big \}},\quad a>-1}$$

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

$${\displaystyle {\frac {z(1+z)^{s}}{\log(1+z)}}=\sum _{n=0}^{\infty }z^{n}\psi _{n}(s),\qquad |z|<1.}$$

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

$${\displaystyle \gamma ={\frac {3}{4}}-{\frac {11}{96}}-{\frac {1}{72}}-{\frac {311}{46080}}-{\frac {5}{1152}}-{\frac {7291}{2322432}}-{\frac {243}{100352}}-\ldots }$$Other series with the same polynomials include these examples:

$${\displaystyle \gamma =-\log(a+1)-\sum _{n=1}^{\infty }{\frac {(-1)^{n}\psi _{n}(a)}{n}},\qquad \Re (a)>-1}$$

and

$${\displaystyle \gamma =-{\frac {2}{1+2a}}\left\{\log \Gamma (a+1)-{\frac {1}{2}}\log(2\pi )+{\frac {1}{2}}+\sum _{n=1}^{\infty }{\frac {(-1)^{n}\psi _{n+1}(a)}{n}}\right\},\qquad \Re (a)>-1}$$

where Γ(a) is the gamma function.

A series related to the Akiyama–Tanigawa algorithm is

$${\displaystyle \gamma =\log(2\pi )-2-2\sum _{n=1}^{\infty }{\frac {(-1)^{n}G_{n}(2)}{n}}=\log(2\pi )-2+{\frac {2}{3}}+{\frac {1}{24}}+{\frac {7}{540}}+{\frac {17}{2880}}+{\frac {41}{12600}}+\ldots }$$

where G_n(2) are the Gregory coefficients of the second order.

As a series of prime numbers:

$${\displaystyle \gamma =\lim _{n\to \infty }\left(\log n-\sum _{p\leq n}{\frac {\log p}{p-1}}\right).}$$

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

• ${\textstyle \gamma \sim H_{n}-\log n-{\frac {1}{2n}}+{\frac {1}{12n^{2}}}-{\frac {1}{120n^{4}}}+\cdots }$(Euler)
• ${\textstyle \gamma \sim H_{n}-\log \left({n+{\frac {1}{2}}+{\frac {1}{24n}}-{\frac {1}{48n^{2}}}+\cdots }\right)}$(Negoi)
• ${\textstyle \gamma \sim H_{n}-{\frac {\log n+\log(n+1)}{2}}-{\frac {1}{6n(n+1)}}+{\frac {1}{30n^{2}(n+1)^{2}}}-\cdots }$(Cesàro)

The third formula is also called the Ramanujan expansion.

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

$${\displaystyle {\begin{aligned}\sum _{n=1}^{\infty }{\Big (}\log n+\gamma -H_{n}+{\frac {1}{2n}}{\Big )}&={\frac {\log(2\pi )-1-\gamma }{2}}\\\sum _{n=1}^{\infty }{\Big (}\log {\sqrt {n(n+1)}}+\gamma -H_{n}{\Big )}&={\frac {\log(2\pi )-1}{2}}-\gamma \\\sum _{n=1}^{\infty }(-1)^{n}{\Big (}\log n+\gamma -H_{n}{\Big )}&={\frac {\log \pi -\gamma }{2}}\end{aligned}}}$$

The constant e^γ is important in number theory. Its numerical value is:

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

$${\displaystyle e^{\gamma }=\lim _{n\to \infty }{\frac {1}{\log p_{n}}}\prod _{i=1}^{n}{\frac {p_{i}}{p_{i}-1}}.}$$

This restates the third of Mertens' theorems.

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

$${\displaystyle {\frac {\pi ^{2}}{6e^{\gamma }}}=\lim _{n\to \infty }{\frac {1}{\log p_{n}}}\prod _{i=1}^{n}{\frac {p_{i}}{p_{i}+1}}.}$$

Other infinite products relating to e^γ include:

$${\displaystyle {\begin{aligned}{\frac {e^{1+{\frac {\gamma }{2}}}}{\sqrt {2\pi }}}&=\prod _{n=1}^{\infty }e^{-1+{\frac {1}{2n}}}\left(1+{\frac {1}{n}}\right)^{n}\\{\frac {e^{3+2\gamma }}{2\pi }}&=\prod _{n=1}^{\infty }e^{-2+{\frac {2}{n}}}\left(1+{\frac {2}{n}}\right)^{n}.\end{aligned}}}$$

These products result from the Barnes G-function.

In addition,

$${\displaystyle e^{\gamma }={\sqrt {\frac {2}{1}}}\cdot {\sqrt[{3}]{\frac {2^{2}}{1\cdot 3}}}\cdot {\sqrt[{4}]{\frac {2^{3}\cdot 4}{1\cdot 3^{3}}}}\cdot {\sqrt[{5}]{\frac {2^{4}\cdot 4^{4}}{1\cdot 3^{6}\cdot 5}}}\cdots }$$

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

$${\displaystyle \prod _{k=0}^{n}(k+1)^{(-1)^{k+1}{n \choose k}}.}$$

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

It also holds that

$${\displaystyle {\frac {e^{\frac {\pi }{2}}+e^{-{\frac {\pi }{2}}}}{\pi e^{\gamma }}}=\prod _{n=1}^{\infty }\left(e^{-{\frac {1}{n}}}\left(1+{\frac {1}{n}}+{\frac {1}{2n^{2}}}\right)\right).}$$

Euler's generalized constants are given by

$${\displaystyle \gamma _{\alpha }=\lim _{n\to \infty }\left(\sum _{k=1}^{n}{\frac {1}{k^{\alpha }}}-\int _{1}^{n}{\frac {1}{x^{\alpha }}}\,dx\right)}$$

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

$${\displaystyle \gamma _{\alpha }=\zeta (\alpha )-{\frac {1}{\alpha -1}}}$$

with again the limit:

$${\displaystyle \gamma =\lim _{a\to 1}\left(\zeta (a)-{\frac {1}{a-1}}\right)}$$

This can be further generalized to

$${\displaystyle c_{f}=\lim _{n\to \infty }\left(\sum _{k=1}^{n}f(k)-\int _{1}^{n}f(x)\,dx\right)}$$

for some arbitrary decreasing function f. Setting

$${\displaystyle f_{n}(x)={\frac {(\log x)^{n}}{x}}}$$

gives rise to the Stieltjes constants ${\displaystyle \gamma _{n}}$, that occur in the Laurent series expansion of the Riemann zeta function:

${\displaystyle \zeta (1+s)={\frac {1}{s}}+\sum _{n=0}^{\infty }{\frac {(-1)^{n}}{n!}}\gamma _{n}s^{n}.}$

with ${\displaystyle \gamma _{0}=\gamma =0.577\dots }$

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

$${\displaystyle \gamma (a,q)=\lim _{x\to \infty }\left(\sum _{0<n\leq x \atop n\equiv a{\pmod {q}}}{\frac {1}{n}}-{\frac {\log x}{q}}\right).}$$

The basic properties are

$${\displaystyle {\begin{aligned}&\gamma (0,q)={\frac {\gamma -\log q}{q}},\\&\sum _{a=0}^{q-1}\gamma (a,q)=\gamma ,\\&q\gamma (a,q)=\gamma -\sum _{j=1}^{q-1}e^{-{\frac {2\pi aij}{q}}}\log \left(1-e^{\frac {2\pi ij}{q}}\right),\end{aligned}}}$$

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

$${\displaystyle q\gamma (a,q)={\frac {q}{d}}\gamma \left({\frac {a}{d}},{\frac {q}{d}}\right)-\log d.}$$

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

${\displaystyle \delta =\lim _{n\to \infty }\left(-\log n+\sum _{k=2}^{n}{\frac {1}{\pi r_{k}^{2}}}\right)}$

where ${\displaystyle r_{k}}$is the smallest radius of a disk in the complex plane containing at least ${\displaystyle k}$Gaussian integers.

The following bounds have been established: ${\displaystyle 1.819776<\delta <1.819833}$.

• Harmonic series
• Riemann zeta function
• Stieltjes constants
• Meissel-Mertens constant

• Bretschneider, Carl Anton (1837) [1835]. "Theoriae logarithmi integralis lineamenta nova". Crelle's Journal (in Latin). 17: 257–285.
• Havil, Julian (2003). Gamma: Exploring Euler's Constant. Princeton University Press. ISBN 978-0-691-09983-5.
• Lagarias, Jeffrey C. (2013). "Euler's constant: Euler's work and modern developments". Bulletin of the American Mathematical Society. 50 (4): 556. arXiv:1303.1856. doi:10.1090/s0273-0979-2013-01423-x. S2CID 119612431.

• Borwein, Jonathan M.; David M. Bradley; Richard E. Crandall (2000). "Computational Strategies for the Riemann Zeta Function". Journal of Computational and Applied Mathematics. 121 (1–2): 11. Bibcode:2000JCoAM.121..247B. doi:10.1016/s0377-0427(00)00336-8. Derives γ as sums over Riemann zeta functions.
• Finch, Steven R. (2003). Mathematical Constants. Encyclopedia of Mathematics and its Applications. Vol. 94. Cambridge: Cambridge University Press. ISBN 0-521-81805-2.
• Gerst, I. (1969). "Some series for Euler's constant". Amer. Math. Monthly. 76 (3): 237–275. doi:10.2307/2316370. JSTOR 2316370.
• Glaisher, James Whitbread Lee (1872). "On the history of Euler's constant". Messenger of Mathematics. 1: 25–30. JFM 03.0130.01.
• Gourdon, Xavier; Sebah, P. (2002). "Collection of formulae for Euler's constant, γ".
• Gourdon, Xavier; Sebah, P. (2004). "The Euler constant: γ".
• Julian Havil (2003): GAMMA: Exploring Euler's Constant, Princeton University Press, ISBN 978-0-69114133-6.
• Karatsuba, E. A. (1991). "Fast evaluation of transcendental functions". Probl. Inf. Transm. 27 (44): 339–360.
• Karatsuba, E.A. (2000). "On the computation of the Euler constant γ". Journal of Numerical Algorithms. 24 (1–2): 83–97. doi:10.1023/A:1019137125281. S2CID 21545868.
• Knuth, Donald (1997). The Art of Computer Programming, Vol. 1 (3rd ed.). Addison-Wesley. pp. 75, 107, 114, 619–620. ISBN 0-201-89683-4.
• Lehmer, D. H. (1975). "Euler constants for arithmetical progressions" (PDF). Acta Arith. 27 (1): 125–142. doi:10.4064/aa-27-1-125-142.
• Lerch, M. (1897). "Expressions nouvelles de la constante d'Euler". Sitzungsberichte der Königlich Böhmischen Gesellschaft der Wissenschaften. 42: 5.
• Mascheroni, Lorenzo (1790). Adnotationes ad calculum integralem Euleri, in quibus nonnulla problemata ab Eulero proposita resolvuntur. Galeati, Ticini.
• Sondow, Jonathan (2002). "A hypergeometric approach, via linear forms involving logarithms, to irrationality criteria for Euler's constant". Mathematica Slovaca. 59: 307–314. arXiv:math.NT/0211075. Bibcode:2002math.....11075S. doi:10.2478/s12175-009-0127-2. S2CID 16340929. with an Appendix by Sergey Zlobin

• "Euler constant". Encyclopedia of Mathematics. EMS Press. 2001 [1994].
• Weisstein, Eric W. "Euler–Mascheroni constant". MathWorld.
• Jonathan Sondow.
• Fast Algorithms and the FEE Method, E.A. Karatsuba (2005)
• Further formulae which make use of the constant: Gourdon and Sebah (2004).