1

Eulers Constant and Gamma Function: A Survey and Some New Results
Amrik Singh Nimbran
I.
Eulers constant first appears as the constant of integration C in Eulers 1734 paper titled De
Progressionibus Harmonicis Observationes. [1] He states that if 1+
1
2
+
1
3
+ . . . +
1
n
is taken to be s,
then Js=
dn
n+1
, and thus s=C +ln(n +1). He then proceeds to evaluate the constant, giving
C=0.577218, correct to five decimal places, the actual last digit being 5.
lnn = [(1+
1
2
+
1
3
+ . . . +
1
n
) -1] + [(
1
n+1
+
1
n+2
+ . . . +
1
2n
) -
1
2
] + [(
1
2n+1
+
1
2n+2
+ . . . +
1
3n
) -
1
3
] + . . .
= []
1

mn
={(m-1)n}+1

1
m
]

m=1
.
Thus, we obtain:
ln2 = 1-
1
2
+
1
3
-
1
4
+
1
5
-
1
6
+ . . .
ln3 = 1+
1
2
-
2
3
+
1
4
+
1
5
-
2
6
+
1
7
+
1
8
-
2
9
+ . . .
ln4 = 1+
1
2
+
1
3
-
3
4
+
1
5
+
1
6
+
1
7
-
3
8
+
1
9
+
1
10
+
1
11
-
3
12
+ . . .
. . .
lnn =(1+
1
2
+
1
3
++ . . . +
1
n-1

n-1
n
)+(
1
n+1
+
1
n+2
+
1
n+3
+. . . +
1
2n-1

n-1
2n
)+(
1
2n+1
+
1
2n+2
+
1
2n+3
+ . . . + .
. . +
1
3n-1

n-1
3n
)+ . . .
Euler derives from the above:
1=ln2+
1
2
-
1
3
+
1
4
-
1
5
+
1
6
-
1
7
+ -. . .
1
2
=ln
3
2
+
1
2.4
-
1
3.8
+
1
4.16
-
1
5.32
+ -. . .
1
3
=ln
4
3
+
1
2.9
-
1
3.27
+
1
4.81
-
1
5.243
+ -. . .
1
4
=ln
5
4
+
1
2.16
-
1
3.64
+
1
4.256
-
1
5.1024
+ -. . .
. . .
1
n
=ln
n+1
n
+
1
2.n
2
-
1
3.n
3
+
1
4.n
4
-
1
5.n
S
+ -. . .
Adding these and taking the first terms to the L.H.S. gives:
2

