Introduction to the Gamma Function

 

(Click here for a Postscript version of this page.)

 

1  Introduction

The gamma function was first introduced by the Swiss mathematician Leonhard Euler (1707-1783) in his goal to generalize the factorial to non integer values. Later, because of its great importance, it was studied by other eminent mathematicians like Adrien-Marie Legendre (1752-1833), Carl Friedrich Gauss (1777-1855), Christoph Gudermann (1798-1852), Joseph Liouville (1809-1882), Karl Weierstrass (1815-1897), Charles Hermite (1822-1901), ... as well as many others.

The gamma function belongs to the category of the special transcendental functions and we will see that some famous mathematical constants are occurring in its study.

It also appears in various area as asymptotic series, definite integration, hypergeometric series, Riemann zeta function, number theory ...

Some of the historical background is due to Godefroy's beautiful essay on this function [9] and the more modern textbook [3] is a complete study.

2  Definitions of the gamma function

2.1  Definite integral

During the years 1729 and 1730 ([9], [12]), Euler introduced an analytic function which has the property to interpolate the factorial whenever the argument of the function is an integer. In a letter from January 8, 1730 to Christian Goldbach he proposed the following definition :

Definition 1 (Euler, 1730) Let x > 0
G(x)=
1

0 
( -log(t)) x-1dt.
(1)

By elementary changes of variables this historical definition takes the more usual forms :

Theorem 2 For x > 0
G(x)=


0 
tx-1e-tdt,
(2)
or sometimes
G(x)=2


0 
t2x-1e-t2dt.
(3)

Proof. Use respectively the changes of variable u=-log(t) and u2=-log(t) in (1).  

From this theorem, we see that the gamma function G(x) (or the Eulerian integral of the second kind) is well defined and analytic for x > 0 (and more generally for complex numbers x with positive real part).

The notation G(x) is due to Legendre in 1809 [11] while Gauss expressed it by P(x) (which represents G(x+1)).

The derivatives can be deduced by differentiating under the integral sign of (2)
G(x)
=



0 
tx-1e-tlog(t)dt,
   G(n)(x)
=



0 
tx-1e-tlogn(t)dt.

2.1.1  Functional equation

We have obviously
G(1)=


0 
e-tdt=1
(4)
and for x > 0, an integration by parts yields
G(x+1)=


0 
txe-tdt=[-txe-t]0+x


0 
tx-1e-tdt=xG(x),
(5)
and the relation G(x+1)= xG(x) is the important functional equation.

For integer values the functional equation becomes
G(n+1)=n!,
and it's why the gamma function can be seen as an extension of the factorial function to real non null positive numbers.

A natural question is to determine if the gamma function is the only solution of the functional equation ? The answer is clearly no as may be seen if we consider, for example, the functions cos(2mpx)G(x), where m is any non null integer and which satisfy both (4) and (5). But the following result states that under an additional condition the gamma function is the only solution of this equation.

