Scribd
Upload
48 views

Collection of Formulae For The Euler Constant

This document provides several integral and series formulae for calculating Euler's constant γ. It begins by listing several integrals that can be used to define or relate to γ. It then provides many series representations of γ that involve sums of the reciprocals of integers, the Riemann zeta function ζ(s), and the von Mangoldt function. It also discusses some relationships between γ and the prime numbers through Mertens' formulae.

Uploaded by

Aetna7
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
48 views

Collection of Formulae For The Euler Constant

This document provides several integral and series formulae for calculating Euler's constant γ. It begins by listing several integrals that can be used to define or relate to γ. It then provides many series representations of γ that involve sums of the reciprocals of integers, the Riemann zeta function ζ(s), and the von Mangoldt function. It also discusses some relationships between γ and the prime numbers through Mertens' formulae.

Uploaded by

Aetna7
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Numbers, constants and computation 1

Collection of formulae for the Euler


constant
Xavier Gourdon and Pascal Sebah
February 12, 2003
1
1 Integral formulae
Eulers constant may be founded in many integrals, we provide a selection of
such integrals. Some of those can be deduced from others by a simple change
of variables.
=


0
e
t
log(t) dt =

(1)

2
+

2
6
=


0
e
t
log
2
(t) dt =

(1) (Euler MascheroniIntegral)


=

1
0
log(log(1/t))dt
+ 2 log(2) = 4
1/2


0
e
t
2
log(t) dt
=


0
e
t
(
1
1 e
t

1
t
)dt
=

1
0
(
1
t
+
1
log(1 t)
)dt
=


0
(
1
1 + t
e
t
)
dt
t
=


0
(
1
1 + t
2
cos(t))
dt
t
( ) =


0
e
t

e
t

t
dt > 0, > 0
= 1

1
0
1
1 + t

k=1
t
2
k

dt (Catalan

sformula)
=
1
2
+ 2


0
t dt
(t
2
+ 1)(e
2t
1)
(Hermite

sformula)
= 1 +
1
2
+ ... +
1
n 1
+
1
2n
log(n) + 2


0
t dt
(t
2
+ n
2
)(e
2t
1)
=

1
0
1 e
t
e
1/t
t
dt (Barnes)
1
This pages are from //numbers.computation.free.fr/Constants/constants.html
Numbers, constants and computation 2
=

x
0
1 cos(t)
t
dt


x
cos(t)
t
dt log(x) x > 0
=

x
0
1 e
t
t
dt


x
e
t
t
dt log(x) x > 0
The last integral is often used to compute many digits of .
2 Series formulae
Now here is a list of series for .
2.1 Basic series
= lim
m
(
m

k=1
1
k
log(m)) (Euler)
= 1 +

k=2

1
k
+ log(1
1
k
)

(Euler)
= 2

1 +
1
2
m1
m
+
1
3
m1
m
m2
m
+ ...

log(2m) (Kruskal)
= lim
n

1
n

(Demys)
=
log(2)
2
+
1
log(2)
m

k=2
(1)
k
log(k)
k
2.2 Around the zeta function
When he studied , Euler found some interesting series which allow to compute
it with the integral values of the Riemann zeta function. He used one of those
to give the rst estimation of his constant (a ve digits approximation).
There are many formulae giving as function of the Riemann zeta function
(s), some are easy to prove. We provide the demonstration of one example.
By denition, we may write:
= lim
m
(
m

k=1
1
k
log(m)) = 1+

k=2

1
k
+ log(
k 1
k
)

= 1+

k=2

1
k
+ log(1
1
k
)

and using the series for log(1 x) when x = 1/k < 1:


= 1

k=2

i=2
1
ik
i

then by associativity of this positive sum:


Numbers, constants and computation 3
= 1

i=2
1
i

k=2
1
k
i

= 1

i=2
1
i
((i) 1)
So weve just demonstrated a rst relation between and the zeta functions.
Because its clear that (i) 1 is equivalent to 1/2
i
when i becomes large, some
of those series have geometric convergence (of course one has to evaluate (i)
for dierent values of i).
= 1

k=2
((k) 1)
k
(Euler)
=

k=2
(k 1)((k) 1)
k
(Euler)
= 1
log(2)
2

k=1
((2k + 1) 1)
2k + 1
= log(2)

k=1
(2k + 1)
4
k
(2k + 1)
(Euler)
= 1 log(
3
2
)

k=1
((2k + 1) 1)
4
k
(2k + 1)
(Euler Stieltjes)
= 1

k=1
(2k + 1)
(k + 1)(2k + 1)
(Glaisher)
=

k=2
(1)
k
(k)
k
(Euler)
= 1 log(2) +

k=2
(1)
k
((k) 1)
k
=
3
2
log(2)

k=2
(1)
k
(k 1)
((k) 1)
k
(Flajolet Vardi)
=
5
4
log(2)
1
2

k=3
(1)
k
(k 2)
((k) 1)
k
= log(
4

) + 2

k=2
(1)
k
(k)
2
k
k
= 1 + log(
16
9
) + 2

k=2
(1)
k
((k) 1)
2
k
k
Numbers, constants and computation 4
2.3 Other series
=

i=1
i

j=2
i+1
1

j=2
i
(1)
j
j

(Vacca)
=

k=1
a
k
k
(Kluyver)
= 1 log(2) +

k=1
a
k
k(k + 1)
(Kluyver)
=
m1

k=1
1
k
log(m) +
1
m

k=1

a
k

m+k1
m

(Kluyver[1])
in the last formulae the a
k
are rational numbers dened by :
a
1
=
1
2
a
k
=
1
k + 1
k1

i=1
k i
i(i + 1)
a
ki
and 0 < a
k

1
k+1
. We give the rst values:
a
1
=
1
2
, a
2
=
1
12
, a
3
=
1
24
, a
4
=
19
720
, a
5
=
3
160
, a
6
=
863
60480
, a
7
=
275
24192
...
Kluyvers last relation may be used to compute a few hundred digits of .
3 Eulers constant and the prime numbers
3.0.1 Mertens formulae
If p represents a prime number, Mertens gave in 1874 the two beautiful formulae
[2]:
e

= lim
m
1
log(m)

pm
(1
1
p
)
1
6e

2
= lim
m
1
log(m)

pm
(1 +
1
p
)
The rst relation is equivalent to:
= lim
m

pm
log(1
1
p
) log(log(m))

Numbers, constants and computation 5


when p is large:
log(1
1
p
) =
1
p
+ O(
1
p
2
)
and the last relation for is very similar to its denition relation, but this
time, only the prime numbers are taken into account in the sum.
3.0.2 Eulers constant and von Mangoldt function
=
1
2

k=2
((k) 1)
k
(k) is von Mangoldt function and is dened by
(k) = log(p) if k = p
m
foranyprime p
= 0 otherwise,
it is related to the logarithmic derivative of the zeta function by the inter-
esting and similar relation

(s)
(s)
=

k=1
(k)
k
s
s > 1.
References
[1] J. C. Kluyver, De constante van Euler en de natuurlijhe getallen, Amst. Ak.,
(1924), vol. 33, p. 149-151
[2] F. Mertens, Journal f ur Math., (1874), vol. 78, p. 46-62
[3] T. J. Stieltjes, Tables des valeurs des sommes S
k
=

n=1
n
k
,Acta Math-
ematica, (1887), vol. 10, p. 299-302

You might also like