In mathematics, the Gamma function extends the factorial function to complex and non-integer numbers (it is already defined on the naturals, and has simple poles at the negative integers). The factorial function of an integer n is written n! and is equal to the product n! = 1 × 2 × 3 × ⋯ × n. The Gamma function "fills in" the factorial function for non-integer and complex values of n. If z is a real variable, then for natural number values only, we have
but for non-natural values of z, the above equation does not apply, since the factorial function is not defined.
Because the gamma and factorial functions grow so rapidly for moderately-large arguments, many computing environments include an ln(gamma) function that returns the natural logarithm of the gamma function: this grows much more slowly, and for combinatorial calculations allows adding and subtracting logs instead of multiplying and dividing very large values.
The notation Γ(z) is due to Adrien-Marie Legendre. If the real part of the complex number z is positive, then the integral
Because Γ(1) = 1, this relation implies that
for all natural numbers n.
It is a meromorphic function of x with simple poles at x = -n (n = 0, 1, 2, 3, ...) and residues (-1)n/n!. George Allen, and Unwin, Ltd., The Universal Encyclopedia of Mathematics. United States of America, New American Library, Simon and Schuster, Inc., 1964. (Forward by James R. Newman) It can further be used to extend Γ(z) to a meromorphic function defined for all complex numbers z except z = 0, −1, −2, −3, ... by analytic continuation. It is this extended version that is commonly referred to as the Gamma function.
The following infinite product definitions for the Gamma function, due to Euler and Weierstrass respectively, are valid for all complex numbers z which are not negative integers or zero
where is the Euler-Mascheroni constant.
Other important functional equations for the Gamma function are Euler's reflection formula
and the duplication formula
The duplication formula is a special case of the multiplication theorem
Perhaps the most well-known value of the Gamma function at a non-integer argument is
which can be found by setting z=1/2 in the reflection formula or by noticing the beta function for (1/2, 1/2), which is .
The derivatives of the Gamma function are described in terms of the polygamma function. For example:
The Gamma function has a pole of order 1 at z = −n for every natural number n; the residue there is given by
The Bohr-Mollerup theorem states that among all functions extending the factorial functions to the positive real numbers, only the Gamma function is log-convex, that is, its natural logarithm is convex.
An alternative notation which was originally introduced by Gauss and which is sometimes used is the Pi function, which in terms of the Gamma function is
so that
Using the Pi function the reflection formula takes on the form
where sinc is the normalized sinc function, while the multiplication theorem takes on the form
We also sometimes find
which is an entire function, defined for every complex number. That π(z) is entire entails it has no poles, so Γ(z) has no zeros.
In the first integral above, which defines the Gamma function, the limits of integration are fixed. The incomplete Gamma function is the function obtained by allowing either the upper or lower limit of integration to be variable.
The Gamma function is related to the Beta function by the formula
The derivative of the logarithm 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 are the Gaussian sums, a type of exponential sum.
The reciprocal Gamma function is an entire function and has been studied as a specific topic.
By partial integration of Euler's integral, the Gamma function can also be written
where, if Re(z) has been reduced to the interval 2, the last integral is smaller than . Thus by choosing an appropriate x, the Gamma function can be evaluated to N bits of precision with the above series. If z is rational, the computation can be performed with binary splitting in time where M(N) is the time needed to multiply two N-bit numbers.
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).
Gamma and related functions | Special hypergeometric functions
Gama funkce | Gammafunktion | Función gamma | Fonction Gamma d'Euler | 감마 함수 | Funzione gamma | פונקציית גמא | Gammafunctie | ガンマ関数 | Funkcja Γ | Гамма-функция Эйлера | Funkcija gama | Гама-функција | Fungsi gamma | Gammafunktio | Gammafunktionen | Γ函数
This article is licensed under the GNU Free Documentation License.
It uses material from the
"Gamma function".
Home Page • arts • business • computers • games • health • hospitals • home • kids & teens • news • physicians • recreation• reference • regional • science • shopping • society • sports • world