[1+
1
2
+
1
3
+ ...+
1
n
ln(n +1)=
1
2
(1+
1
2
2
+
1
3
2
++
1
n
2
)-
1
3
(1+
1
2
3
+
1
3
3
++
1
n
3
)+
1
4
(1+
1
2
4
+
1
3
4
+
+
1
n
4
)-
1
5
(1+
1
2
S
+
1
3
S
++
1
n
S
)+-
Taking the limit as n gives what is written in todays terminology:
y=ltm
n
[
1
k
ln
k+1
k

n
k=1
=ltm
n
[[1 +
1
2
+
1
3
+ ...+
1
n
{ln(n +1)}]=
(-1)
m
(m)
m

m=2
, where
(m)=
1
n
m

n=1
.
The above-noted formula could be derived by this procedure also:
ln(1+x) = x
1
2
x
2
+
1
3
x
3

1
4
x
4
+ , for all x1.
Replacing x by
1

gives: ln(1+
1

) =
1

1
2
2
+
1
3
3

1
4
4
+
And so
1

=ln(
+1

) +
1
2
2

1
3
3
+
1
4
4

1
5
S
+
Taking sum from r=1 to n on both sides results in:

n
=1
= ln(
+1

)
n
=1
+
1
2
2
n
=1

1
3
3

n
=1
+
1
4
4
n
=1

1
5
S
n
=1
+
i.e.,
1

n
=1
= ln(r +1)
n
=1
lnr
n
=1
+
1
2
2
n
=1

1
3
3

n
=1
+
1
4
4
n
=1

1
5
S
n
=1
+
i.e.,
1

n
=1
=ln(n +1) +
1
2
2
n
=1

1
3
3

n
=1
+
1
4
4
n
=1

1
5
S
n
=1
+
Taking the limit as n gives the required result.
Euler revisited his constant forty years later in his paper De numero memorabili in
summatione progressionis harmonicae naturalis occurrente, presented to the St. Petersburg
Academy on February 22, 1776. [2] This time he wrote 1 +
1
2
+
1
3
+ . . . +
1
x
= C +lnx and so
y=lim
n
[(1+
1
2
+
1
3
+ ...+
1
n
) (lnn)]. He replaced x by
1
n
in the series for ln(1+x) to derive
1 C =
{(m)-1}
m

m=2
and used this result taking fifteen terms to evaluate C=0.5772169, correct to
five decimal places. By this time, he had discovered (2)=
n
2
6
, (4)=
n
4
90
, (6)=
n
6
945
(printing error on
p.53, correct value on p.68), (8)=
n
8
9450
, (10)=
n
10
93555
, etc. Further values from (12) to (26) can be
found in [3].
Euler listed eight series including the two already mentioned. Two more are worth
mentioning: ln2 C=
(2n)
(2n+1)2
2n

n=1
and 1 ln
3
2
C=
{(2n)-1}
(2n+1)2
2n

n=1
. The latter was employed by
him with only nine terms giving C=0.5772156649017913, correct to twelve decimal places.
Actually he records, in this paper, a value correct to 15 decimal places, C=0.5772156649015325,
the actual last digit being 8.
3

Lorenzo Mascheroni (17501800), professor of mathematics at the University of Pavia
(Italy), who studied Eulers work on integral calculus and published his notes in 1790 under the
title Adnotationes ad calculum integrale Euleri [4], extended Eulers computation using the symbol
A for the constant. He calculated the constant to 32 decimal places, but made mistakes in the 20
th
to
22
nd
and then 31
st
to 32
nd
digits. Glaisher [5] computed to 99 places anu Shanks to 11u places
(101 being correct) in 1871. J.C. Adams took it to 263 digits in 1877. John William Wrench, Jr. took
it to 328 digits in 1952. Donald E. Knuth [6] determined the constant to 1271 places in 1962 and
Dura W. Sweeney [7] to 3,566. Richard P. Brent [8] extended the value to 20,700 in 1977. Jonathan
Borwein made remarkable contribution by computing 172, 000 digits in 1993. But it was left to
Alexander J. Yee and his associate Raymond Chan to make a quantum jump, computing 116 million
digits in 2006 and extending these first to 14.9 billion in January, 2009 and then to 29, 844, 489,545
decimal places on 13
th
March, 2009.[9][10]
Franklin [11] gave this series in1883:
y= [n ]
(-1)
k
k
2
n+1
-1
k=2
n ]

n=1
=(
1
2

1
3
)+2(
1
4

1
5
+
1
6

1
7
) +3[
1
8

1
9
+
1
10

1
11
+
1
12

1
13
+
1
14

1
15
+
Nielsen [12] discovered the following series in 1897:
y=1 (1)
m
Iog
2
m
m+1

m=2
, where is the floor function.
Vacca [13] found the closely related series (an equivalent of Franklins) in 1910:
y= (1)
k
Iog
2
k
k

k=2

Kluyver [14] remarked in 1924 that an arbitrary integer a can serve as the base, taking
[
k
=o 1 or 1 according as ok or ok:
y=
[
k
Iog
c
k
k

k=u
.
Kluyver deduced these formulae:
y =
u
k
k

k=1
and y =
1
k
n
k=1
ln(n +1) +n!
u
k
k(k+1)(k+n)

k=1
, n1.
o
k
are rational numbers and satisfying the relation
u
k
1
+
u
k-1
2
+
u
k-2
3
+. . . +
u
1
k
=
1
k+1
, i.e.,
u
k-n
1+n
k
n=0
=0;
and hence, o
k
=
1
k+1

k-]
](]+1)
k-1
]=1
o
k-]
, o
0
=1, o
1
=
1
2
.
In fact, these are the Gregory coefficients, studied by James Gregory and first six given in a
letter to John Collins in 1670:
1
2
,
1
12
,
1
24
,
19
720
,
3
160
,
863
60480
. They have the integral representation:
c
n
=
dx
(1+x)
n
{(Inx)
2
+n
2
}

0
, n=1, 2, 3, . . .
4

We have: (1)
k-1
c
k

k=1
=
1
In 2
1 and c
k

k=1
=1.
Related numbers appear in a theorem of Li Yingying [15], and the formula given by her
yields: o
k
=
1
(k-1)!
j
(-1)
k+1
k

