Gamma function
Template:Infobox mathematical function
In mathematics, the gamma function (represented by Γ, the capital letter gamma from the Greek alphabet) is one commonly used extension of the factorial function to complex numbers. The gamma function is defined for all complex numbers except the nonpositive integers. For any positive integer n, [math]\displaystyle{ \Gamma(n) = (n1)!\ . }[/math]
Derived by Daniel Bernoulli, for complex numbers with a positive real part, the gamma function is defined via a convergent improper integral:
[math]\displaystyle{ \Gamma(z) = \int_0^\infty x^{z1} e^{x}\,dx, \ \qquad \Re(z) \gt 0\ . }[/math]
The gamma function then is defined as the analytic continuation of this integral function to a meromorphic function that is holomorphic in the whole complex plane except zero and the negative integers, where the function has simple poles.
The gamma function has no zeroes, so the reciprocal gamma function 1/Γ(z) is an entire function. In fact, the gamma function corresponds to the Mellin transform of the negative exponential function:
[math]\displaystyle{ \Gamma(z) = \mathcal M \{e^{x} \} (z). }[/math]
Other extensions of the factorial function do exist, but the gamma function is the most popular and useful. It is a component in various probabilitydistribution functions, and as such it is applicable in the fields of probability and statistics, as well as combinatorics.
Motivation
The gamma function can be seen as a solution to the following interpolation problem:
 "Find a smooth curve that connects the points (x, y) given by y = (x − 1)! at the positive integer values for x."
A plot of the first few factorials makes clear that such a curve can be drawn, but it would be preferable to have a formula that precisely describes the curve, in which the number of operations does not depend on the size of x. The simple formula for the factorial, x! = 1 × 2 × ⋯ × x, cannot be used directly for noninteger values of x since it is only valid when x is a natural number (or positive integer). There are, relatively speaking, no such simple solutions for factorials; no finite combination of sums, products, powers, exponential functions, or logarithms will suffice to express x!; but it is possible to find a general formula for factorials using tools such as integrals and limits from calculus. A good solution to this is the gamma function.^{[1]}
There are infinitely many continuous extensions of the factorial to nonintegers: infinitely many curves can be drawn through any set of isolated points. The gamma function is the most useful solution in practice, being analytic (except at the nonpositive integers), and it can be defined in several equivalent ways. However, it is not the only analytic function which extends the factorial, as adding to it any analytic function which is zero on the positive integers, such as k sin mπx for an integer m, will give another function with that property.^{[1]}
A more restrictive property than satisfying the above interpolation is to satisfy the recurrence relation defining a translated version of the factorial function,^{[2]}^{[3]}
 [math]\displaystyle{ f(1) = 1, }[/math]
 [math]\displaystyle{ f(x+1) = x f(x), }[/math]
for any positive real number x. But this would allow for multiplication by any function g(x) satisfying both g(x) = g(x+1) for all real numbers x and g(0) = 1, such as the function g(x) = e^{ k sin 2mπx}. One of several ways to finally resolve the ambiguity comes from the Bohr–Mollerup theorem. It states that when the condition that f be logarithmically convex (or "superconvex,"^{[4]} meaning that [math]\displaystyle{ \ln \circ f }[/math] is convex) is added, it uniquely determines f for positive, real inputs. From there, the gamma function can be extended to all real and complex values (except the negative integers and zero) by using the unique analytic continuation of f.^{[5]}
Definition
Main definition
The notation [math]\displaystyle{ \Gamma (z) }[/math] is due to Legendre.^{[1]} If the real part of the complex number z is strictly positive ([math]\displaystyle{ \Re (z) \gt 0 }[/math]), then the integral
 [math]\displaystyle{ \Gamma(z) = \int_0^\infty x^{z1} e^{x}\, dx }[/math]
