Gamma  

General information  
General definition  
Fields of application  Calculus, mathematical analysis, statistics, physics 
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 every positive integer n,
Derived by Daniel Bernoulli, for complex numbers with a positive real part, the gamma function is defined via a convergent improper integral:
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.^{[clarification needed]}
The gamma function has no zeros, 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:
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.
The gamma function can be seen as a solution to the interpolation problem of finding a smooth curve that connects the points of the factorial sequence: for all positive integer values of . The simple formula for the factorial, x! = 1 × 2 × ⋯ × x is only valid when x is a positive integer, and no elementary function has this property, but a good solution is the gamma function .^{[1]}
The gamma function is not only smooth but analytic (except at the nonpositive integers), and it can be defined in several explicit ways. However, it is not the only analytic function that extends the factorial, as one may add any analytic function that is zero on the positive integers, such as for an integer .^{[1]} Such a function is known as a pseudogamma function, the most famous being the Hadamard function.^{[2]}
A more restrictive requirement is the functional equation which interpolates the shifted factorial :^{[3]}^{[4]}
But this still does not give a unique solution, since it allows for multiplication by any periodic function with and , such as . One way to resolve the ambiguity is the Bohr–Mollerup theorem, which shows that is the unique interpolating function over the positive reals which is logarithmically convex (superconvex),^{[5]} meaning that is convex (where is the natural logarithm).^{[6]}
The notation is due to Legendre.^{[1]} If the real part of the complex number z is strictly positive (), then the integral 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:
Recognizing that as
We can calculate :
Thus we can show that for any positive integer n by induction. Specifically, the base case is that , and the induction step is that
The identity can be used (or, yielding the same result, analytic continuation can be used) to uniquely extend the integral formulation for 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]}
There are many equivalent definitions.
For a fixed integer , as the integer increases, we have that ^{[7]}
If 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 is replaced by an arbitrary complex number ,
Multiplying both sides by gives This infinite product, which is due to Euler,^{[8]} converges for all complex numbers except the nonpositive integers, which fail because of a division by zero. Intuitively, this formula indicates that is approximately the result of computing for some large integer , multiplying by to approximate , and using the relationship backwards times to get an approximation for ; and furthermore that this approximation becomes exact as increases to infinity.
The infinite product for the reciprocal is an entire function, converging for every complex number z.
The definition for the gamma function due to Weierstrass is also valid for all complex numbers z except the nonpositive integers: where is the Euler–Mascheroni constant.^{[1]} This is the Hadamard product of in a rewritten form. The utility of this definition cannot be overstated as it appears in a certain identity involving pi.^{[citation needed]}
Proof of equivalence of the three definitions


Equivalence of the integral definition and Weierstrass definition By the integral definition, the relation and Hadamard factorization theorem, for some constants since is an entire function of order . Since as , (or an integer multiple of ) and since , Whence for some integer . Since for , we have and Equivalence of the Weierstrass definition and Euler definition Let and Then and therefore Then and taking gives the desired result. 
Besides the fundamental property discussed above: other important functional equations for the gamma function are Euler's reflection formula which implies and the Legendre duplication formula
Derivation of Euler's reflection formula


Proof 1 We can use Euler's infinite product to compute where the last equality is a known result. A similar derivation begins with Weierstrass's definition. Proof 2 First we prove that Consider the positively oriented rectangular contour with vertices at , , and where . Then by the residue theorem, Let and let be the analogous integral over the top side of the rectangle. Then as and . If denotes the right vertical side of the rectangle, then for some constant and since , the integral tends to as . Analogously, the integral over the left vertical side of the rectangle tends to as . Therefore from which Then and Proving the reflection formula for all proves it for all by analytic continuation. 
Derivation of the Legendre duplication formula


The beta function can be represented as Setting yields After the substitution we get The function 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 ^{[9]} Eq. 5.5.6):
A simple but useful property, which can be seen from the limit definition, is:
In particular, with z = a + bi, this product is
If the real part is an integer or a halfinteger, this can be finitely expressed in closed form:
Proof of absolute value formulas for arguments of integer or halfinteger real part