s(k,])
(]+1)
k
]=1
[, where s(k,]) are Stirling numbers of the first kind. Thus,
y=
1
2
+
1
24
+
1
72
+
19
2880
+
3
800
+
863
362880
+
275
169344
+
33953
29030400
+
8183
9331200
+
3250433
4790016000
+ . . .
However, the above series is too slow in convergence to be of any practical value.
Vacca found [16] another series in 1926:
y +(2)= [
1
k
2

1
k
=

k=2
[
k-k
2
kk
2

n=1
= [
1
n
2
2n
k=1
]
1
n
2
+k
2n
k=1
]

n=1
.
Sondow [17] discovered the following Vacca-type series:
y=
N
1
(n)+N
0
(n)
2n(2n+1)

n=1
, where N
1
(n) and N
0
(n) are the number of ones and zeros respectively in the
binary expression (base 2) of n.
Addison [18] obtained the following series by using an integral representation of the
Riemann zeta function:
y=
1
2
+
Iog
2
2n
{2n(2n+1(2n+2)}

n=1
.
Sondow [17] generalized Addisons result discovering faster series:
y=
1
2
+
|Iog
q
qn] P
q
(n)
{qn(qn+1)(qn+2)(qn+q)}

n=1
, where q is integer 2 and P
q
(x) is polynomial of degree (q 2)
P
q
(x)=(qx +1)(qx +2) . . . (qx +q 1)
m(q-m)
qx+m
q-1
m=1
.
For example, y=
1
2
+
Iog
3
3n (12n+6)
{3n(3n+1)(3n+2)(3n+3)}

n=1
.
Sondow [18] had earlier discovered the following antisymmetric formula:
y=lim
x1
+
[
1
n
x

1
x
n

n=1
.
Ramanujan found this formula (slightly corrected by Berndt) [19][20][21, p.276]:
y=(ln2) 2n_
1
(3k)
3
-3k
3
n
-1
2
k=
3
n-1
+1
2
_

n=1
.
y =
3
2
ln2 (1)
m
(m-1){(m)-1}
m

m=2
.
y =
1
k
n
k=1
lnn (1)
m
(m, n+1)
m

m=2
, where (s, k) is the Hurwitz zeta function.
Eulers constant appears in many definite integrals listed below. I have discovered that we
can compute the class of integrals with the help of the following identity:
5

c
-t

0
(lnt)
n
Jt=
(n)
(1)=
(n-1)!
(n-1)!
y
(n-1)
(1) + (1)
k

(n-1)!
(n-k)!

(n-k)
(1)(k)
n
k=2
.
y = c
-t

0
lnt Jt =
i
(1) (1)
y
2
+(2) = c
-t

0
(lnt)
2
Jt =(1). (2)
y
3
+3y (2) +2(3) = c
-t

0
(lnt)
3
Jt =(1). (3)
y
4
+6y
2
(2) +8y (3) +3((2))
2
+6(4) = c
-t

0
(lnt)
4
Jt =
(4)
(1). (4)
y
5
+10y
3
(2) +20y
2
(3) +y{15((2))
2
+Su(4)}+20(2)(3) +24(5) = c
-t

0
(lnt)
5
Jt =
(5)
(1). (5)
y
6
+15y
4
(2) +40y
3
(3) +y
2
]45((2))
2
+9u(4) +y{120(2)(3) +144(5)}+15((2))
3
+40((3))
2
+
90(4)(2) +120(6) = c
-t

0
(lnt)
6
Jt =
(6)
(1). (6)
y
7
+21y
5
(2) +70y
4
(3) +y
3
]105((2))
2
+21u(4) +y
2
{420(2)(3) +504(5)}+y ]105((2))
3
+280((3))
2
+
630 (4)(2) +840(6) +210((2))
2
(3) +420(3)(4) +504(5)(2) +720(7) = c
-t

0
(lnt)
7
Jt =
(7)
(1). (7)
c
-t

0
(lnt)
8
Jt =
(8)
(1)=y
8
+28y
6
(2) +112y
5
(3) +y
4
]210((2))
2
+42u(4) +y
3
{1120(2)(3) +1344(5)}+
y
2
]420((2))
3
+1120((3))
2
+2520 (4)(2) +3360(6) +y{1680((2))
2
(3) +3360(3)(4) +4032(5)(2) +
5760(7)}+105((2))
4
+1120((3))
2
(2) +1260((4))
2
+1260(4)((2))
2
+2688 (5)(3) +3360 (6)(2) +5040(8).
(8)
c
-t