Theorem 3 (Bohr-Mollerup, 1922, [6]) There is a unique function f: ]0,+[]0,+[ such as log(f(x)) is convex and
f(1)
=
1,
f(x+1)
=
xf(x).

Proof. An elementary one is given in [2].  

Other conditions may also work as well, see again [2].

It's also possible to extend this function to negative values by inverting the functional equation (which becomes a definition identity for -1 < x < 0)
G(x)=  G(x+1)

x
,
and for example G(-1/2)=-2G(1/2). Reiteration of this identity allows to define the gamma function on the whole real axis except on the negative integers (0,-1,-2,...). For any non null integer n, we have
G(x)=  G(x+n)

x(x+1)...(x+n-1)
       x+n > 0.
(6)
Suppose that x=-n+h with h being small, then
G(x)=  G(1+h)

h(h-1)...(h-n)
~  (-1)n

n!h
      when h0,
so G(x) possesses simple poles at the negative integers -n with residue (-1)n/n! (see the plot of the function).

In fact, also by mean of relation (6), the gamma function can be defined in the whole complex plane.



G(x) function

2.2  Another definition by Euler and Gauss

In another letter written in October 13, 1729 also to his friend Goldbach, Euler gave another equivalent definition for G(x).

Definition 4 (Euler, 1729 and Gauss, 1811) Let x > 0 and define
Gp(x)=  p!px

x(x+1)...(x+p)
=  px

x(1+x/1)...(1+x/p)
,
(7)
then
G(x)=
lim
p 
 Gp(x).
(8)

(Check the existence of this limit). This approach, using an infinite product, was also chosen, in 1811, by Gauss in his study of the gamma function [8].

Clearly
Gp(1)
=
 p!

1(1+1)...(1+p)
p=  p

p+1
, and
Gp(x+1)
=
 p!px+1

(x+1)...(x+p+1)
=  p

x+p+1
xGp(x),
hence
G(1)
=
1,
G(x+1)
=
xG(x).
We retrieve the functional equation verified by G(x).

It's interesting to observe that the definition is still valid for negative values of x, except on the poles (0,-1,-2,...). Using this formulation is often more convenient to establish new properties of the gamma function.

2.3  Weierstrass formula

The relation
px=exlog(p)=ex(log(p)-1-1/2-...-1/p)ex+x/2+...+x/p,
entails
Gp(x)
=
 1

x
 1

x+1
 2

x+2
...  p

x+p
px=  ex(log(p)-1-1/2-...-1/p)ex+x/2+...+x/p

x(1+x)(1+x/2)...(1+x/p)
,
Gp(x)
=
ex(log(p)-1-1/2-...-1/p)  1

x
 ex

1+x
 ex/2

1+x/2
 ex/p

1+x/p
.

Now Euler's constant is defined by
g =
lim
p 

1+  1

2
+...+  1

p
-log(p)
=0.5772156649015328606...,
and therefore follows the Weierstrass form of the gamma function.

Theorem 5 (Weierstrass) For any real number x, except on the negative integers (0,-1,-2,...), we have the infinite product
 1

G(x)
=xegx

p=1 

1+  x

p

e-x/p.
(9)

From this product we see that Euler's constant is deeply related to the gamma function and the poles are clearly the negative or null integers. According to Godefroy [9], Euler's constant plays in the gamma function theory a similar role as p in the circular functions theory.

It's possible to show that Weierstrass form is also valid for complex numbers.

3  Some special values of G(x)

Except for the integer values of x=n for which
G(n)=(n-1)!
some non integers values have a closed form.

The change of variable t=u2 gives
G(1/2)=


0 
 e-t

t
dt=2


0 
e-u2du=2



p

2
=

 

p
 
.

The functional equation (5) entails for positive integers n (see [1])
G
n+  1

2

=
 1.3.5...(2n-1)

2n


 

p
 
,
(10)
G
n+  1

3

=
 1.4.7...(3n-2)

3n
G
 1

3

,
G
n+  1

4

=
 1.5.9...(4n-3)

4n
G
 1

4

,
and for negative values
G
-n+  1

2

=  (-1)n2n

1.3.5...(2n-1)


 

p
 
.

No basic expression is known for G(1/3) or G(1/4), but it was proved that those numbers are transcendental (respectively by Le Lionnais in 1983 and Chudnovsky in 1984).

Up to 50 digits, the numerical values of some of those constants are :






G( 1/2) = 1.77245385090551602729816748334114518279754945612238...
G( 1/3) = 2.67893853470774763365569294097467764412868937795730...
G( 1/4) = 3.62560990822190831193068515586767200299516768288006...
G( 1/5) = 4.59084371199880305320475827592915200343410999829340...
.
For example, thanks to the very fast converging formula (which is based on the expression (34) and uses the Arithmetic-Geometric Mean AGM, [7])
G2( 1/4) =  (2p)3/2

AGM(2,1)
,
this constant was computed to more than 50 millions digits by P. Sebah and M. Tommila [10]. Similar formulae are available for other fractional arguments like G( 1/3) ...

4  Properties of the gamma function

4.1  The complement formula

There is an important identity connecting the gamma function at the complementary values x and 1-x. One way to obtain it is to start with Weierstrass formula (9) which yields
 1

G(x)
 1

G(-x)
=-x2egxe-gx

p=1 


1+  x

p

e-x/p
1-  x

p

ex/p
.
But the functional equation gives G(-x)=-G(1-x)/x and the equality writes as
 1

G(x)G(1-x)
=x

p=1 

1-  x2

p2

,
and using the well-known infinite product :
sin(p x)=p x

p=1 

1-  x2

p2

finally gives
G(x)G(1-x)=  p

sinpx
.
(11)

Relation (11) is the complement (or reflection) formula and is valid when x and 1-x are not negative or null integers and it was discovered by Euler.

For example, if we apply this formula for the values x=1/2, x=1/3, x=1/4 we find
G
 1

2

=


 

p
 
,
G
 1

3

G
 2

3

=
 2p3

3
,
G
 1

4

G
 3

4

=
p2.

4.2  Duplication and Multiplication formula

In 1809, Legendre obtained the following duplication formula [11].

Theorem 6 (Legendre, 1809)  
G(x)G(x+1/2)=



p

22x-1
G(2x).
(12)

Proof. Hint : an easy proof can lie on the expression of Gp(x) and Gp(x+1/2) from (7), then make the product and find the limit as p.  

Notice that by applying the duplication formula for x=1/2, we retrieve the value of G(1/2), while x=1/6 permits to compute
G
 1

6

=2-1/3   


 3

p
 
G2
 1

3

.

This theorem is the special case when n=2 of the more general result known as Gauss multiplication formula :

Theorem 7 (Gauss)
G( x) G
x+  1

n

G
x+  2

n

...G
x+  n-1

n

=(2p)(n-1)/2n1/2-nxG( nx)

Proof. Left as exercise.  

Corollary 8 (Euler)
G
 1

n

G
 2

n

...G
 n-1

n

=  (2p)(n-1)/2

n

Proof. Set x=1/n in the Gauss multiplication formula.  

4.3  Stirling's formula

It's of interest to study how the gamma function behaves when the argument x becomes large. If we restrict the argument x to integral values n, the following result, due to James Stirling (1692-1730) and Abraham de Moivre (1667-1754) is famous and of great importance :

Theorem 9 (Stirling-De Moivre, 1730) If the integer n tends to infinite we have the asymptotic formula
G(n+1)=n! ~

 

2pn
 
nne-n.
(13)

Proof. See [2] for a complete proof. You may obtain a weaker approximation by observing that the area under the curve log(x) with x [1,n] is well approximated by the trapezoidal rule, therefore

n

1 
log(x)dx
=
nlog(n)-n+1
=
n-1

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

2
+Rn=log((n-1)!)+  1

2
log(n)+Rn
and because Rn=O(1) (check this!), we find
log(n!) nlog(n)+  1

2
log(n)-n+C
which gives this weaker result
n! eCnnne-n.
 

Stirling's formula is remarkable because the pure arithmetic factorial function is equivalent to an expression containing important analytic constants like (2,p,e).

There is an elementary way to improve the convergence of Stirling's formula. Suppose you can write
n!=

 

2pn
 
nne-n
1+  a1

n
+  a2

n2
+...
,
then this relation is still valid for n+1
(n+1)!=

 

2p(n+1)
 
(n+1)(n+1)e-(n+1)
1+  a1

n+1
+  a2

(n+1)2
+...
(14)
but we also have (n+1)!=(n+1)n! giving
(n+1)!=(n+1)

 

2pn
 
nne-n
1+  a1

n
+  a2

n2
+...
.
(15)
We now compare relations (14) and (15) when n becomes large. This gives after some simplifications and classical series expansions

1+  a1

n
+  a2

n2
+...
=

1+  1

n

n+1/2

 
e-1
1+  a1

n+1
+  a2

(n+1)2
+...
=
1+  a1

n
+
a2-a1+  1

12

n2
+
 13

12
a1-2a2+a3-  1

12

n3
+...
and after the identification comes
-a1+  1

12
=
0,
 13

12
a1-2a2-  1

12
=
0,
...
Therefore we found, by elementary means, the first correcting terms of the formula to be : a1=1/12,a2=1/288,... A more efficient (but less elementary) way to find more terms is to use the Euler-Maclaurin asymptotic formula.

In fact the following theorem is a generalization of Stirling's formula valid for any real number x:

Theorem 10 When x, we have the famous Stirling's asymptotic formula [1]
G(x+1)=

 

2px
 
xxe-x
1+  1

12x
+  1

288x2
-  139

51840x3
-  571

2488320x4
...
.
(16)

For example here are some approximations of the factorial using different values for n:


n
n!
Stirling formula
+ correction 1/( 12n)
5
120
118
119
10
3628800
3598695
3628684
20
2432902008176640000
2422786846761133393
2432881791955971449

5  Series expansion

To estimate the gamma function near a point it's possible to use some series expansions at this point. Before doing this we need to introduce a new function which is related to the derivative of the gamma function.

5.1  The digamma and polygamma functions

Many of the series involving the gamma function and its derivatives may be derived from the Weierstrass formula. By taking the logarithm on both sides of the Weierstrass formula (9) we find the basic relation
-log(G(x))=log(x)+gx+

p=1 

log
1+  x

p

-  x

p

.
(17)

5.1.1  Definition

Definition 11



The psi or digamma function denoted Y(x) is defined for any non nul or negative integer by the logarithmic derivative of G(x), that is :
Y(x)=  d

dx
( log(G(x))) .

By differentiating the series (17) we find
Y(x)
=
 G(x)

G(x)
=-g-  1

x
+

p=1 

 1

p
-  1

x+p

,
=
-g+

p=1 

 1

p
-  1

x+p-1

    x 0,-1,-2,...
(18)
=
-g+

p=1 

 x-1

p(x+p-1)

    x 0,-1,-2,...
and those series are slowly converging for any non negative integer x.

5.1.2  Properties

Polygamma functions  

Now if we go on differentiating relation (18) several times, we find
Y(x)
=
 G(x)G(x)-G2(x)

G2(x)
=

p=1 
 1

(p+x-1)2
,
(19)
Y(x)
=
-

p=1 
 2

(p+x-1)3
,
Y(n)(x)
=


p=1 
 (-1)n+1n!

(p+x-1)n+1
,
(20)
and the Yn=Y(n) functions are the polygamma functions :
Yn(x)
=
 dn+1

dxn+1
( log(G(x))) ,
Y0(x)
=
Y(x).

Observe from (19) that for x > 0, Y(x) > 0 so it's a monotonous function on the positive axis and therefore the function log(G(x)) is convex when x > 0.

Recurrence relations  

The structure of the series expansion (18) suggests to study
Y(x+1)-Y(x)=

p=1 

 1

x+p-1
-  1

x+p

which gives, just like for the gamma function, the recurrence formulae
Y(x+1)
=
Y(x)+  1

x
,
Y(x+n)
=
Y(x)+  1

x
+  1

x+1
+...+  1

x+n-1
      n 1,
and by differentiating the first of those relations we deduce
Yn(x+1)=Yn(x)+  (-1)nn!

xn+1
.
(21)

Complement and duplication formulae  

By logarithmic differentiation of the corresponding complement (11) and duplication (12) formulae for the gamma function we find directly :

Theorem 12
Y(1-x)
=
Y(x)+pcotpx,
Y(2x)
=
 1

2
Y(x)+  1

2
Y
x+  1

2

+log(2).

5.1.3  Special values of the Yn

Values at integer arguments  

From the relations (18) and (20) comes
Y(1)
=
-g,
Y1(1)
=
z(2)=p2/6,
Y2(1)
=
-2z(3),
Yn(1)
=
(-1)n+1n!z(n+1),
(22)
where z(k) is the classical Riemann zeta function. Using the recurrence relations (21) allow to compute those values for any other positive integer and, for example, we have
Y(n)
=
 G(n)

G(n)
=-g+

p=1 
n-1  1

p
(23)
=
-g+Hn-1.

Values at rational arguments  

The value Y(1/2) can be computed directly from (18) or from the psi duplication formula with x=1/2:
Y
 1

2

=
-g-2+2

p=1 

 1

2p
-  1

2p+1

,
=
-g-2+2( 1-log(2)) = -g-2log(2).

To end this section we give the interesting identities
Y
 1

3

=
-g-  3

2
log(3)-  3

6
p,
Y
 1

4

=
-g-3log(2)-  p

2
,
Y
 1

6

=
-g-2log(2)-  3

2
log(3)-  3

2
p.
which are consequences of a more general and remarkable result :

Theorem 13 (Gauss) Let 0 < p < q being integers
Y
 p

q

=-g-  p

2
cot
 pp

q

-log( 2q) + q-1

k=1 
cos
 2pkp

q

log
sin
 pk

q


.

Proof. See [2] for a proof.  

From this aesthetic relation, we see that the computation of Y(p/q) for any rational argument always involves the three fundamental mathematical constants : p,g,log(2) !

5.1.4  Series expansions of the digamma function

The following series expansions are easy consequences of relations (22) and of the series
 1

1+x
-1=-

k=2 
(-1)kxk-1.

Theorem 14 (Digamma series)
Y(1+x)
=
-g+

k=2 
(-1)kz(k)xk-1   |x| < 1,
(24)
Y(1+x)
=
-  1

1+x
-(g-1)+

k=2 
(-1)k(z(k)-1) xk-1   | x| < 1.
(25)

5.1.5  Zeros of the digamma function

The zeros of the digamma function are the extrema of the gamma function. From the two relations
Y(1)
=
-g < 0
Y(2)
=
1-g > 0,
and because Y(x) > 0, we see that the only positive zero x0 of the digamma function is in ]1,2[ and its first 50 digits are :
x0
=
1.46163214496836234126265954232572132846819620400644...
G(x0)
=
0.88560319441088870027881590058258873320795153366990...,
it was first computed by Gauss, Legendre [11] and given in [13]. On the negative axis, the digamma function has a single zero between each consecutive negative integers (the poles of the gamma function), the first one up to 50 decimal places are








x1=-0.504083008264455409258269304533302498955385182368579...
x2=-1.573498473162390458778286043690434612655040859116846...
x3=-2.610720868444144650001537715718724207951074010873480...
x4=-3.635293366436901097839181566946017713948423861193530...
x5=-4.653237761743142441714598151148207363719069416133868...
and Hermite (1881) observed that when n becomes large [1]
xn=-n+  1

log(n)
+o
 1

log2(n)

.



Y(x) function (digamma)

5.2  Series expansion of the gamma function

Finding series expansions for the gamma function is now an easy consequence of the series expansions for the digamma function.

Theorem 15
log(G(1+x))
=
-gx+

k=2 
 (-1)kz(k)

k
xk,   | x| < 1,
(26)
log(G(1+x))
=
-log(1+x)-(g-1)x+

k=2 
 (-1)k( z(k)-1)

k
xk,   | x| < 1.
(27)

Proof. Use the term by term integration of the Taylor series (24) and (25).  

We may observe that the Riemann zeta function at integer values appears in the series expansion of the logarithm of the gamma function. The convergence of the series can be accelerated by computing
 1

2
( log(G(1+x))-log(G(1-x))) = -  1

2
log
 1+x

1-x

-(g-1)x-

k=2 
 ( z(2k+1)-1)

2k+1
x2k+1,
We now observe that the complement formula (11) becomes
G(1+x)G(1-x)=  px

sinpx
and by taking the logarithms finally
 1

2
log( G(1+x)) +  1

2
( logG(1-x)) =  1

2
log
 px

sinpx

and therefore we obtain the fast converging series due to Legendre :
log( G(1+x)) =  1

2
log
 px

sinpx

-  1

2
log
 1+x

1-x

-(g-1)x-

k=1 
 (z(2k+1)-1)

2k+1
x2k+1,
(28)
valid for | x| < 1.

Gauss urged to his calculating prodigy student Nicolai (1793-1846) to compute tables of log( G(x)) with twenty decimal places [8]. More modern tables related to G(x) and Y(x) are available in [1].

6  Euler's constant and the gamma function

For x=1 the formula (23) for Y(n) yields
Y(1)=G(1)=-g-1+H1=-g,
so Euler's constant is the opposite of the derivative of the gamma function at x=1.

6.1  Euler-Mascheroni Integrals

Using the integral representation of G(x) gives the interesting integral formula for Euler's constant
G(1)=


0 
e-tlog(t)dt=-g
and from (19) comes
Y(1)G2(1)+G2(1)=G(1)G(1)
hence
G(1)=


0 
e-tlog2(t)dt=g2+  p2

6
.
We may go on like this and compute the Euler-Mascheroni integrals
G(3)(1)
=
-g3-  1

2
p2g-2z(3),
G(4)(1)
=
g4+p2g2+8z(3)g+  3

20
p4,
G(5)(1)
=
-g5-  5

3
p2g3-20z(3)g2-  3

4
p4g-24z(5)-  10

3
z(3)p2,
...

6.2  Euler's constant and the zeta function at integer values

Series formulas involving z(k) can also be deduced from formula (26). Taking x=1 gives
log(G(2))=-g+

k=2 
 (-1)kz(k)

k
,
thus
g =

k=2 
 (-1)kz(k)

k
,
which is due to Euler. Setting x=1/2 into (26) gives
log
G
 3

2


=log(

 

p
 
/2)=-  g

2
+

k=2 
 (-1)kz(k)

k
 1

2k
,
therefore


g = log
 4

p

+2

k=2 
(-1)k  z(k)

2kk
.

It is of interest to use the series expansion (28) at x=1/2,
log( G(3/2)) =  1

2
log
 p

2

-  1

2
log( 3) -  1

2
(g-1)-

k=1 
 (z(2k+1)-1)

2k+1
 1

22k+1
.
It follows a fast converging expansion for g
g = 1-log
 3

2

-

k=1 
 (z(2k+1)-1)

(2k+1)4k
.
and for large values of k, we have
z(2k+1)-1=  1

22k+1
+  1

32k+1
+ ~  1

22k+1
   hence     z(2k+1)-1

4k
~  1

2
 1

16k
.
This expression was used by Thomas Stieltjes (1856-1894) in 1887 to compute Euler's constant up to 32 decimal places [14]. In the same article he also computed z(2) up to z(70) with 32 digits.

7  The gamma function and the Riemann Zeta function

The integral definition of the gamma function
G(x)=


0 
tx-1e-tdt,
together with the change of variables t=ku (with k a positive integer) yields
G(x)=


0 
(ku)x-1e-kuk du=kx


0 
ux-1e-ku du.
We write this in the form


 1

kx
=  1

G(x)



0 
ux-1e-kudu,
hence by summation


k=1 
 1

kx
=
 1

G(x)



0 
ux-1

k=1 
( e-ku) du
=
 1

G(x)



0 
ux-1
 1

1-e-u
-1
du.

We have obtained the beautiful formula
z(x)G(x)=


0 
 tx-1

et-1
dt
(29)
and, for example, for x=2, (29) becomes
 p2

6
=


0 
 t

et-1
dt.

There is another celebrated and most important functional equation between those two functions, the Riemann zeta function functional equation :

Theorem 16 (Riemann, 1859) Let
L(s)=p-s/2G
 s

2

z(s),
an analytic function except at poles 0 and 1, then
L(s)=L(1-s).

Proof. Several proofs may be found in [15]. Euler demonstrated it for integer values of s.  

This equation allows to extend the definition of the Zeta function to negative values of the arguments.

8  The Beta function

Let us now consider the useful and related function to the gamma function which occurs in the computation of many definite integrals. It's defined, for x > 0 and y > 0 by the two equivalent identities :

Definition 17 The beta function (or Eulerian integral of the first kind) is given by
B(x,y)
=

1

0 
tx-1(1-t)y-1dt
(30)
=
2
p/2

0 
sin(t)2x-1cos(t)2y-1dt=2
p/2

0 
sin(t)2y-1cos(t)2x-1dt,
(31)
=
B(y,x).

This definition is also valid for complex numbers x and y such as (x) > 0 and (y) > 0 and Euler gave (30) in 1730. The name beta function was introduced for the first time by Jacques Binet (1786-1856) in 1839 [5] and he made various contributions on the subject.

The beta function is symmetric and may be computed by mean of the gamma function thanks to the important property :

Theorem 18 Let (x) > 0 and (y) > 0, then
B(x,y)=  G(x)G(y)

G(x+y)
=B(y,x).
(32)

Proof. We use the definite integral (3) and form the following product
G(x)G(y)
=
4


0 
u2x-1e-u2du


0 
v2y-1e-v2dv
=
4


0 



0 
e-(u2+v2) u2x-1v2y-1dudv,
we introduce the polar variables u=rcosq, v=rsinq  so that
G(x)G(y)
=
4


0 

p/2

0 
e-r2r2(x+y)-1cos2x-1qsin2y-1qdrdq
=
2


0 
r2(x+y)-1e-r2dr.2
p/2

0 
cos2x-1qsin2y-1qdq
=
G(x+y)B(y,x).
 

From relation (32) follows
B(x+1,y)=  G(x+1)G(y)

G(x+y+1)
=  xG(x)G(y)

(x+y)G(x+y)
=  x

x+y
B(x,y),
this is the beta function functional equation
B(x+1,y)=  x

x+y
B(x,y).
(33)

8.1  Special values


B
 1

2
,  1

2

=
p,
B
 1

3
,  2

3

=
 23

3
p,
B
 1

4
,  3

4

=
p2,
B(x,1-x)
=
 p

sin(px)
,
B(x,1)
=
 1

x
,
B(x,n)
=
 (n-1)!

x.(x+1)...(x+n-1)
    n 1,
B(m,n)
=
 (m-1)!(n-1)!

(m+n-1)!
    m 1,n 1.

8.2  Wallis's integrals

For example the following integrals (Wallis's integrals)
Wn=
p/2

0 
sinnqdq =
p/2

0 
cosnqdq,
may be computed by mean of the beta and gamma functions. Thanks to the relation (31), we have
Wn=  1

2
B
 n+1

2
,  1

2

,
and come naturally the two cases n=2p+1 and n=2p. For the odd values of the argument n:
W2p+1=  1

2
B
p+1,  1

2

=  G(p+1)G(1/2)

2G(p+3/2)
=  p!G(1/2)

(2p+1)G(p+1/2)
and using formula (10) produces the well-known result
W2p+1=  2pp!

1.3.5...(2p+1)
=  4pp!2

(2p+1)!
.
The same method permits to compute the integrals for the even values
W2p=  1

2
B
p+  1

2
,  1

2

=  G(p+1/2)G(1/2)

2G(p+1)
and finally
W2p=  1.3.5...(2p-1)

2p+1p!
p =  (2p)!

4pp!2
 p

2
.

Observe that it's easy to see that
Wn+2=  1

2
B
 n+2+1

2
,  1

2

=  1

2
B
 n+1

2
+1,  1

2

=  (n+1)/2

n/2+1
Wn=
 n+1

n+2

Wn
thanks to the beta function functional equation (33).

It's interesting to notice that
Wa=  1

2
B
 a+1

2
,  1

2

also works for any real number a > -1 and therefore we may deduce using (30) and (31) that (respectively with a = -1/2 and a = 1/2)

p/2

0 
 dq




sinq
=

1

0 
 2dt




1-t4
=  G2(1/4)

2


2p
,
(34)

p/2

0 


 

sinq
 
dq
=

1

0 
 2t2dt




1-t4
=  (2p)3/2

G2(1/4)
.
Consequently the product of those two integrals permits to derive the relation due to Euler

1

0 
 dt




1-t4

1

0 
 t2dt




1-t4
=  p

4
.

References

[1]
M. Abramowitz and I. Stegun, Handbook of Mathematical Functions, Dover, New York, (1964)

[2]
G.E. Andrews, R. Askey and R. Roy, Special functions, Cambridge University Press, Cambridge, (1999)

[3]
E. Artin, The Gamma Function, New York, Holt, Rinehart and Winston, (1964)

[4]
E.W. Barnes, The theory of the gamma function, Messenger Math. (2), (1900), vol. 29, p. 64-128.

[5]
J.P.M Binet, Journal école polyt., (1839), vol. 16, p. 131

[6]
H. Bohr and I. Mollerup, Loerbog I matematisk Analyse, Kopenhagen, (1922), vol. 3

[7]
J.M. Borwein and I.J. Zucker, Elliptic integral evaluation of the Gamma function at rational values of small denominator, IMA J. of Numer Analysis, (1992), vol. 12, p .519-526

[8]
C.F. Gauss, Werke, Göttingen, (1866-1933), vol. 3

[9]
M. Godefroy, La fonction Gamma ; Théorie, Histoire, Bibliographie, Gauthier-Villars, Paris, (1901)

[10]
X. Gourdon and P. Sebah, Numbers, Constants and Computation, World Wide Web site at the adress : http://numbers.computation.free.fr/Constants/constants.html, (1999)

[11]
A.M. Legendre, Mémoires de la classe des sciences mathématiques et physiques de l'Institut de France, Paris, (1809), p. 477, 485, 490

[12]
N. Nielsen, Handbuch der Theorie der Gammafunktion, Leipzig, (1906)

[13]
W. Sibagaki, Theory and applications of the gamma function, Iwanami Syoten, Tokyo, Japan, (1952)

[14]
T.J. Stieltjes, Tables des valeurs des sommes Sk=n=1n-k,Acta Mathematica, (1887), vol. 10, p. 299-302

[15]
E.C. Titchmarsh, The theory of the Riemann Zeta-function, Oxford Science publications, second edition, revised by D.R. Heath-Brown (1986)



Back to Numbers, Constants and Computation


File translated from TEX by TTH, version 3.01.

On 4 Feb 2002, 17:23.