The gamma function Γ(x) extends the factorial n! beyond the integers to the real numbers, and further to the complex numbers1. For x>0 it is defined by the following integral.
Γ(x)=∫0∞tx−1e−tdt
Relation to the factorial
Integration by parts yields the recurrence Γ(x+1)=xΓ(x), and for a positive integer n we have Γ(n)=(n−1)!.
n
Γ(n)
(n−1)!
1
1
0!=1
2
1
1!=1
3
2
2!=2
4
6
3!=6
5
24
4!=24
The offset of 1 in the index is a convention of the definition; Γ(x+1) corresponds to the factorial more directly.
Domain
The recurrence extends the function to x≤0, but at x=0,−1,−2,… the value diverges to infinity. The domain is therefore every real number except those. Writing Γ(x)=xΓ(x+1) makes the divergence plain: the denominator goes to 0 as x→0.
Asymptotes and limits
There is a vertical asymptote at each of x=0,−1,−2,…. As x→+∞ the function grows as sharply as the factorial, and as x→0+ it diverges to +∞. On the negative side, narrow spikes reaching to ±∞ stand between consecutive integers, changing sign from one gap to the next.
Monotonicity and extremum
On x>0 the gamma function is logarithmically convex and attains a minimum at a single point.
Item
Value
x at the minimum
≈1.4616
Γ(x) there
≈0.8856
That valley lies between the two points where Γ(1)=Γ(2)=1. To its left the function decreases and to its right it increases.
Special values and identities
At the half-integers it takes beautiful values.
Γ(21)=π
This is tied to the Gaussian integral. The reflection formula also holds.
Γ(x)Γ(1−x)=sin(πx)π
Substituting x=21 recovers the value above. That sin(πx) on the right vanishes at the integers corresponds to the gamma function diverging there.
Applications and history
Euler introduced it in the eighteenth century as the problem of interpolating the factorial, and the symbol Γ is due to Legendre2.
Probability distributions such as the gamma and beta distributions
A basic special function of complex analysis
The continuous version of the binomial coefficient in combinatorics