0
(lnt)
9
Jt =
(9)
(1)=[y
9
+36y
7
(2) +168y
6
(3) +y
5
]378((2))
2
+7S6(4) +y
4
{2520 (2)(3) +
3024(5)}+y
3
]1260((2))
3
+3360((3))
2
+7560 (4)(2) +10080 (6) +y
2
]7560((2))
2
(3) +15120(3) (4) +
18144 (5) (2) +25920 (7) +y ]{945((2))
4
+10080((3))
2
(2) +11340((4))
2
+11340(4)((2))
2
+
24192 (5)(3) +30240 (6)(2) +45360(8) +2520((2))
3
(3) + 9072((2))
2
(5) +2240((3))
3
+
15120 (2)(3)(4) +18144 (4)(5) +20160 (6)(3) +25920(7)(2) +40320 (9)] (9)
The sign of the total quantity is (1)
n
. The sum of the coefficients in the L.H.S. here equals k!, k is the
exponent of lnt in the integrand.
The first coefficient = one, while the last =(k 1)!.
2
nd
coefficient =
n(n-1)
2
.
3
rd
coefficient =
n(n-1)(n-2)
3
.
4
th
coefficient =
n(n-1)(n-2)(n-3)
8
.
5
th
coefficient =
n(n-1)(n-2)(n-3)
4
.
6
th
coefficient =
n(n-1)(n-2)(n-3)(n-4)
6
.
7
th
coefficient =
n(n-1)(n-2)(n-3)(n-4)
5
.
8
th
coefficient =
n(n-1)(n-2)(n-3)(n-4)(n-5)
48
.
6

9
th
coefficient =
n(n-1)(n-2)(n-3)(n-4)(n-5)
18
.
10
th
coefficient =
n(n-1)(n-2)(n-3)(n-4)(n-5)
8
.
11
th
coefficient =
n(n-1)(n-2)(n-3)(n-4)(n-5)

.
12
th
coefficient =
n(n-1)(n-2)(n-3)(n-4)(n-5)(n-6)
24
.
13
th
coefficient =
n(n-1)(n-2)(n-3)(n-4)(n-5)(n-6)
12
.
14
th
coefficient =
n(n-1)(n-2)(n-3)(n-4)(n-5)(n-6)
10
.
15
th
coefficient =
n(n-1)(n-2)(n-3)(n-4)(n-5)(n-)
7
.
16
th
coefficient =
n(n-1)(n-2)(n-3)(n-4)(n-5)(n-6)(n-7)
384
.
17
th
coefficient =
n(n-1)(n-2)(n-3)(n-4)(n-5)(n-6)(n-7)
36
.
18
th
coefficient =
n(n-1)(n-2)(n-3)(n-4)(n-5)(n-6)(n-7)
32
.
19
th
coefficient =
n(n-1)(n-2)(n-3)(n-4)(n-5)(n-6)(n-7)
32
.
20
th
coefficient =
n(n-1)(n-2)(n-3)(n-4)(n-5)(n-6)(n-7)
15
.
21
st
coefficient =
n(n-1)(n-2)(n-3)(n-4)(n-5)(n-6)(n-7)
12
.
22
nd
coefficient =
n(n-1)(n-2)(n-3)(n-4)(n-5)(n-)(n-7)
8
.
The coefficient of a term in n =
ncocspondng coc]]ccnt o] (n-1)
cxponcnt oI y in n
.
y =2ln2
4
n
c
-t
2
0
lnt Jt. (9)
y = c
-t
(
1
1-c
-t

1
t
)

0
Jt. This integral is ascribed to Gauss. (10)
y =1 (
1-c
-t
t

1
1+t
)
dt
t

0
. (11)
y = (
1
1+t
c
-t
)
dt
t

0
. This integral is credited to Dirichlet. [Whittaker& Watson, p.248] (12)
y = (
1
t
+
1
In(1-t)
)
1
0
Jt = (
1
Int
+
1
1+t
)
1
0
Jt = (
1
c
t
-1

1
tc
t
)

0
Jt. (13)
y = ln(ln
1
t
1
0
) Jt. (14)
[Larry C. Andrews, Special Functions of Mathematics for Engineers, New York: McGraw-Hill, 2
nd
ed., 1992,
p.105, 9(a).]
7