converges absolutely, and is known as the Euler integral of the second kind. (Euler's integral of the first kind is the beta function.^{[1]}) Using integration by parts, one sees that:
 [math]\displaystyle{ \begin{align} \Gamma(z+1) & = \int_0^\infty x^{z} e^{x} \, dx \\ &= \Bigl[x^z e^{x}\Bigr]_0^\infty + \int_0^\infty z x^{z1} e^{x}\, dx \\ &= \lim_{x\to \infty}\left(x^z e^{x}\right)  \left(0^z e^{0}\right) + z\int_0^\infty x^{z1} e^{x}\, dx. \end{align} }[/math]
Recognizing that [math]\displaystyle{ x^z e^{x}\to 0 }[/math] as [math]\displaystyle{ x\to \infty, }[/math]
 [math]\displaystyle{ \begin{align} \Gamma(z+1) & = z\int_0^\infty x^{z1} e^{x}\, dx \\ &= z\Gamma(z). \end{align} }[/math]
We can calculate [math]\displaystyle{ \Gamma(1) }[/math]:
 [math]\displaystyle{ \begin{align} \Gamma(1) & = \int_0^\infty x^{11} e^{x}\,dx \\ & = \Big[e^{x}\Big]_0^\infty \\ & = \lim_{x\to \infty} \left(e^{x}\right)  \left(e^{0}\right) \\ & = 0  (1) \\ & = 1. \end{align} }[/math]
Given that [math]\displaystyle{ \Gamma(1) = 1 }[/math] and [math]\displaystyle{ \Gamma(n+1) = n\Gamma(n), }[/math]
 [math]\displaystyle{ \Gamma(n) = 1 \cdot 2 \cdot 3 \cdots (n1) = (n1)! }[/math]
for all positive integers n. This can be seen as an example of proof by induction.
The identity [math]\displaystyle{ \Gamma(z) = \frac {\Gamma(z + 1)} {z} }[/math] can be used (or, yielding the same result, analytic continuation can be used) to uniquely extend the integral formulation for [math]\displaystyle{ \Gamma (z) }[/math] to a meromorphic function defined for all complex numbers z, except integers less than or equal to zero.^{[1]} It is this extended version that is commonly referred to as the gamma function.^{[1]}
Alternative definitions
Euler's definition as an infinite product
When seeking to approximate [math]\displaystyle{ z! }[/math] for a complex number [math]\displaystyle{ z }[/math], it is effective to first compute [math]\displaystyle{ n! }[/math] for some large integer [math]\displaystyle{ n }[/math]. Use that to approximate a value for [math]\displaystyle{ (n+z)! }[/math], and then use the recursion relation [math]\displaystyle{ m! = m(m1)! }[/math] backwards [math]\displaystyle{ n }[/math] times, to unwind it to an approximation for [math]\displaystyle{ z! }[/math].^{[clarification needed]} Furthermore, this approximation is exact in the limit as [math]\displaystyle{ n }[/math] goes to infinity.
Specifically, for a fixed integer [math]\displaystyle{ m }[/math], it is the case that
 [math]\displaystyle{ \lim_{n \to \infty} \frac{n! \, \left(n+1\right)^m}{(n+m)!} = 1\,. }[/math]
If [math]\displaystyle{ m }[/math] is not an integer then it is not possible to say whether this equation is true because we have not yet (in this section) defined the factorial function for nonintegers. However, we do get a unique extension of the factorial function to the nonintegers by insisting that this equation continue to hold when the arbitrary integer [math]\displaystyle{ m }[/math] is replaced by an arbitrary complex number [math]\displaystyle{ z }[/math].
 [math]\displaystyle{ \lim_{n \to \infty} \frac{n! \, \left(n+1\right)^z}{(n+z)!} = 1\,. }[/math]
Multiplying both sides by [math]\displaystyle{ z! }[/math] gives
 [math]\displaystyle{ \begin{align} z! &= \lim_{n \to \infty} n!\frac{z!}{(n+z)!} (n+1)^z \\[8pt] &= \lim_{n \to \infty} (1 \cdots n)\frac{1}{(1+z) \cdots (n+z)} \left(\frac{2}{1} \cdot \frac{3}{2} \cdots \frac{n+1}{n}\right)^z \\[8pt] &= \prod_{n=1}^\infty \left[ \frac{1}{1+\frac{z}{n}} \left(1 + \frac{1}{n}\right)^z \right]. \end{align} }[/math]
This infinite product converges for all complex numbers [math]\displaystyle{ z }[/math] except the negative integers, which fail because trying to use the recursion relation [math]\displaystyle{ m! = m(m  1)! }[/math] backwards through the value [math]\displaystyle{ m=0 }[/math] involves a division by zero.
Similarly for the gamma function, the definition as an infinite product due to Euler is valid for all complex numbers [math]\displaystyle{ z }[/math] except the nonpositive integers:
 [math]\displaystyle{ \Gamma(z) = \frac{1}{z} \prod_{n=1}^{\infty} \frac{\left(1 + \frac{1}{n}\right)^z}{1+\frac{z}{n}} \,. }[/math]
By this construction, the gamma function is the unique function that simultaneously satisfies [math]\displaystyle{ \Gamma(1) = 1 }[/math], [math]\displaystyle{ \Gamma(z+1) = z \Gamma(z) }[/math] for all complex numbers [math]\displaystyle{ z }[/math] except the nonpositive integers, and [math]\displaystyle{ \lim_{n \to \infty} \frac{\Gamma(n+z)}{\Gamma(n)\;n^z} = 1 }[/math] for all complex numbers [math]\displaystyle{ z }[/math].^{[1]}
Weierstrass's definition
The definition for the gamma function due to Weierstrass is also valid for all complex numbers z except the nonpositive integers:
 [math]\displaystyle{ \Gamma(z) = \frac{e^{\gamma z}} z \prod_{n=1}^\infty \left(1 + \frac z n \right)^{1} e^{z/n}, }[/math]
where [math]\displaystyle{ \gamma \approx 0.577216 }[/math] is the Euler–Mascheroni constant.^{[1]} This is the Hadamard Product of [math]\displaystyle{ 1/\Gamma(z) }[/math] in a rewritten form. Indeed, since [math]\displaystyle{ 1/\Gamma(z) }[/math] is entire of genus 1 with a simple zero at [math]\displaystyle{ z=0 }[/math], we have the product representation
 [math]\displaystyle{ \frac{1}{\Gamma(z)} = z e^{Az+B} \prod_{\rho} \left(1\frac{z}{\rho} \right)e^{z/\rho}, }[/math]
where the product is over the zeros [math]\displaystyle{ \rho\neq0 }[/math] of [math]\displaystyle{ 1/\Gamma(z) }[/math]. Since [math]\displaystyle{ \Gamma(z) }[/math] has simple poles at the nonpositive integers, it follows [math]\displaystyle{ 1/\Gamma(z) }[/math] has simple zeros at the nonpositive integers, and so the equation above becomes Weierstrass's formula with [math]\displaystyle{ AzB }[/math] in place of [math]\displaystyle{ \gamma z }[/math]. The derivation of the constants [math]\displaystyle{ A=\gamma }[/math] and [math]\displaystyle{ B=0 }[/math] is somewhat technical, but can be accomplished by using some identities involving the Riemann zeta function (see this identity, for instance). See also the Weierstrass factorization theorem.
In terms of generalized Laguerre polynomials
A representation of the incomplete gamma function in terms of generalized Laguerre polynomials is
 [math]\displaystyle{ \Gamma(z,x)=x^z e^{x} \sum_{n=0}^\infty \frac{L_n ^{(z)}(x)}{n+1}, }[/math]
which converges for [math]\displaystyle{ \Re (z) \gt 1 }[/math] and [math]\displaystyle{ x\gt 0 }[/math].^{[6]}
Properties
General
Other important functional equations for the gamma function are Euler's reflection formula
 [math]\displaystyle{ \Gamma(1z) \Gamma(z) = \frac{\pi}{\sin \pi z}, \qquad z \not\in \Z }[/math]
which implies
 [math]\displaystyle{ \Gamma(z  n) = (1)^{n1} \; \frac{\Gamma(z) \Gamma(1+z)}{\Gamma(n+1z)}, \qquad n \in \Z }[/math]
and the Legendre duplication formula
 [math]\displaystyle{ \Gamma(z) \Gamma\left(z + \tfrac12\right) = 2^{12z} \; \sqrt{\pi} \; \Gamma(2z). }[/math]
Derivation of Euler's reflection formula


Since [math]\displaystyle{ e^{t}=\lim_{n\to \infty} \left(1\frac{t}{n}\right)^n, }[/math] the gamma function can be represented as
Integrating by parts [math]\displaystyle{ n }[/math] times yields
which is equal to
This can be rewritten as
We can use this to evaluate the lefthand side of the reflection formula:
It can be proved that
Then
Euler's reflection formula follows:

Derivation of the Legendre duplication formula


The beta function can be represented as
Setting [math]\displaystyle{ z_1=z_2=z }[/math] yields
After the substitution [math]\displaystyle{ t=\frac{1+x}{2} }[/math] we get
The function [math]\displaystyle{ (1x^2)^{z1} }[/math] is even, hence
Now assume
Then
This implies
Since
the Legendre duplication formula follows:

The duplication formula is a special case of the multiplication theorem (See,^{[6]} Eq. 5.5.6)
 [math]\displaystyle{ \prod_{k=0}^{m1}\Gamma\left(z + \frac{k}{m}\right) = (2 \pi)^{\frac{m1}{2}} \; m^{\frac12  mz} \; \Gamma(mz). }[/math]
A simple but useful property, which can be seen from the limit definition, is:
 [math]\displaystyle{ \overline{\Gamma(z)} = \Gamma(\overline{z}) \; \Rightarrow \; \Gamma(z)\Gamma(\overline{z}) \in \mathbb{R} . }[/math]
In particular, with z = a + bi, this product is
 [math]\displaystyle{ \Gamma(a+bi)^2 = \Gamma(a)^2 \prod_{k=0}^\infty \frac{1}{1+\frac{b^2}{(a+k)^2}} }[/math]
If the real part is an integer or a halfinteger, this can be finitely expressed in closed form:
 [math]\displaystyle{ \begin{align} \Gamma(bi)^2 & = \frac{\pi}{b\sinh \pi b} \\[6pt] \left\Gamma\left(\tfrac{1}{2}+bi\right)\right^2 & = \frac{\pi}{\cosh \pi b} \\ \left\Gamma\left(1+bi\right)\right^2 & = \frac{\pi b}{\sinh \pi b} \\ \left\Gamma\left(1+n+bi\right)\right^2 & = \frac{\pi b}{\sinh \pi b} \prod_{k=1}^n \left(k^2 + b^2 \right), \quad n \in \N \\ \left\Gamma\left(n+bi\right)\right^2 & = \frac{\pi}{b \sinh \pi b} \prod_{k=1}^n \left(k^2 + b^2 \right)^{1}, \quad n \in \N \\ \left\Gamma\left(\tfrac{1}{2} \pm n+bi\right)\right^2 & = \frac{\pi}{\cosh \pi b} \prod_{k=1}^n \left(\left( k\tfrac{1}{2}\right)^2 + b^2 \right)^{\pm 1}, \quad n \in \N \end{align} }[/math]
Proof of absolute value formulas for arguments of integer or halfinteger real part


First, consider the reflection formula applied to [math]\displaystyle{ z=bi }[/math].
Applying the recurrence relation to the second term, we have
which with simple rearrangement gives
Second, consider the reflection formula applied to [math]\displaystyle{ z=\tfrac{1}{2}+bi }[/math].
Formulas for other values of [math]\displaystyle{ z }[/math] for which the real part is integer or halfinteger quickly follow by induction using the recurrence relation in the positive and negative directions. 
Perhaps the bestknown value of the gamma function at a noninteger argument is
 [math]\displaystyle{ \Gamma\left(\tfrac12\right)=\sqrt{\pi}, }[/math]
which can be found by setting [math]\displaystyle{ z = \frac{1}{2} }[/math] in the reflection or duplication formulas, by using the relation to the beta function given below with [math]\displaystyle{ x = y = \frac{1}{2} }[/math], or simply by making the substitution [math]\displaystyle{ u = \sqrt{x} }[/math] in the integral definition of the gamma function, resulting in a Gaussian integral. In general, for nonnegative integer values of [math]\displaystyle{ n }[/math] we have:
 [math]\displaystyle{ \begin{align} \Gamma\left(\tfrac 1 2 + n\right) &= {(2n)! \over 4^n n!} \sqrt{\pi} = \frac{(2n1)!!}{2^n} \sqrt{\pi} = \binom{n\frac{1}{2}}{n} n! \sqrt{\pi} \\[8pt] \Gamma\left(\tfrac 1 2  n\right) &= {(4)^n n! \over (2n)!} \sqrt{\pi} = \frac{(2)^n}{(2n1)!!} \sqrt{\pi} = \frac{\sqrt{\pi}}{\binom{1/2}{n} n!} \end{align} }[/math]
where the double factorial [math]\displaystyle{ (2n1)!! = (2n1)(2n3)\cdots(3)(1) }[/math]. See Particular values of the gamma function for calculated values.
It might be tempting to generalize the result that [math]\displaystyle{ \Gamma \left( \frac{1}{2} \right) = \sqrt\pi }[/math] by looking for a formula for other individual values [math]\displaystyle{ \Gamma(r) }[/math] where [math]\displaystyle{ r }[/math] is rational, especially because according to Gauss's digamma theorem, it is possible to do so for the closely related digamma function at every rational value. However, these numbers [math]\displaystyle{ \Gamma(r) }[/math] are not known to be expressible by themselves in terms of elementary functions. It has been proved that [math]\displaystyle{ \Gamma (n + r) }[/math] is a transcendental number and algebraically independent of [math]\displaystyle{ \pi }[/math] for any integer [math]\displaystyle{ n }[/math] and each of the fractions [math]\displaystyle{ r = \frac{1}{6}, \frac{1}{4}, \frac{1}{3}, \frac{2}{3}, \frac{3}{4}, \frac{5}{6} }[/math].^{[7]} In general, when computing values of the gamma function, we must settle for numerical approximations.
The derivatives of the gamma function are described in terms of the polygamma function. For example:
 [math]\displaystyle{ \Gamma'(z)=\Gamma(z)\psi_0(z). }[/math]
For a positive integer m the derivative of the gamma function can be calculated as follows (here [math]\displaystyle{ \gamma }[/math] is the Euler–Mascheroni constant):
 [math]\displaystyle{ \Gamma'(m+1) = m! \left(  \gamma + \sum_{k=1}^m\frac{1}{k} \right)\,. }[/math]
For [math]\displaystyle{ \Re(x) \gt 0 }[/math] the [math]\displaystyle{ n }[/math]th derivative of the gamma function is:
 [math]\displaystyle{ \frac{d^n}{dx^n}\Gamma(x) = \int_0^\infty t^{x1} e^{t} (\ln t)^n \, dt. }[/math]
(This can be derived by differentiating the integral form of the gamma function with respect to [math]\displaystyle{ x }[/math], and using the technique of differentiation under the integral sign.)
Using the identity
 [math]\displaystyle{ \Gamma^{(n)}(1)=(1)^n n!\sum\limits_{\pi\,\vdash \, n}\,\prod_{i=1}^r\frac{\zeta^*(a_i)}{k_i!\cdot a_i} \qquad \zeta^*(x):=\begin{cases}\zeta(x)&x\ne1\\ \gamma&x=1\end{cases} }[/math]
where [math]\displaystyle{ \zeta(z) }[/math] is the Riemann zeta function, and [math]\displaystyle{ \pi }[/math] is a partition of [math]\displaystyle{ n }[/math] given by
 [math]\displaystyle{ \pi=\underbrace{a_1+\cdots+a_1}_{k_1 \text{ terms}} + \cdots + \underbrace{a_r + \cdots +a_r}_{k_r \text{ terms}}, }[/math]
we have in particular
 [math]\displaystyle{ \Gamma(z) = \frac1z  \gamma + \tfrac12\left(\gamma^2 + \frac {\pi^2}6\right)z  \tfrac16\left(\gamma^3 + \frac {\gamma\pi^2}2 + 2 \zeta(3)\right)z^2 + O(z^3). }[/math]
Inequalities
When restricted to the positive real numbers, the gamma function is a strictly logarithmically convex function. This property may be stated in any of the following three equivalent ways:
 For any two positive real numbers [math]\displaystyle{ x_1 }[/math] and [math]\displaystyle{ x_2 }[/math], and for any [math]\displaystyle{ t \in [0, 1] }[/math], [math]\displaystyle{ \Gamma(tx_1 + (1  t)x_2) \le \Gamma(x_1)^t\Gamma(x_2)^{1  t}. }[/math]
 For any two positive real numbers x and y with y > x, [math]\displaystyle{ \left(\frac{\Gamma(y)}{\Gamma(x)}\right)^{\frac{1}{y  x}} \gt \exp\left(\frac{\Gamma'(x)}{\Gamma(x)}\right). }[/math]
 For any positive real number [math]\displaystyle{ x }[/math], [math]\displaystyle{ \Gamma''(x) \Gamma(x) \gt \Gamma'(x)^2. }[/math]
The last of these statements is, essentially by definition, the same as the statement that [math]\displaystyle{ \psi^{(1)}(x) \gt 0 }[/math], where [math]\displaystyle{ \psi^{(1)} }[/math] is the polygamma function of order 1. To prove the logarithmic convexity of the gamma function, it therefore suffices to observe that [math]\displaystyle{ \psi^{(1)} }[/math] has a series representation which, for positive real x, consists of only positive terms.
Logarithmic convexity and Jensen's inequality together imply, for any positive real numbers [math]\displaystyle{ x_1, \ldots, x_n }[/math] and [math]\displaystyle{ a_1, \ldots, a_n }[/math], [math]\displaystyle{ \Gamma\left(\frac{a_1x_1 + \cdots + a_nx_n}{a_1 + \cdots + a_n}\right) \le \bigl(\Gamma(x_1)^{a_1} \cdots \Gamma(x_n)^{a_n}\bigr)^{\frac{1}{a_1 + \cdots + a_n}}. }[/math]
There are also bounds on ratios of gamma functions. The bestknown is Gautschi's inequality, which says that for any positive real number x and any s ∈ (0, 1), [math]\displaystyle{ x^{1  s} \lt \frac{\Gamma(x + 1)}{\Gamma(x + s)} \lt \left(x + 1\right)^{1  s}. }[/math]
Stirling's formula
The behavior of [math]\displaystyle{ \Gamma(x) }[/math] for an increasing positive real variable is given by Stirling's formula
 [math]\displaystyle{ \Gamma(x+1)\sim\sqrt{2\pi x}\left(\frac{x}{e}\right)^x, }[/math]
where the symbol [math]\displaystyle{ \sim }[/math] means asymptotic convergence; the ratio of the two sides converges to 1 in the limit [math]\displaystyle{ x \to + \infty }[/math].^{[1]} This growth is faster than exponential, [math]\displaystyle{ \exp(\beta x) }[/math], for any fixed value of [math]\displaystyle{ \beta }[/math].
Another useful limit for asymptotic approximations for [math]\displaystyle{ x \to + \infty }[/math] is:
 [math]\displaystyle{ {\Gamma(x+\alpha)}\sim{\Gamma(x)x^\alpha}, \qquad \alpha \in \C. }[/math]
Residues
The behavior for nonpositive [math]\displaystyle{ z }[/math] is more intricate. Euler's integral does not converge for [math]\displaystyle{ z \le 0 }[/math], but the function it defines in the positive complex halfplane has a unique analytic continuation to the negative halfplane. One way to find that analytic continuation is to use Euler's integral for positive arguments and extend the domain to negative numbers by repeated application of the recurrence formula,^{[1]}
 [math]\displaystyle{ \Gamma(z)=\frac{\Gamma(z+n+1)}{z(z+1)\cdots(z+n)}, }[/math]
choosing [math]\displaystyle{ n }[/math] such that [math]\displaystyle{ z + n }[/math] is positive. The product in the denominator is zero when [math]\displaystyle{ z }[/math] equals any of the integers [math]\displaystyle{ 0, 1, 2, \dots }[/math]. Thus, the gamma function must be undefined at those points to avoid division by zero; it is a meromorphic function with simple poles at the nonpositive integers.^{[1]}
For a function [math]\displaystyle{ f }[/math] of a complex variable [math]\displaystyle{ z }[/math], at a simple pole [math]\displaystyle{ c }[/math], the residue of [math]\displaystyle{ f }[/math] is given by:
 [math]\displaystyle{ \operatorname{Res}(f,c)=\lim_{z\to c}(zc)f(z). }[/math]
For the simple pole [math]\displaystyle{ z = n, }[/math] we rewrite recurrence formula as:
 [math]\displaystyle{ (z+n) \Gamma(z)=\frac{\Gamma(z+n+1)}{z(z+1)\cdots(z+n1)}. }[/math]
The numerator at [math]\displaystyle{ z = n, }[/math] is
 [math]\displaystyle{ \Gamma(z+n+1) = \Gamma(1) = 1 }[/math]
and the denominator
 [math]\displaystyle{ z(z+1)\cdots(z+n1) = n(1n)\cdots(n1n) = (1)^n n!. }[/math]
So the residues of the gamma function at those points are:
 [math]\displaystyle{ \operatorname{Res}(\Gamma,n)=\frac{(1)^n}{n!}. }[/math]^{[8]}
The gamma function is nonzero everywhere along the real line, although it comes arbitrarily close to zero as z → −∞. There is in fact no complex number [math]\displaystyle{ z }[/math] for which [math]\displaystyle{ \Gamma (z) = 0 }[/math], and hence the reciprocal gamma function [math]\displaystyle{ \frac {1}{\Gamma (z)} }[/math] is an entire function, with zeros at [math]\displaystyle{ z = 0, 1, 2, \dots }[/math].^{[1]}
Minima
On the real line, the gamma function has a local minimum at z_{min} ≈ +1.46163214496836234126 (truncated) where it attains the value Γ(z_{min}) ≈ +0.88560319441088870027 (truncated). The gamma function rises to either side of this minimum. The solution to Γ(z − 0.5) = Γ(z + 0.5) is z = 1.5. The positive solution to Γ(z − 1) = Γ(z + 1) is z ≈ 1.618, the golden ratio.
The gamma function must alternate sign between its poles at the nonpositive integers because the product in the forward recurrence contains an odd number of negative factors if the number of poles between [math]\displaystyle{ z }[/math] and [math]\displaystyle{ z + n }[/math] is odd, and an even number if the number of poles is even.^{[8]}
Integral representations
There are many formulas, besides the Euler integral of the second kind, that express the gamma function as an integral. For instance, when the real part of z is positive,^{[9]}
 [math]\displaystyle{ \Gamma(z) = \int_0^1 \left(\log \frac{1}{t}\right)^{z1}\,dt. }[/math]
where [math]\displaystyle{ \log }[/math] denotes the complex logarithm.
Binet's first integral formula for the gamma function states that, when the real part of z is positive, then:^{[10]}
 [math]\displaystyle{ \log \Gamma(z) = \left(z  \frac{1}{2}\right)\log z  z + \frac{1}{2}\ln(2\pi) + \int_0^\infty \left(\frac{1}{2}  \frac{1}{t} + \frac{1}{e^t  1}\right)\frac{e^{tz}}{t}\,dt. }[/math]
The integral on the righthand side may be interpreted as a Laplace transform. That is,
 [math]\displaystyle{ \log\left(\Gamma(z)\left(\frac{e}{z}\right)^z\sqrt{2\pi z}\right) = \mathcal{L}\left(\frac{1}{2t}  \frac{1}{t^2} + \frac{1}{t(e^t  1)}\right)(z). }[/math]
Binet's second integral formula states that, again when the real part of z is positive, then:^{[11]}
 [math]\displaystyle{ \log \Gamma(z) = \left(z  \frac{1}{2}\right)\log z  z + \frac{1}{2}\ln(2\pi) + 2\int_0^\infty \frac{\arctan(t/z)}{e^{2\pi t}  1}\,dt. }[/math]
Let C be a Hankel contour, meaning a path that begins and ends at the point ∞ on the Riemann sphere, whose unit tangent vector converges to −1 at the start of the path and to 1 at the end, which has winding number 1 around 0, and which does not cross [0, ∞). Fix a branch of [math]\displaystyle{ \log(t) }[/math] by taking a branch cut along [0, ∞) and by taking [math]\displaystyle{ \log(t) }[/math] to be real when t is on the negative real axis. Assume z is not an integer. Then Hankel's formula for the gamma function is:^{[12]}
 [math]\displaystyle{ \Gamma(z) = \frac{1}{2i\sin \pi z}\int_C (t)^{z1}e^{t}\,dt, }[/math]
where [math]\displaystyle{ (t)^{z1} }[/math] is interpreted as [math]\displaystyle{ \exp((z1)\log(t)) }[/math]. The reflection formula leads to the closely related expression
 [math]\displaystyle{ \frac{1}{\Gamma(z)} = \frac{i}{2\pi}\int_C (t)^{z}e^{t}\,dt, }[/math]
again valid whenever z is not an integer.
Fourier series expansion
The logarithm of the gamma function has the following Fourier series expansion for [math]\displaystyle{ 0 \lt z \lt 1: }[/math]
 [math]\displaystyle{ \ln\Gamma(z) = \left(\frac{1}{2}  z\right)(\gamma + \ln 2) + (1  z)\ln\pi  \frac{1}{2}\ln\sin(\pi z) + \frac{1}{\pi}\sum_{n=1}^\infty \frac{\ln n}{n}\sin (2\pi n z), }[/math]
which was for a long time attributed to Ernst Kummer, who derived it in 1847.^{[13]}^{[14]} However, Iaroslav Blagouchine discovered that Carl Johan Malmsten first derived this series in 1842.^{[15]}^{[16]}
Raabe's formula
In 1840 Joseph Ludwig Raabe proved that
 [math]\displaystyle{ \int_a^{a+1}\ln\Gamma(z)\, dz = \tfrac12\ln2\pi + a\ln a  a,\quad a\gt 0. }[/math]
In particular, if [math]\displaystyle{ a = 0 }[/math] then
 [math]\displaystyle{ \int_0^1\ln\Gamma(z)\, dz = \tfrac12\ln2\pi. }[/math]
The latter can be derived taking the logarithm in the above multiplication formula, which gives an expression for the Riemann sum of the integrand. Taking the limit for [math]\displaystyle{ a \to \infty }[/math] gives the formula.
Pi function
An alternative notation that was originally introduced by Gauss is the [math]\displaystyle{ \Pi }[/math]function, which, in terms of the gamma function, is
 [math]\displaystyle{ \Pi(z) = \Gamma(z+1) = z \Gamma(z) = \int_0^\infty e^{t} t^z\, dt, }[/math]
so that [math]\displaystyle{ \Pi(n) = n! }[/math] for every nonnegative integer [math]\displaystyle{ n }[/math].
Using the pi function the reflection formula takes on the form
 [math]\displaystyle{ \Pi(z) \Pi(z) = \frac{\pi z}{\sin( \pi z)} = \frac{1}{\operatorname{sinc}(z)} }[/math]
where sinc is the normalized sinc function, while the multiplication theorem takes on the form
 [math]\displaystyle{ \Pi\left(\frac{z}{m}\right) \, \Pi\left(\frac{z1}{m}\right) \cdots \Pi\left(\frac{zm+1}{m}\right) = (2 \pi)^{\frac{m1}{2}} m^{z\frac12} \Pi(z)\ . }[/math]
We also sometimes find
 [math]\displaystyle{ \pi(z) = \frac{1}{\Pi(z)}\ , }[/math]
which is an entire function, defined for every complex number, just like the reciprocal gamma function. That [math]\displaystyle{ \pi(z) }[/math] is entire entails it has no poles, so [math]\displaystyle{ \Pi\left(z\right) }[/math], like [math]\displaystyle{ \Gamma\left(z\right) }[/math], has no zeros.
The volume of an nellipsoid with radii r_{1}, …, r_{n} can be expressed as
 [math]\displaystyle{ V_n(r_1,\dotsc,r_n)=\frac{\pi^{\frac{n}{2}}}{\Pi\left(\frac{n}{2}\right)} \prod_{k=1}^n r_k. }[/math]
Relation to other functions
 In the first integral above, which defines the gamma function, the limits of integration are fixed. The upper and lower incomplete gamma functions are the functions obtained by allowing the lower or upper (respectively) limit of integration to vary.
 The gamma function is related to the beta function by the formula [math]\displaystyle{ \Beta(x,y) = \int_0^1 t^{x1}(1t)^{y1}\,dt = \frac{\Gamma(x)\,\Gamma(y)}{\Gamma(x+y)}. }[/math]
 The logarithmic derivative of the gamma function is called the digamma function; higher derivatives are the polygamma functions.
 The analog of the gamma function over a finite field or a finite ring is the Gaussian sums, a type of exponential sum.
 The reciprocal gamma function is an entire function and has been studied as a specific topic.
 The gamma function also shows up in an important relation with the Riemann zeta function, [math]\displaystyle{ \zeta (z) }[/math]. [math]\displaystyle{ \pi^{\frac{z}{2}} \; \Gamma\left(\frac{z}{2}\right) \zeta(z) = \pi^{\frac{1z}{2}} \; \Gamma\left(\frac{1z}{2}\right) \; \zeta(1z). }[/math] It also appears in the following formula: [math]\displaystyle{ \zeta(z) \Gamma(z) = \int_0^\infty \frac{u^{z}}{e^u  1} \, \frac{du}{u}, }[/math] which is valid only for [math]\displaystyle{ \Re (z) \gt 1 }[/math]. The logarithm of the gamma function satisfies the following formula due to Lerch: [math]\displaystyle{ \log\Gamma(x) = \zeta_H'(0,x)  \zeta'(0), }[/math] where [math]\displaystyle{ \zeta_H }[/math] is the Hurwitz zeta function, [math]\displaystyle{ \zeta }[/math] is the Riemann zeta function and the prime (′) denotes differentiation in the first variable.
 The gamma function is related to the stretched exponential function. For instance, the moments of that function are [math]\displaystyle{ \langle\tau^n\rangle \equiv \int_0^\infty dt\, t^{n1}\, e^{  \left( \frac{t}{\tau} \right)^\beta} = \frac{\tau^n}{\beta}\Gamma \left({n \over \beta }\right). }[/math]
Particular values
Including up to the first 20 digits after the decimal point, some particular values of the gamma function are:
 [math]\displaystyle{ \begin{array}{rcccl} \Gamma\left(\tfrac{3}{2}\right) &=& \tfrac{4\sqrt{\pi}}{3} &\approx& +2.36327\,18012\,07354\,70306 \\ \Gamma\left(\tfrac{1}{2}\right) &=& 2\sqrt{\pi} &\approx& 3.54490\,77018\,11032\,05459 \\ \Gamma\left(\tfrac{1}{2}\right) &=& \sqrt{\pi} &\approx& +1.77245\,38509\,05516\,02729 \\ \Gamma(1) &=& 0! &=& +1 \\ \Gamma\left(\tfrac{3}{2}\right) &=& \tfrac{\sqrt{\pi}}{2} &\approx& +0.88622\,69254\,52758\,01364 \\ \Gamma(2) &=& 1! &=& +1 \\ \Gamma\left(\tfrac{5}{2}\right) &=& \tfrac{3\sqrt{\pi}}{4} &\approx& +1.32934\,03881\,79137\,02047 \\ \Gamma(3) &=& 2! &=& +2 \\ \Gamma\left(\tfrac{7}{2}\right) &=& \tfrac{15\sqrt{\pi}}{8} &\approx& +3.32335\,09704\,47842\,55118 \\ \Gamma(4) &=& 3! &=& +6 \end{array} }[/math]
The complexvalued gamma function is undefined for nonpositive integers, but in these cases the value can be defined in the Riemann sphere as ∞. The reciprocal gamma function is well defined and analytic at these values (and in the entire complex plane):
 [math]\displaystyle{ \frac{1}{\Gamma(3)} = \frac{1}{\Gamma(2)} = \frac{1}{\Gamma(1)} = \frac{1}{\Gamma(0)} = 0. }[/math]
The loggamma function
Because the gamma and factorial functions grow so rapidly for moderately large arguments, many computing environments include a function that returns the natural logarithm of the gamma function (often given the name lgamma
or lngamma
in programming environments or gammaln
in spreadsheets); this grows much more slowly, and for combinatorial calculations allows adding and subtracting logs instead of multiplying and dividing very large values. It is often defined as^{[17]}
 [math]\displaystyle{ \ln \Gamma ( z ) =  \gamma z  \ln z + \sum _ { k = 1 } ^ { \infty } \left[ \frac { z } { k }  \ln \left( 1 + \frac { z } { k } \right) \right]. }[/math]
The digamma function, which is the derivative of this function, is also commonly seen. In the context of technical and physical applications, e.g. with wave propagation, the functional equation
 [math]\displaystyle{ \ln \Gamma(z) = \ln \Gamma(z+1)  \ln z }[/math]
is often used since it allows one to determine function values in one strip of width 1 in z from the neighbouring strip. In particular, starting with a good approximation for a z with large real part one may go step by step down to the desired z. Following an indication of Carl Friedrich Gauss, Rocktaeschel (1922) proposed for [math]\displaystyle{ \ln ( \Gamma (z)) }[/math] an approximation for large Re(z):
 [math]\displaystyle{ \ln \Gamma(z) \approx (z  \tfrac{1}{2}) \ln z  z + \tfrac{1}{2}\ln(2\pi). }[/math]
This can be used to accurately approximate ln(Γ(z)) for z with a smaller Re(z) via (P.E.Böhmer, 1939)
 [math]\displaystyle{ \ln\Gamma(zm) = \ln\Gamma(z)  \sum_{k=1}^{m} \ln(zk). }[/math]
A more accurate approximation can be obtained by using more terms from the asymptotic expansions of ln(Γ(z)) and Γ(z), which are based on Stirling's approximation.
 [math]\displaystyle{ \Gamma(z)\sim z^{z  \frac12} e^{z} \sqrt{2\pi} \left( 1 + \frac{1}{12z} + \frac{1}{288z^2}  \frac{139}{51\,840 z^3}  \frac{571}{2\,488\,320 z^4} \right) }[/math]
 as z → ∞ at constant arg(z) < π.
In a more "natural" presentation:
 [math]\displaystyle{ \ln \Gamma(z) = z \ln z  z  \tfrac12 \ln z + \tfrac12 \ln 2\pi + \frac{1}{12z}  \frac{1}{360z^3} +\frac{1}{1260 z^5} +o\left(\frac1{z^5}\right) }[/math]
 as z → ∞ at constant arg(z) < π.
The coefficients of the terms with k > 1 of z^{1−k} in the last expansion are simply
 [math]\displaystyle{ \frac{B_k}{k(k1)} }[/math]
where the B_{k} are the Bernoulli numbers.
The Gamma function also has Stirling Series (derived by Charles Hermite in 1900) equal to^{[18]}
 [math]\displaystyle{ \log\Gamma\left(1+x\right)=\frac{x\left(x1\right)}{2!}\log\left(2\right)+\frac{x\left(x1\right)\left(x2\right)}{3!}\left(\log\left(3\right)2\log\left(2\right)\right)+...,\quad\Re (x)\gt 0. }[/math]
Properties
The Bohr–Mollerup theorem states that among all functions extending the factorial functions to the positive real numbers, only the gamma function is logconvex, that is, its natural logarithm is convex on the positive real axis. Another characterisation is given by the Wielandt theorem.
In a certain sense, the ln(Γ) function is the more natural form; it makes some intrinsic attributes of the function clearer. A striking example is the Taylor series of ln(Γ) around 1:
 [math]\displaystyle{ \ln \Gamma(z+1)= \gamma z +\sum_{k=2}^\infty \frac{\zeta(k)}{k} \, (z)^k \qquad \forall\; z \lt 1 }[/math]
with ζ(k) denoting the Riemann zeta function at k.
So, using the following property:
 [math]\displaystyle{ \zeta(s) \Gamma(s) = \int_0^\infty \frac{t^s}{e^t1} \, \frac{dt}{t} }[/math]
we can find an integral representation for the ln(Γ) function:
 [math]\displaystyle{ \ln \Gamma(z+1)= \gamma z + \int_0^\infty \frac{\,\left( e^{zt}  1 + z t \right)\,}{t \left(e^t  1 \right)} \, dt }[/math]
or, setting z = 1 to obtain an integral for γ, we can replace the γ term with its integral and incorporate that into the above formula, to get:
 [math]\displaystyle{ \ln \Gamma(z+1)= \int_0^\infty \frac{\,\left( e^{zt}  ze^{t}  1 + z \right)\,}{t(e^t 1)} \, dt\,. }[/math]
There also exist special formulas for the logarithm of the gamma function for rational z. For instance, if [math]\displaystyle{ k }[/math] and [math]\displaystyle{ n }[/math] are integers with [math]\displaystyle{ k\lt n }[/math] and [math]\displaystyle{ k\neq n/2 \,, }[/math] then
 [math]\displaystyle{ \begin{align} \ln\Gamma \left(\frac{k}{n}\right) = {} & \frac{\,(n2k)\ln2\pi\,}{2n} + \frac{1}{2}\left\{\,\ln\pi\ln\sin\frac{\pi k}{n} \,\right\} + \frac{1}{\pi}\!\sum_{r=1}^{n1}\frac{\,\gamma+\ln r\,}{r}\cdot\sin\frac{\,2\pi r k\,}{n} \\ & {}  \frac{1}{2\pi}\sin\frac{2\pi k}{n}\cdot\!\int_0^\infty \!\!\frac{\,e^{nx}\!\cdot\ln x\,}{\,\cosh x \cos( 2\pi k/n )\,}\,{\mathrm d}x \end{align} }[/math]
see.^{[19]} This formula is sometimes used for numerical computation, since the integrand decreases very quickly.
Integration over loggamma
The integral
 [math]\displaystyle{ \int_0^z \ln \Gamma (x) \, dx }[/math]
can be expressed in terms of the Barnes Gfunction^{[20]}^{[21]} (see Barnes Gfunction for a proof):
 [math]\displaystyle{ \int_0^z \ln \Gamma(x) \, dx = \frac{z}{2} \ln (2 \pi) + \frac{z(1z)}{2} + z \ln \Gamma(z)  \ln G(z+1) }[/math]
where Re(z) > −1.
It can also be written in terms of the Hurwitz zeta function:^{[22]}^{[23]}
 [math]\displaystyle{ \int_0^z \ln \Gamma(x) \, dx = \frac{z}{2} \ln(2 \pi) + \frac{z(1z)}{2}  \zeta'(1) + \zeta'(1,z) . }[/math]
When [math]\displaystyle{ z=1 }[/math] it follows that
 [math]\displaystyle{ \int_0^1 \ln \Gamma(x) \, dx = \frac 1 2 \ln(2\pi), }[/math]
and this is a consequence of Raabe's formula as well. O. Espinosa and V. Moll derived a similar formula for the integral of the square of [math]\displaystyle{ \ln\Gamma }[/math]:^{[24]}
 [math]\displaystyle{ \int_{0}^{1} \ln ^{2} \Gamma(x) d x=\frac{\gamma^{2}}{12}+\frac{\pi^{2}}{48}+\frac{1}{3} \gamma L_{1}+\frac{4}{3} L_{1}^{2}\left(\gamma+2 L_{1}\right) \frac{\zeta^{\prime}(2)}{\pi^{2}}+\frac{\zeta^{\prime \prime}(2)}{2 \pi^{2}}, }[/math]
where [math]\displaystyle{ L_1 }[/math] is [math]\displaystyle{ \frac12\ln(2\pi) }[/math].
D. H. Bailey and his coauthors^{[25]} gave an evaluation for
 [math]\displaystyle{ L_n:=\int_{0}^{1} \ln^{n} \Gamma(x) dx }[/math]
when [math]\displaystyle{ n=1,2 }[/math] in terms of the TornheimWitten zeta function and its derivatives.
In addition, it is also known that^{[26]}
 [math]\displaystyle{ \lim_{n\to\infty}\frac{L_n}{n!}=1. }[/math]
Approximations
Complex values of the gamma function can be approximated using Stirling's approximation or the Lanczos approximation,
 [math]\displaystyle{ \Gamma(z) \sim \sqrt{2\pi}z^{z1/2}e^{z}\quad\hbox{as }z\to\infty\hbox{ in } \left\arg(z)\right\lt \pi. }[/math]
This is precise in the sense that the ratio of the approximation to the true value approaches 1 in the limit as z goes to infinity.
The gamma function can be computed to fixed precision for [math]\displaystyle{ \operatorname{Re} (z) \in [1, 2] }[/math] by applying integration by parts to Euler's integral. For any positive number x the gamma function can be written
 [math]\displaystyle{ \begin{align} \Gamma(z) &= \int_0^x e^{t} t^z \, \frac{dt}{t} + \int_x^\infty e^{t} t^z\, \frac{dt}{t} \\ &= x^z e^{x} \sum_{n=0}^\infty \frac{x^n}{z(z+1) \cdots (z+n)} + \int_x^\infty e^{t} t^z \, \frac{dt}{t}. \end{align} }[/math]
When Re(z) ∈ [1,2] and [math]\displaystyle{ x \geq 1 }[/math], the absolute value of the last integral is smaller than [math]\displaystyle{ (x + 1)e^{x} }[/math]. By choosing a large enough [math]\displaystyle{ x }[/math], this last expression can be made smaller than [math]\displaystyle{ 2^{N} }[/math] for any desired value [math]\displaystyle{ N }[/math]. Thus, the gamma function can be evaluated to [math]\displaystyle{ N }[/math] bits of precision with the above series.
A fast algorithm for calculation of the Euler gamma function for any algebraic argument (including rational) was constructed by E.A. Karatsuba.^{[27]}^{[28]}^{[29]}
For arguments that are integer multiples of 1/24, the gamma function can also be evaluated quickly using arithmetic–geometric mean iterations (see particular values of the gamma function).^{[30]}
Applications
One author describes the gamma function as "Arguably, the most common special function, or the least 'special' of them. The other transcendental functions […] are called 'special' because you could conceivably avoid some of them by staying away from many specialized mathematical topics. On the other hand, the gamma function y = Γ(x) is most difficult to avoid."^{[31]}
Integration problems
The gamma function finds application in such diverse areas as quantum physics, astrophysics and fluid dynamics.^{[32]} The gamma distribution, which is formulated in terms of the gamma function, is used in statistics to model a wide range of processes; for example, the time between occurrences of earthquakes.^{[33]}
The primary reason for the gamma function's usefulness in such contexts is the prevalence of expressions of the type [math]\displaystyle{ f(t)e^{g(t)} }[/math] which describe processes that decay exponentially in time or space. Integrals of such expressions can occasionally be solved in terms of the gamma function when no elementary solution exists. For example, if f is a power function and g is a linear function, a simple change of variables gives the evaluation
 [math]\displaystyle{ \int_0^\infty t^b e^{at} \,dt = \frac{\Gamma(b+1)}{a^{b+1}}. }[/math]
The fact that the integration is performed along the entire positive real line might signify that the gamma function describes the cumulation of a timedependent process that continues indefinitely, or the value might be the total of a distribution in an infinite space.
It is of course frequently useful to take limits of integration other than 0 and ∞ to describe the cumulation of a finite process, in which case the ordinary gamma function is no longer a solution; the solution is then called an incomplete gamma function. (The ordinary gamma function, obtained by integrating across the entire positive real line, is sometimes called the complete gamma function for contrast.)
An important category of exponentially decaying functions is that of Gaussian functions
 [math]\displaystyle{ ae^{\frac{(xb)^2}{c^2}} }[/math]
and integrals thereof, such as the error function. There are many interrelations between these functions and the gamma function; notably, the factor [math]\displaystyle{ \sqrt{\pi} }[/math] obtained by evaluating [math]\displaystyle{ \Gamma \left( \frac{1}{2} \right) }[/math] is the "same" as that found in the normalizing factor of the error function and the normal distribution.
The integrals we have discussed so far involve transcendental functions, but the gamma function also arises from integrals of purely algebraic functions. In particular, the arc lengths of ellipses and of the lemniscate, which are curves defined by algebraic equations, are given by elliptic integrals that in special cases can be evaluated in terms of the gamma function. The gamma function can also be used to calculate "volume" and "area" of ndimensional hyperspheres.
Calculating products
The gamma function's ability to generalize factorial products immediately leads to applications in many areas of mathematics; in combinatorics, and by extension in areas such as probability theory and the calculation of power series. Many expressions involving products of successive integers can be written as some combination of factorials, the most important example perhaps being that of the binomial coefficient
 [math]\displaystyle{ \binom n k = \frac{n!}{k!(nk)!}. }[/math]
The example of binomial coefficients motivates why the properties of the gamma function when extended to negative numbers are natural. A binomial coefficient gives the number of ways to choose k elements from a set of n elements; if k > n, there are of course no ways. If k > n, (n − k)! is the factorial of a negative integer and hence infinite if we use the gamma function definition of factorials—dividing by infinity gives the expected value of 0.
We can replace the factorial by a gamma function to extend any such formula to the complex numbers. Generally, this works for any product wherein each factor is a rational function of the index variable, by factoring the rational function into linear expressions. If P and Q are monic polynomials of degree m and n with respective roots p_{1}, …, p_{m} and q_{1}, …, q_{n}, we have
 [math]\displaystyle{ \prod_{i=a}^b \frac{P(i)}{Q(i)} = \left( \prod_{j=1}^m \frac{\Gamma(bp_j+1)}{\Gamma(ap_j)} \right) \left( \prod_{k=1}^n \frac{\Gamma(aq_k)}{\Gamma(bq_k+1)} \right). }[/math]
If we have a way to calculate the gamma function numerically, it is a breeze to calculate numerical values of such products. The number of gamma functions in the righthand side depends only on the degree of the polynomials, so it does not matter whether b − a equals 5 or 10^{5}. By taking the appropriate limits, the equation can also be made to hold even when the lefthand product contains zeros or poles.
By taking limits, certain rational products with infinitely many factors can be evaluated in terms of the gamma function as well. Due to the Weierstrass factorization theorem, analytic functions can be written as infinite products, and these can sometimes be represented as finite products or quotients of the gamma function. We have already seen one striking example: the reflection formula essentially represents the sine function as the product of two gamma functions. Starting from this formula, the exponential function as well as all the trigonometric and hyperbolic functions can be expressed in terms of the gamma function.
More functions yet, including the hypergeometric function and special cases thereof, can be represented by means of complex contour integrals of products and quotients of the gamma function, called Mellin–Barnes integrals.
Analytic number theory
An application of the gamma function is the study of the Riemann zeta function. A fundamental property of the Riemann zeta function is its functional equation:
 [math]\displaystyle{ \Gamma\left(\frac{s}{2}\right)\zeta(s)\pi^{\frac{s}{2}} = \Gamma\left(\frac{1s}{2}\right)\zeta(1s)\pi^{\frac{1s}{2}}. }[/math]
Among other things, this provides an explicit form for the analytic continuation of the zeta function to a meromorphic function in the complex plane and leads to an immediate proof that the zeta function has infinitely many socalled "trivial" zeros on the real line. Borwein et al. call this formula "one of the most beautiful findings in mathematics".^{[34]} Another contender for that title might be
 [math]\displaystyle{ \zeta(s) \; \Gamma(s) = \int_0^\infty \frac{t^s}{e^t1} \, \frac{dt}{t}. }[/math]
Both formulas were derived by Bernhard Riemann in his seminal 1859 paper "Ueber die Anzahl der Primzahlen unter einer gegebenen Größe" ("On the Number of Primes Less Than a Given Magnitude"), one of the milestones in the development of analytic number theory—the branch of mathematics that studies prime numbers using the tools of mathematical analysis. Factorial numbers, considered as discrete objects, are an important concept in classical number theory because they contain many prime factors, but Riemann found a use for their continuous extension that arguably turned out to be even more important.
History
The gamma function has caught the interest of some of the most prominent mathematicians of all time. Its history, notably documented by Philip J. Davis in an article that won him the 1963 Chauvenet Prize, reflects many of the major developments within mathematics since the 18th century. In the words of Davis, "each generation has found something of interest to say about the gamma function. Perhaps the next generation will also."^{[1]}
18th century: Euler and Stirling
The problem of extending the factorial to noninteger arguments was apparently first considered by Daniel Bernoulli and Christian Goldbach in the 1720s. In particular, in a letter from Bernoulli to Goldbach dated 6 October 1729 Bernoulli introduced the product representation^{[35]} [math]\displaystyle{ x!=\lim_{n\to\infty}\left(n+1+\frac{x}{2}\right)^{x1}\prod_{k=1}^{n}\frac{k+1}{k+x} }[/math] which is well defined for real values of x other than the negative integers.
Leonard Euler later gave two different definitions: the first was not his integral but an infinite product that is well defined for all complex numbers n other than the negative integers,
 [math]\displaystyle{ n! = \prod_{k=1}^\infty \frac{\left(1+\frac{1}{k}\right)^n}{1+\frac{n}{k}}\,, }[/math]
of which he informed Goldbach in a letter dated 13 October 1729. He wrote to Goldbach again on 8 January 1730, to announce his discovery of the integral representation
 [math]\displaystyle{ n!=\int_0^1 (\ln s)^n\, ds\,, }[/math]
which is valid when the real part of the complex number n is strictly greater than −1 (i.e., [math]\displaystyle{ \Re (n) \gt 1 }[/math]). By the change of variables t = −ln s, this becomes the familiar Euler integral. Euler published his results in the paper "De progressionibus transcendentibus seu quarum termini generales algebraice dari nequeunt" ("On transcendental progressions, that is, those whose general terms cannot be given algebraically"), submitted to the St. Petersburg Academy on 28 November 1729.^{[36]} Euler further discovered some of the gamma function's important functional properties, including the reflection formula.
James Stirling, a contemporary of Euler, also attempted to find a continuous expression for the factorial and came up with what is now known as Stirling's formula. Although Stirling's formula gives a good estimate of n!, also for nonintegers, it does not provide the exact value. Extensions of his formula that correct the error were given by Stirling himself and by Jacques Philippe Marie Binet.
19th century: Gauss, Weierstrass and Legendre
Carl Friedrich Gauss rewrote Euler's product as
 [math]\displaystyle{ \Gamma(z) = \lim_{m\to\infty}\frac{m^z m!}{z(z+1)(z+2)\cdots(z+m)} }[/math]
and used this formula to discover new properties of the gamma function. Although Euler was a pioneer in the theory of complex variables, he does not appear to have considered the factorial of a complex number, as instead Gauss first did.^{[37]} Gauss also proved the multiplication theorem of the gamma function and investigated the connection between the gamma function and elliptic integrals.
Karl Weierstrass further established the role of the gamma function in complex analysis, starting from yet another product representation,
 [math]\displaystyle{ \Gamma(z) = \frac{e^{\gamma z}}{z} \prod_{k=1}^\infty \left(1 + \frac{z}{k}\right)^{1} e^\frac{z}{k}, }[/math]
where γ is the Euler–Mascheroni constant. Weierstrass originally wrote his product as one for 1/Γ, in which case it is taken over the function's zeros rather than its poles. Inspired by this result, he proved what is known as the Weierstrass factorization theorem—that any entire function can be written as a product over its zeros in the complex plane; a generalization of the fundamental theorem of algebra.
The name gamma function and the symbol Γ were introduced by AdrienMarie Legendre around 1811; Legendre also rewrote Euler's integral definition in its modern form. Although the symbol is an uppercase Greek gamma, there is no accepted standard for whether the function name should be written "gamma function" or "Gamma function" (some authors simply write "Γfunction"). The alternative "pi function" notation Π(z) = z! due to Gauss is sometimes encountered in older literature, but Legendre's notation is dominant in modern works.
It is justified to ask why we distinguish between the "ordinary factorial" and the gamma function by using distinct symbols, and particularly why the gamma function should be normalized to Γ(n + 1) = n! instead of simply using "Γ(n) = n!". Consider that the notation for exponents, x^{n}, has been generalized from integers to complex numbers x^{z} without any change. Legendre's motivation for the normalization does not appear to be known, and has been criticized as cumbersome by some (the 20thcentury mathematician Cornelius Lanczos, for example, called it "void of any rationality" and would instead use z!).^{[38]} Legendre's normalization does simplify some formulae, but complicates others. From a modern point of view, the Legendre normalization of the Gamma function is the integral of the additive character e^{−x} against the multiplicative character x^{z} with respect to the Haar measure [math]\displaystyle{ \frac{dx}{x} }[/math] on the Lie group R^{+}. Thus this normalization makes it clearer that the gamma function is a continuous analogue of a Gauss sum.^{[39]}
19th–20th centuries: characterizing the gamma function
It is somewhat problematic that a large number of definitions have been given for the gamma function. Although they describe the same function, it is not entirely straightforward to prove the equivalence. Stirling never proved that his extended formula corresponds exactly to Euler's gamma function; a proof was first given by Charles Hermite in 1900.^{[40]} Instead of finding a specialized proof for each formula, it would be desirable to have a general method of identifying the gamma function.
One way to prove would be to find a differential equation that characterizes the gamma function. Most special functions in applied mathematics arise as solutions to differential equations, whose solutions are unique. However, the gamma function does not appear to satisfy any simple differential equation. Otto Hölder proved in 1887 that the gamma function at least does not satisfy any algebraic differential equation by showing that a solution to such an equation could not satisfy the gamma function's recurrence formula, making it a transcendentally transcendental function. This result is known as Hölder's theorem.
A definite and generally applicable characterization of the gamma function was not given until 1922. Harald Bohr and Johannes Mollerup then proved what is known as the Bohr–Mollerup theorem: that the gamma function is the unique solution to the factorial recurrence relation that is positive and logarithmically convex for positive z and whose value at 1 is 1 (a function is logarithmically convex if its logarithm is convex). Another characterisation is given by the Wielandt theorem.
The Bohr–Mollerup theorem is useful because it is relatively easy to prove logarithmic convexity for any of the different formulas used to define the gamma function. Taking things further, instead of defining the gamma function by any particular formula, we can choose the conditions of the Bohr–Mollerup theorem as the definition, and then pick any formula we like that satisfies the conditions as a starting point for studying the gamma function. This approach was used by the Bourbaki group.
Borwein & Corless^{[41]} review three centuries of work on the gamma function.
Reference tables and software
Although the gamma function can be calculated virtually as easily as any mathematically simpler function with a modern computer—even with a programmable pocket calculator—this was of course not always the case. Until the mid20th century, mathematicians relied on handmade tables; in the case of the gamma function, notably a table computed by Gauss in 1813 and one computed by Legendre in 1825.
Tables of complex values of the gamma function, as well as handdrawn graphs, were given in Tables of Functions With Formulas and Curves by Jahnke and Fritz Emde (de), first published in Germany in 1909. According to Michael Berry, "the publication in J&E of a threedimensional graph showing the poles of the gamma function in the complex plane acquired an almost iconic status."^{[42]}
There was in fact little practical need for anything but real values of the gamma function until the 1930s, when applications for the complex gamma function were discovered in theoretical physics. As electronic computers became available for the production of tables in the 1950s, several extensive tables for the complex gamma function were published to meet the demand, including a table accurate to 12 decimal places from the U.S. National Bureau of Standards.^{[1]}
Doubleprecision floatingpoint implementations of the gamma function and its logarithm are now available in most scientific computing software and special functions libraries, for example TK Solver, Matlab, GNU Octave, and the GNU Scientific Library. The gamma function was also added to the C standard library (math.h). Arbitraryprecision implementations are available in most computer algebra systems, such as Mathematica and Maple. PARI/GP, MPFR and MPFUN contain free arbitraryprecision implementations. The Windows Calculator factorial function returns Γ(x+1) when the input x is a noninteger value.^{[43]}
See also
 Ascending factorial
 Cahen–Mellin integral
 Elliptic gamma function
 Gauss's constant
 Hadamard's gamma function
 Multiple gamma function
 Multivariate gamma function
 padic gamma function
 Pochhammer ksymbol
 qgamma function
 Ramanujan's master theorem
 Spouge's approximation
Notes
 ↑ ^{1.00} ^{1.01} ^{1.02} ^{1.03} ^{1.04} ^{1.05} ^{1.06} ^{1.07} ^{1.08} ^{1.09} ^{1.10} ^{1.11} ^{1.12} ^{1.13} Davis, P. J. (1959). "Leonhard Euler's Integral: A Historical Profile of the Gamma Function". American Mathematical Monthly 66 (10): 849–869. doi:10.2307/2309786. http://mathdl.maa.org/mathDL/22/?pa=content&sa=viewDocument&nodeId=3104. Retrieved 3 December 2016.
 ↑ Beals, Richard; Wong, Roderick (2010). Special Functions: A Graduate Text. Cambridge University Press. p. 28. ISBN 9781139490436. https://books.google.com/books?id=w87QUuTVIXYC. Extract of page 28
 ↑ Ross, Clay C. (2013). Differential Equations: An Introduction with Mathematica (illustrated ed.). Springer Science & Business Media. p. 293. ISBN 9781475739497. https://books.google.com/books?id=Z4bjBwAAQBAJ. Expression G.2 on page 293
 ↑ Kingman, J. F. C. (1961). "A Convexity Property of Positive Matrices". The Quarterly Journal of Mathematics 12 (1): 283–284. doi:10.1093/qmath/12.1.283. Bibcode: 1961QJMat..12..283K.
 ↑ Weisstein, Eric W.. "Bohr–Mollerup Theorem". http://mathworld.wolfram.com/BohrMollerupTheorem.html.
 ↑ ^{6.0} ^{6.1} Askey, R. A.; Roy, R. (2010), "Series Expansions", in Olver, Frank W. J.; Lozier, Daniel M.; Boisvert, Ronald F. et al., NIST Handbook of Mathematical Functions, Cambridge University Press, ISBN 9780521192255, http://dlmf.nist.gov/8.7
 ↑ Waldschmidt, M. (2006). "Transcendence of Periods: The State of the Art". Pure Appl. Math. Quart. 2 (2): 435–463. doi:10.4310/pamq.2006.v2.n2.a3. http://www.math.jussieu.fr/~miw/articles/pdf/TranscendencePeriods.pdf.
 ↑ ^{8.0} ^{8.1} Weisstein, Eric W.. "Gamma Function". http://mathworld.wolfram.com/GammaFunction.html.
 ↑ Whittaker and Watson, 12.2 example 1.
 ↑ Whittaker and Watson, 12.31.
 ↑ Whittaker and Watson, 12.32.
 ↑ Whittaker and Watson, 12.22.
 ↑ Bateman, Harry; Erdélyi, Arthur (1955). Higher Transcendental Functions. McGrawHill.
 ↑ Srivastava, H. M.; Choi, J. (2001). Series Associated with the Zeta and Related Functions. The Netherlands: Kluwer Academic.
 ↑ Blagouchine, Iaroslav V. (2014). "Rediscovery of Malmsten's integrals, their evaluation by contour integration methods and some related results". Ramanujan J. 35 (1): 21–110. doi:10.1007/s1113901395285. https://www.researchgate.net/publication/257381156.
 ↑ Blagouchine, Iaroslav V. (2016). "Erratum and Addendum to "Rediscovery of Malmsten's integrals, their evaluation by contour integration methods and some related results"". Ramanujan J. 42 (3): 777–781. doi:10.1007/s111390159763z.
 ↑ "Log Gamma Function". http://mathworld.wolfram.com/LogGammaFunction.html.
 ↑ "Leonhard Euler's Integral: An Historical Profile of the Gamma Function". https://www.maa.org/sites/default/files/pdf/upload_library/22/Chauvenet/Davis.pdf.
 ↑ Blagouchine, Iaroslav V. (2015). "A theorem for the closedform evaluation of the first generalized Stieltjes constant at rational arguments and some related summations". Journal of Number Theory 148: 537–592. doi:10.1016/j.jnt.2014.08.009.
 ↑ Alexejewsky, W. P. (1894). "Über eine Classe von Funktionen, die der Gammafunktion analog sind". Leipzig Weidmanncshe Buchhandluns 46: 268–275.
 ↑ Barnes, E. W. (1899). "The theory of the Gfunction". Quart. J. Math. 31: 264–314.
 ↑ Adamchik, Victor S. (1998). "Polygamma functions of negative order". J. Comput. Appl. Math. 100 (2): 191–199. doi:10.1016/S03770427(98)001927.
 ↑ Gosper, R. W. (1997). "[math]\displaystyle{ \textstyle \int_{n/4}^{m/6} \log F(z) \,dz }[/math] in special functions, qseries and related topics". J. Am. Math. Soc. 14.
 ↑ Espinosa, Olivier; Moll, Victor H. (2002). "On Some Integrals Involving the Hurwitz Zeta Function: Part 1". The Ramanujan Journal 6 (2): 159–188. doi:10.1023/A:1015706300169.
 ↑ Bailey, David H.; Borwein, David; Borwein, Jonathan M. (2015). "On Eulerian loggamma integrals and TornheimWitten zeta functions". The Ramanujan Journal 36 (1–2): 43–68. doi:10.1007/s1113901294271.
 ↑ Amdeberhan, T.; Coffey, Mark W.; Espinosa, Olivier; Koutschan, Christoph; Manna, Dante V.; Moll, Victor H. (2011). "Integrals of powers of loggamma". Proc. Amer. Math. Soc. 139 (2): 535–545. doi:10.1090/S000299392010105890.
 ↑ E.A. Karatsuba, Fast evaluation of transcendental functions. Probl. Inf. Transm. Vol.27, No.4, pp. 339–360 (1991).
 ↑ E.A. Karatsuba, On a new method for fast evaluation of transcendental functions. Russ. Math. Surv. Vol.46, No.2, pp. 246–247 (1991).
 ↑ E.A. Karatsuba "Fast Algorithms and the FEE Method".
 ↑ Borwein, J. M.; Zucker, I. J. (1992). "Fast evaluation of the gamma function for small rational fractions using complete elliptic integrals of the first kind". IMA Journal of Numerical Analysis 12 (4): 519–526. doi:10.1093/IMANUM/12.4.519.
 ↑ Michon, G. P. "Trigonometry and Basic Functions ". Numericana. Retrieved 5 May 2007.
 ↑ Chaudry, M. A. & Zubair, S. M. (2001). On A Class of Incomplete Gamma Functions with Applications. p. 37
 ↑ Rice, J. A. (1995). Mathematical Statistics and Data Analysis (Second Edition). p. 52–53
 ↑ Borwein, J.; Bailey, D. H.; Girgensohn, R. (2003). Experimentation in Mathematics. A. K. Peters. pp. 133. ISBN 9781568811369.
 ↑ "Interpolating the natural factorial n! or The birth of the real factorial function (1729  1826)". https://www.luschny.de/math/factorial/history.html.
 ↑ Euler's paper was published in Commentarii academiae scientiarum Petropolitanae 5, 1738, 36–57. See E19  De progressionibus transcendentibus seu quarum termini generales algebraice dari nequeunt, from The Euler Archive, which includes a scanned copy of the original article.
 ↑ Remmert, R. (2006). Classical Topics in Complex Function Theory. Springer. ISBN 9780387982212.
 ↑ Lanczos, C. (1964). "A precision approximation of the gamma function". J. SIAM Numer. Anal. Ser. B 1 (1): 86. doi:10.1137/0701008. Bibcode: 1964SJNA....1...86L.
 ↑ Ilker Inam; Engin Büyükaşşk (2019). Notes from the International Autumn School on Computational Number Theory. Springer. p. 205. ISBN 9783030125585. https://books.google.com/books?id=khCTDwAAQBAJ. Extract of page 205
 ↑ Knuth, D. E. (1997). The Art of Computer Programming, Volume 1 (Fundamental Algorithms). AddisonWesley.
 ↑ Borwein, Jonathan M.; Corless, Robert M. (2017). "Gamma and Factorial in the Monthly" (in en). American Mathematical Monthly (Mathematical Association of America) 125 (5): 400–24. doi:10.1080/00029890.2018.1420983. Bibcode: 2017arXiv170305349B.
 ↑ Berry, M. (April 2001). "Why are special functions special?". Physics Today. http://scitation.aip.org/journals/doc/PHTOADft/vol_54/iss_4/11_1.shtml?bypassSSO=1.
 ↑ "microsoft/calculator" (in en). https://github.com/microsoft/calculator.
Further reading
 Abramowitz, Milton; Stegun, Irene A., eds (1972). "Chapter 6". Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. New York: Dover. http://www.math.sfu.ca/~cbm/aands/page_253.htm.
 Andrews, G. E.; Askey, R.; Roy, R. (1999). "Chapter 1 (Gamma and Beta functions)". Special Functions. New York: Cambridge University Press. ISBN 9780521789882.
 Artin, Emil (2006). "The Gamma Function". in Rosen, Michael. Exposition by Emil Artin: a selection. History of Mathematics. 30. Providence, RI: American Mathematical Society.
 Askey, R.; Roy, R. (2010), "Gamma function", in Olver, Frank W. J.; Lozier, Daniel M.; Boisvert, Ronald F. et al., NIST Handbook of Mathematical Functions, Cambridge University Press, ISBN 9780521192255, http://dlmf.nist.gov/5
 Birkhoff, George D. (1913). "Note on the gamma function". Bull. Amer. Math. Soc. 20 (1): 1–10. doi:10.1090/s000299041913024297.
 Böhmer, P. E. (1939). Differenzengleichungen und bestimmte Integrale. Leipzig: Köhler Verlag.
 Davis, Philip J. (1959). "Leonhard Euler's Integral: A Historical Profile of the Gamma Function". American Mathematical Monthly 66 (10): 849–869. doi:10.2307/2309786.
 Post, Emil (1919). "The Generalized Gamma Functions". Annals of Mathematics. Second Series 20 (3): 202–217. doi:10.2307/1967871. https://www.jstor.org/stable/1967871. Retrieved 5 March 2021.
 Press, W. H.; Teukolsky, S. A.; Vetterling, W. T.; Flannery, B. P. (2007). "Section 6.1. Gamma Function". Numerical Recipes: The Art of Scientific Computing (3rd ed.). New York: Cambridge University Press. ISBN 9780521880688. http://apps.nrbook.com/empanel/index.html?pg=256.
 Rocktäschel, O. R. (1922). Methoden zur Berechnung der Gammafunktion für komplexes Argument. Dresden: Technical University of Dresden.
 Temme, Nico M. (1996). Special Functions: An Introduction to the Classical Functions of Mathematical Physics. New York: John Wiley & Sons. ISBN 9780471113133.
 Whittaker, E. T.; Watson, G. N. (1927). A Course of Modern Analysis. Cambridge University Press. ISBN 9780521588072.
External links
 NIST Digital Library of Mathematical Functions:Gamma function
 Pascal Sebah and Xavier Gourdon. Introduction to the Gamma Function. In PostScript and HTML formats.
 C++ reference for
std::tgamma
 Examples of problems involving the gamma function can be found at Exampleproblems.com.
 Hazewinkel, Michiel, ed. (2001), "Gamma function", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 9781556080104, https://www.encyclopediaofmath.org/index.php?title=p/g043310
 Wolfram gamma function evaluator (arbitrary precision)
 Volume of nSpheres and the Gamma Function at MathPages
Original source: https://en.wikipedia.org/wiki/Gamma function.
Read more 