First, consider the reflection formula applied to . Applying the recurrence relation to the second term, we have which with simple rearrangement gives Second, consider the reflection formula applied to . Formulas for other values of 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 which can be found by setting in the reflection or duplication formulas, by using the relation to the beta function given below with , or simply by making the substitution in the integral definition of the gamma function, resulting in a Gaussian integral. In general, for nonnegative integer values of we have: where the double factorial . See Particular values of the gamma function for calculated values.
It might be tempting to generalize the result that by looking for a formula for other individual values where 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 are not known to be expressible by themselves in terms of elementary functions. It has been proved that is a transcendental number and algebraically independent of for any integer and each of the fractions .^{[10]} 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, ψ^{(0)}(z): For a positive integer m the derivative of the gamma function can be calculated as follows:
where H(m) is the mth harmonic number and γ is the Euler–Mascheroni constant.
For the th derivative of the gamma function is: (This can be derived by differentiating the integral form of the gamma function with respect to , and using the technique of differentiation under the integral sign.)
Using the identity where is the Riemann zeta function, and is the th Bell polynomial, we have in particular the Laurent series expansion of the gamma function ^{[11]}
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:
The last of these statements is, essentially by definition, the same as the statement that , where is the polygamma function of order 1. To prove the logarithmic convexity of the gamma function, it therefore suffices to observe that 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 and ,
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),
Main article: Stirling's approximation 
The behavior of for an increasing positive real variable is given by Stirling's formula where the symbol means asymptotic convergence: the ratio of the two sides converges to 1 in the limit .^{[1]} This growth is faster than exponential, , for any fixed value of .
Another useful limit for asymptotic approximations for is:
When writing the error term as an infinite product, Stirling's formula can be used to define the gamma function: ^{[12]}
The behavior for nonpositive is more intricate. Euler's integral does not converge for , 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]} choosing such that is positive. The product in the denominator is zero when equals any of the integers . 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 of a complex variable , at a simple pole , the residue of is given by:
For the simple pole we rewrite recurrence formula as: The numerator at is and the denominator So the residues of the gamma function at those points are:^{[13]} 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 for which , and hence the reciprocal gamma function is an entire function, with zeros at .^{[1]}
On the real line, the gamma function has a local minimum at z_{min} ≈ +1.46163214496836234126^{[14]} where it attains the value Γ(z_{min}) ≈ +0.88560319441088870027.^{[15]} The gamma function rises to either side of this minimum. The solution to Γ(z − 0.5) = Γ(z + 0.5) is z = +1.5 and the common value is Γ(1) = Γ(2) = +1. The positive solution to Γ(z − 1) = Γ(z + 1) is z = φ ≈ +1.618, the golden ratio, and the common value is Γ(φ − 1) = Γ(φ + 1) = φ! ≈ +1.44922960226989660037.^{[16]}
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 and is odd, and an even number if the number of poles is even.^{[13]} The values at the local extrema of the gamma function along the real axis between the nonpositive integers are:
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,^{[22]} and^{[23]} where the three integrals respectively follow from the substitutions , ^{[24]} and ^{[25]} in Euler's second integral. The last integral in particular makes clear the connection between the gamma function at half integer arguments and the Gaussian integral: if we let we get .
Binet's first integral formula for the gamma function states that, when the real part of z is positive, then:^{[26]} The integral on the righthand side may be interpreted as a Laplace transform. That is,
Binet's second integral formula states that, again when the real part of z is positive, then:^{[27]}
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 by taking a branch cut along [0, ∞) and by taking 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:^{[28]} where is interpreted as . The reflection formula leads to the closely related expression again valid whenever z is not an integer.
The gamma function can also be represented by a sum of two continued fractions:^{[29]}^{[30]} where .
The logarithm of the gamma function has the following Fourier series expansion for which was for a long time attributed to Ernst Kummer, who derived it in 1847.^{[31]}^{[32]} However, Iaroslav Blagouchine discovered that Carl Johan Malmsten first derived this series in 1842.^{[33]}^{[34]}
In 1840 Joseph Ludwig Raabe proved that In particular, if then
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 gives the formula.
An alternative notation that was originally introduced by Gauss is the function, which, in terms of the gamma function, is so that for every nonnegative integer .
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, just like the reciprocal gamma function. That is entire entails it has no poles, so , like , has no zeros.
The volume of an nellipsoid with radii r_{1}, …, r_{n} can be expressed as
Main article: Particular values of the gamma function 
Including up to the first 20 digits after the decimal point, some particular values of the gamma function are: (These numbers can be found in the OEIS.^{[35]}^{[36]}^{[37]}^{[38]}^{[39]}^{[40]} The values presented here are truncated rather than rounded.) 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):
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^{[41]}
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
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 an approximation for large Re(z):
This can be used to accurately approximate ln(Γ(z)) for z with a smaller Re(z) via (P.E.Böhmer, 1939)
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.
In a more "natural" presentation:
The coefficients of the terms with k > 1 of z^{1−k} in the last expansion are simply where the B_{k} are the Bernoulli numbers.
The gamma function also has Stirling Series (derived by Charles Hermite in 1900) equal to^{[42]}
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.
The gamma function is the unique function that simultaneously satisfies
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: with ζ(k) denoting the Riemann zeta function at k.
So, using the following property: we can find an integral representation for the ln(Γ) function: 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:
There also exist special formulas for the logarithm of the gamma function for rational z. For instance, if and are integers with and then see.^{[43]} This formula is sometimes used for numerical computation, since the integrand decreases very quickly.
The integral can be expressed in terms of the Barnes Gfunction^{[44]}^{[45]} (see Barnes Gfunction for a proof): where Re(z) > −1.
It can also be written in terms of the Hurwitz zeta function:^{[46]}^{[47]}
When it follows that 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 :^{[48]} where is .
D. H. Bailey and his coauthors^{[49]} gave an evaluation for when in terms of the Tornheim–Witten zeta function and its derivatives.
In addition, it is also known that^{[50]}
Complex values of the gamma function can be approximated using Stirling's approximation or the Lanczos approximation, 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 by applying integration by parts to Euler's integral. For any positive number x the gamma function can be written
When Re(z) ∈ [1,2] and , the absolute value of the last integral is smaller than . By choosing a large enough , this last expression can be made smaller than for any desired value . Thus, the gamma function can be evaluated to 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.^{[51]}^{[52]}^{[53]}
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).^{[54]}
Unlike many other functions, such as a Normal Distribution, no obvious fast, accurate implementation that is easy to implement for the Gamma Function is easily found. Therefore, it is worth investigating potential solutions. For the case that speed is more important than accuracy, published tables for are easily found in an Internet search, such as the Online Wiley Library. Such tables may be used with linear interpolation. Greater accuracy is obtainable with the use of cubic interpolation at the cost of more computational overhead. Since tables are usually published for argument values between 1 and 2, the property may be used to quickly and easily translate all real values and into the range , such that only tabulated values of between 1 and 2 need be used.^{[55]}
If interpolation tables are not desirable, then the Lanczos approximation mentioned above works well for 1 to 2 digits of accuracy for small, commonly used values of z. If the Lanczos approximation is not sufficiently accurate, the Sterling's formula for the Gamma Function may be used. A more complete and accurate solution to Sterling's Approximation may be found at Math2.org, and is reproduced below in terms of ^{[56]} for the first 8 () terms. Based on experimental findings against known values of for 1, 1.5, and 2 (1, , and 1 respectively), this solution is accurate to 9 digits for values of z above 5 and 16 digits for z above 20. Smaller values of z are less accurate, but the simple translation of may be used to easily translate higher, more accurate values to lower values when needed. Less accurate needs may also be accommodated by simply using fewer terms of the infinite series.
Stirling's Asymptotic Series for using the first 8 terms:
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 Γ(z) is most difficult to avoid."^{[57]}
The gamma function finds application in such diverse areas as quantum physics, astrophysics and fluid dynamics.^{[58]} 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.^{[59]}
The primary reason for the gamma function's usefulness in such contexts is the prevalence of expressions of the type 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
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 and integrals thereof, such as the error function. There are many interrelations between these functions and the gamma function; notably, the factor obtained by evaluating 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.
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. For example, for any complex numbers z and n, with z < 1, we can write which closely resembles the binomial coefficient when n is a nonnegative integer,
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
If we have a way to calculate the gamma function numerically, it is very simple 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.
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:
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".^{[60]} Another contender for that title might be
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.
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]}
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^{[61]} 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, 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 which is valid when the real part of the complex number n is strictly greater than −1 (i.e., ). 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.^{[62]} 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.
Carl Friedrich Gauss rewrote Euler's product as 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.^{[63]} 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, 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!).^{[64]} 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 on the Lie group R^{+}. Thus this normalization makes it clearer that the gamma function is a continuous analogue of a Gauss sum.^{[65]}
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.^{[66]} 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 equivalence 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^{[67]} review three centuries of work on the gamma function.
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.^{[68]}
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 Emde , 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."^{[69]}
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. In some software calculators, e.g. Windows Calculator and GNOME Calculator, the factorial function returns Γ(x + 1) when the input x is a noninteger value.^{[70]}^{[71]}