y =
u[
(u-[)

c
-t
o
-c
-t

0
Jt, >u, >0. (15)
y =
1-c
-t
-c
-
1
t
t
1
0
Jt. [Andrews, p.105, 10.][Whittaker & Watson, p.243, Ex.4] (16)
[E.W. Barnes, On the expression of Eulers constant as a definite integral, Messenger, 1903, vol.33, pp.59-61.]
y =
1-c
-t
t
x
0
Jt
c
-t
t

x
Jt lnx, x>0. [Whittaker & Watson, p.246, x=1.] (17)
y = (
1
1+t
2
cost)
dt
t

0
. (18)
y =
1-cos t
t
Jt
x
0

cos t
t
Jt

x
lnx, x>0. (19)
y =
In(1+x)
(In x)
2
+n
2

0
.
dx
x
2
=
In(1+c
-x
)
x
2
+n
2

0
c
-x
Jx (20)
y =
1
2
+2
t dt
(1+t
2
)(c
2nt
-1)

0
. [Andrews, p.105, 9(b).] (21.1)
y =[
1
k
n-1
k=1
+
1
2n
+2
t dt
(n
2
+t
2
)(c
2nt
-1)

0
. (21.2)
y =1 [
t-[t]
t
2
Jt

0
=1
{t}
t
2
Jt

0
. (22)
where [t] denotes the greatest integer contained in t, while {t}=t [t], is the fractional part of t.
y = [
1
[t]

1
t
Jt

0
. (23)
y=2 [
1
1+t
2
n
c
-t
2

0

dt
t
. (24)
y=2
n
[
1
1+t
2
c
-t
2
n

0

dt
t
. (25)
y =
1
1+t

1
0
( t
2
n
-1
n=1
) Jt. This integral is attributed to Catalan (1875). (26)
[T. Bromwich, An Introduction to the Theory of Infinite Series, 2nd edition, Macmillan, London, 1926, p.526]
Ramanujan gives similar integrals [21, p.275]:
y =1 ( x
2
n

n=1
)
1
0
Jx. (27.1)
y =1 [
1+2x
1+x+x
2

1
0
( x
3
n

n=1
) Jx. (27.2)

(y+In2n+Inn)
2nn
= [
2nn
t
2
+4n
2
n
2

c
-t
2nn

0
Jt. Due to Kummer. [Whittaker & Watson, p.250.] (28)
8

We obtain from Kummers expansion of the Gamma function:
y =lnn [
3
4
+
4
n
(1)
k+1

In(2k+1)
(2k+1)

k=1
(29)
y =1 [
sInt
t

1
1+t

dt
t

0
(30)
y =2 (c
-t
2
cost)
dt
t

0
. (31)
y =
1
2
+2
sIn (tan
-1
t)
(c
2nt
-1) (1+t
2
)

0
Jt. (32)
y =ln22
sIn (tan
-1
t)
(c
2nt
+1) (1+t
2
)

0
Jt. (33)
y = (
1
1+t
cost)
dt
t

0
. By using the result: (
sInt
t
cost)
dt
t

0
=1. (34)
We find y as the limiting value in the following formulae:
y =lim
z0
](z)
1
z
=lim
z0
](z) +
1
z
. (35)
y=lim
n
(
n
k
)
n
k=1
(-1)
k
k
ln(k +1). (36)
y=lim
n
1
n
[j
n
k
[
n
k

n
k=1
, where [x] denotes the greatest integer contained in x. (37)
y=lim
s1
](s)
1
s-1
. (38)
2y=lim
z0
1
z
]
1
I(1+z)

1
I(1-z)
. (Krmer, 2005) (39)
n
2
3y
2
=lim
z0
1
z
]
1
+(1-z)

1
+(1+z)
. (Krmer, 2005) (40)
y=lim
n
_
I(n+1)I[
1
n
n
1+
1
n
I[n+2+
1
n

n
2
n+1
_. (41)
y=lim
n
]
2n-1
2n
lnn +
1
k
n
k=2

(1-k)
n
k
. (42)
I discovered the following inequality:
lim
n
]8
(2k-1)
(4k-1)(4k-3)
n
k=1
ln(8n +
1
12n
) < < lim
n
]8
(2k-1)
(4k-1)(4k-3)
n
k=1
ln(8n).
Further, I found that
9

=lim
n
]
2
2k-1
n
k=1
ln(4n +
1
6n
)=lim
n
]
2
2k-1
n
k=1
ln(n +
1
24n
) 2ln2 which is comparable
with Negois better result =lim
n
]
1
k
n
k=1
ln(n +
1
2
+
1
24n
).
My formula =lim
n
_{
4k-1
2k(2k-1)
n
k=1
}
1
4
{ln[4n
2
+2n +
1
3

1
45
}_ gives value .57721598
for n=2; .5772156698for n=5 and .577215664971for n=9.
Since lim
n
j
1
n+k
n
k=1
[ =ln2, we have =lim
n
j]
1
k
n
k=1
]
1
n+k
n
2
k=1
[.
=lim
n
j]
1
k
2
n
-1
k=1
]n
1
k
2
n+1
k=2
n
+1
[.
As =lim
n
j]
1
k
2
n

k=1
ln2
n
[=lim
n
j]
1
k
2
n

k=1
n ln2[, and ln2=2
1
(2n-1)3
2n-1

n=1
, we have
=lim
n
j]
1
k
2
n

k=1
2n
1
(2k-1)3
2k-1
n
k=1
[.
However, a doubly faster result is given by the following formula:
y=ltm
n
j]
1
k
2
n
-1
k=1
+
1
2
n+1
]2n
1
(2k-1)3
2k-1
n
k=1
[, which gives value .577215664718for n=14,
the number of correct digits (.6*n).
II.
Eulers constant gamma y is closely related with his Gamma function (z), introduced by
him as a generalization of the Factorial function in a paper titled De progressionibus
transcendentibus seu quarum termini generales algebraice dari nequeunt (On transcendental
progressions, that is, those whose general terms cannot be given algebraically), which was
presented to the St. Petersburg Academy on November 28, 1729 and first published in Commentarii
academiae scientiarum Petropolitanae 5, 1738, pp. 36-57.
Euler starts with Wallis hyper-geometric series 1! + 2! + 3! + 4! + . . . to find its value as a
function of x. He had previously supposed that the general term of the series 1, 2, 6, 24, etc. could be
given, if not algebraically, at least exponentially. But then he saw that some intermediate terms
depended on the quadrature of a circle and so recognized that neither algebraic nor exponential
quantities were suitable for expressing it. He came upon the expression (also stated in his letters
dated 13
th
October and 1
st
December, 1729 to Goldbach):
10

1.2
n
1+n
.
2
1-n
.3
n
2+n
.
3
1-n
.4
n
3+n
.
4
1-n
.5
n
4+n
. . . or
1
1+n
.
2
2+n
.
3
3+n
. . .
k
3+n
.k
n
, k .
On putting n=0 and n=1, it gives the value 1, while n=
1
2
yields
2
3
.
4
5
.
6
7
.
8
9
. . . =_
2.4
3.3
.
4.6
5.5
.
6.8
7.7
Wallis
had found the quantity under the radical to be
n
4
. Hence the value of the function at
1
2
equals
n
2
= c
-t
2
Jt

0
.
Euler found that the general term of the sequence 1, 2, 6, 24, 120, 720, etc. is (lnx)
n
Jx.
Therefore, the series transforms into a definite integral (ln
1
x
)
n
Jx
1
0
, which on substituting x=c
-t
,
becomes t
n
c
-t

0
Jt. Extended to non-integral values, it becomes (z)= t
z-1
c
-t

0
Jt, where z>0
or R(z)>0 if z is complex. Then (z +1)=z! and (n +1)= n(n). Euler gave an infinite product
representation in a letter to Goldbach:
1
I(x)
= x
(1+
x
n
)
(1+
1
n
)
x

n=1
. Gauss defined (x)=
n!n
x
(x+k)

k=0
, x 0,
1, 2, . . . and (0)=, (n)=0. Weierstrass gave the following infinite product expression:
1
I(z)
= zc
yz
(1+
z
n
)c
-
z
n

n=1
, where y is Eulers constant.
Derivatives of the Gamma Function I(x)= t
x-1
e
-t

dt, x>0

m
(x)= c
-t

0
t
x-1
(lnt)
m
Jt, x>0.
Since
1
I(x)
= xc
yx
(1+
x
n
)c
-
x
n

n=1
, taking log of both sides and then negating them yields:
ln(x)=(lnx) yx jln[1+
x
n

x
n
[

n=1
, x>0.
Now
d
dx
ln(x)=
I
|
(x)
I(x)
=
1
x
y + j
1
n

1
x+n
[

n=1
.
(x)=(x){
1
x
+y (
1
n

1
x+n
)}

n=1
. (I)
Differentiating (I) with respect to x gives

u
(x)=
I
|
(x)
x
+
I(x)
x
2
y
i
(x) +
i
(x) {
1
n

1
x+n
}

n=1
+(x)
d
dx
{
1
n

1
x+n
}

n=1

=
I
|
(x)
x
+
I(x)
x
2
y
i
(x) +
i
(x) {
1
n

1
x+n
}

n=1
+(x) {
d
dx
x
n(x+n)
}

n=1

=
I
|
(x)
x
+
I(x)
x
2
y
i
(x) +
i
(x) {
1
n

1
x+n
}

n=1
+(x) {
1
n(x+n)

x
n(x+n)
2
}

n=1

=
I
|
(x)
x
+
I(x)
x
2
y
i
(x) +
i
(x) {
1
n

1
x+n
}

n=1
+(x) {
1
(x+n)
2
}

n=1
. (II)
Differentiating (II) with respect to x, we obtain
11

~
(x) =
I
0
(x)
x
+2
I
|
(x)
x
2
2
I(x)
x
3
y
u
(x) +
u
(x) {
1
n

1
x+n
}

n=1
+2
i
(x) {
1
(x+n)
2
}

n=1
+
2(x) ]
1
(x+n)
3

n=1
. (III)
Differentiating (III) with respect to x gives

~
(x) =

(x)
x
+3

(x)
x
2
6

(x)
x
3
+6
(x)
x
4
y

(x) +

(x) {
1
n

1
x+n
}

n=1
+3

(x) {
1
(x+n)
2
}

n=1

6

(x) ]
1
(x+n)
3

n=1
+6(x) ]
1
(x+n)
4

n=1
. (IV)
Differentiating (IV) with respect to x results in

5
(x) =
I
4
(x)
x
+4
I
3
(x)
x
2
12
I
2
(x)
x
3
+24
I
1
(x)
x
4
24
I(x)
x
S
y
4
(x) +
4
(x) {
1
n

1
x+n
}

n=1
+
4
3
(x) {
1
(x+n)
2
}12
2
(x) {
1
(x+n)
3

n=1
}

n=1
+24
1
(x)
1
(x+n)
4

n=1
24(x) ]
1
(x+n)
S

n=1
(V)
Differentiating (V) with respect to x leads to

6
(x)=
I
S
(x)
x
+5
I
4
(x)
x
2
20
I
3
(x)
x
3
+60
I
2
(x)
x
4
120
I
1
(x)
x
S
+120
I(x)
x
6
y
5
(x) +
5
(x) {
1
n

n=1
1
x+n
}+5
4
(x) {
1
(x+n)
2
} 20
3
(x) {
1
(x+n)
3
}

n=1
+60
2
(x) {
1
(x+n)
4

n=1
}

n=1

120
1
(x)
1
(x+n)
S

n=1
+120(x) ]
1
(x+n)
6

n=1
(VI)
Differentiating (VI) with respect to x results in

7
(x)=
I
6
(x)
x
+6
I
S
(x)
x
2
30
I
4
(x)
x
3
+120
I
3
(x)
x
4
360
I
2
(x)
x
S
+720
I
1
(x)
x
6
720
I(x)
x

y
6
(x) +

6
(x) {
1
n

1
x+n
}

n=1
+6
5
(x) ]
1
(x+n)
2

n=1
30
4
(x) {
1
(x+n)
3
}+120
3
(x) {
1
(x+n)
4

n=1
}

n=1

360
2
(x)
1
(x+n)
S

n=1
+720
1
(x) ]
1
(x+n)
6

n=1
720(x) ]
1
(x+n)

n=1
(VII)
The number of terms is always 2m+1.
Bibliography
1. L. Euler, De Progressionibus Harmonicis Observationes, Commentarii academiae scientiarum
Petropolitanae 7, 1740, pp. 150-161. http:/ / www.math.dartmouth.edu/ ~euler/ pages/ E043
2. L. Euler, De numero memorabili in summatione progressionis harmonicae naturalis occurrente, Acta
Academiae Scientarum Imperialis Petropolitinae 5, 1785, pp. 45-75.
http:/ / www.math.dartmouth.edu/ ~euler/ pages/ E583
3. L. Euler, Introduction to Analysis of the Infinite (Book I, 1748), tr. John D. Blanton, Springer, New
York, 1988, pp.139-140.
4. Lorenzo Mascheroni, Adnotationes ad calculum integralem Euleri in quibus nonnulla problemata ab
Eulero proposita resolvuntur, Galeati, Pavia, 1790. Reprinted in Eulers Opera Omnia, Series 1, v. 12.
12

5. James Whitbread Lee Glaisher, On the history of Euler's constant, Messenger of Mathematics, New
Series, vol.1, 1872, pp. 25-30, JFM 03.0130.01 Reprinted in Dunham, William, The Genius of Euler:
Reflections on his Life and Work, pp. 147-152, MAA, Washington, DC, 2007.
6. Donald E. Knuth, Euler's Constant to 1271 Places, Mathematics of Computation, Vol.16, No. 79 (July
1962), pp.275-281.
7. Sweeney, D. W. On the Computation of Euler's Constant, Math. Comput. 17, 1963, 170-178.
Corrigendum in Math. Comp., v. 17, 1963, p. 488. Sweeney, D. W. On the Computation of Euler's
Constant, Math. Comput. 17, 1963, 170-178. Corrigendum in Math. Comp., v. 17, 1963, p. 488.
8. Richard P. Brent, Computation of the Regular Continued Fraction for Euler's constant, Mathematics
of Computation, vol. 31, No. 139, July 1977, pp.771-777.
9. Yee, Alexander J. & Raymond Chan, Euler's Constant-116 Million Digits on a Laptop: New World
Record, 2006. http:/ / www.numberworld.org/ euler116m.html.
http:/ / www.numberworld.org/ nagisa_runs/ euler-14.9b_log2-15.5b.html
http:/ / www.numberworld.org/ nagisa_runs/ computations.html
10. Li Yingying, On Eulers ConstantCalculating Sums by Integrals, AMA Monthly, 109, Nov. 2002, pp.
845-850. ihome.ust.hk/ ~yyli/ yingying.pdf
11. F. Franklin, On an expression for Eulers constant, J. Hopkins circ., 1883, vol. 2, p.143.
12. Nielsen, N. "Een Raekke for Euler's Konstant." Nyt. Tidss. for Math. 8B, 1897, 10-12.
13. G. Vacca, A new series for the Eulerian constant y = .577 . . ., Quart. J. Pure Appl. Math. 41 (1910),
363-368.
14. J. C. Kluyver, De constante van Euler en de natuurlijhe getallen, Amst. Ak., (1924), vol. 33, p. 149-151.
Euler's constant and natural numbers, p.142. www.dwc.knaw.nl/ DL/ publications/ PU00015025.pdf
15. Li Yingying, On Eulers ConstantCalculating Sums by Integrals, AMA Monthly, 109, Nov. 2002, pp.
845-850. ihome.ust.hk/ ~yyli/ yingying.pdf
16. G. Vacca, "Nuova serie per la costante di Eulero, C = 0,577". Rendiconti, Accademia Nazionale dei
Lincei, Roma, Classe di Scienze Fisiche, Matematiche e Naturali (6) 3, 1926, 1920.
17. Jonathan Sondow, New Vacca-Type Rational Series for Euler's Constant and Its "Alternating" Analog
ln
4
n
, Additive Number Theory, Festschrift In Honor of the Sixtieth Birthday of Melvyn B. Nathanson
(D. Chudnovsky and G. Chudnovsky, eds.), Springer, 2010, pp. 331-340.
18. Sondow, An antisymmetric formula for Euler's constant, Math. Mag. 71(1998), No.3, pp.219-220.
19. Bruce C. Berndt, Ramanujans Notebooks, Part I, New York, Springer-Verlag, 1985, p.196.
20. Bruce C. Berndt and Tim Huber, A Fragment on Eulers Constant in Ramanujans Lost Notebook.
www.math.uiuc.edu/ ~berndt/ articles/ gamma.pdf
21. S. Ramanujan, The Lost Notebook and Other Unpublished Papers, 1988, Narosa Publishing House,
New Delhi.
22. Bruce C. Berndt and Douglas C. Bowman, Ramanujans short unpublished manuscript on integrals
and series related to Eulers constant, in Constructive, Experimental and Nonlinear Analysis, M.
Thera, ed., American Mathematical Society, Providence, RI, 2000, pp. 1927.
www.math.niu.edu/ ~bowman/ papers/ gamma.pdf