Gamma function: Difference between revisions
imported>JackFred2 m Fix broken link |
imported>Quantling →Euler's definition as an infinite product: motivation first |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 4: | Line 4: | ||
{{Use dmy dates|date=December 2016}} | {{Use dmy dates|date=December 2016}} | ||
{{Infobox mathematical function | {{Dark mode invert|image=y|{{Infobox mathematical function | ||
| name = Gamma | | name = Gamma | ||
| image = Gamma plot.svg | | image = Gamma plot.svg | ||
| Line 10: | Line 10: | ||
| caption = The gamma function along part of the real axis | | caption = The gamma function along part of the real axis | ||
| general_definition = <math>\Gamma(z) = \int_0^\infty t^{z-1} e^{-t}\,dt</math> | | general_definition = <math>\Gamma(z) = \int_0^\infty t^{z-1} e^{-t}\,dt</math> | ||
| fields_of_application = Calculus, mathematical analysis, statistics, physics | | fields_of_application = Calculus, mathematical analysis, statistics, physics | ||
}} | }}}} | ||
In [[mathematics]], the '''gamma function''' (represented by Γ, capital [[Greek alphabet|Greek]] letter [[gamma]]) is the most common extension of the [[factorial function]] to [[complex number]]s. Derived by [[Daniel Bernoulli]], the gamma function <math>\Gamma(z)</math> is defined for all complex numbers <math>z</math> except non-positive integers, and | In [[mathematics]], the '''gamma function''' (represented by {{math|Γ}}, capital [[Greek alphabet|Greek]] letter [[gamma]]) is the most common extension of the [[factorial function]] to [[complex number]]s. Derived by [[Daniel Bernoulli]], the gamma function <math>\Gamma(z)</math> is defined for all complex numbers <math>z</math> except non-positive integers, and <math>\Gamma(n) = (n-1)!</math> for every [[positive integer]] {{tmath|n}}. The gamma function can be defined via a convergent [[improper integral]] for complex numbers with positive real part: | ||
<math display="block"> \Gamma(z) = \int_0^\infty t^{z-1} e^{-t}\text{ d}t, \ \qquad \Re(z) > 0\,.</math>The gamma function then is defined in the complex plane as the [[analytic continuation]] of this integral function: it is a [[meromorphic function]] which is [[holomorphic function|holomorphic]] except at zero and the negative integers, where it has simple [[Zeros and poles|poles]]. | <math display="block"> \Gamma(z) = \int_0^\infty t^{z-1} e^{-t}\text{ d}t, \ \qquad \Re(z) > 0\,.</math>The gamma function then is defined in the complex plane as the [[analytic continuation]] of this integral function: it is a [[meromorphic function]] which is [[holomorphic function|holomorphic]] except at zero and the negative integers, where it has simple [[Zeros and poles|poles]]. | ||
| Line 24: | Line 24: | ||
== Motivation == | == Motivation == | ||
[[File:Generalized factorial function more infos.svg|thumb| | {{Dark mode invert|image=y|[[File:Generalized factorial function more infos.svg|thumb|upright=1.65|<math>\Gamma(x+1)</math> interpolates the factorial function to non-integer values.]]}} | ||
<!--Can anyone change these into <math></math>?--> | <!--Can anyone change these into <math></math>?--> | ||
The gamma function can be seen as a solution to the [[interpolation]] problem of finding a [[smooth curve]] <math>y=f(x)</math> that connects the points of the factorial sequence: <math>(x,y) = (n, n!) </math> for all positive integer values of | The gamma function can be seen as a solution to the [[interpolation]] problem of finding a [[smooth curve]] <math>y=f(x)</math> that connects the points of the factorial sequence: <math>(x,y) = (n, n!) </math> for all positive integer values of {{tmath|n}}. The simple formula for the factorial, {{math|1=''x''! = 1 × 2 × ⋯ × ''x''}} is only valid when {{mvar|x}} is a positive integer, and no [[elementary function]] has this property, but a good solution is the gamma function {{tmath|1=f(x) = \Gamma(x+1)}}.<ref name="Davis" /> | ||
The gamma function is not only smooth but [[analytic function|analytic]] (except at the non-positive 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 <math>k\sin(m\pi x)</math> for an integer | The gamma function is not only smooth but [[analytic function|analytic]] (except at the non-positive 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 <math>k\sin(m\pi x)</math> for an integer {{tmath|m}}.<ref name="Davis" /> Such a function is known as a [[pseudogamma function]], the most famous being the [[Hadamard's gamma function|Hadamard]] function.<ref>{{Cite web |title=Is the Gamma function misdefined? Or: Hadamard versus Euler — Who found the better Gamma function? |url=https://www.luschny.de/math/factorial/hadamard/HadamardsGammaFunctionMJ.html}}</ref> | ||
[[File:Gamma plus sin pi z.svg|thumb| | [[File:Gamma plus sin pi z.svg|thumb|upright=1.65|The gamma function, {{math|Γ(''z'')}} in blue, plotted along with {{math|Γ(''z'') + sin(π''z'')}} in green. Notice the intersection at positive integers. Both are valid extensions of the factorials to a meromorphic function on the complex plane.]] | ||
A more restrictive requirement is the [[functional equation]] which interpolates the shifted factorial <math>f(n) = (n{-}1)! </math> :<ref>{{cite book |title=Special Functions: A Graduate Text |first1=Richard |last1=Beals |first2=Roderick |last2=Wong |publisher=Cambridge University Press |year=2010 |isbn=978-1-139-49043-6 |page=28 |url=https://books.google.com/books?id=w87QUuTVIXYC}} [https://books.google.com/books?id=w87QUuTVIXYC&pg=PA28 Extract of page 28]</ref><ref>{{cite book |title=Differential Equations: An Introduction with Mathematica |edition=illustrated |first1=Clay C. |last1=Ross |publisher=Springer Science & Business Media |year=2013 |isbn=978-1-4757-3949-7 |page=293 |url=https://books.google.com/books?id=Z4bjBwAAQBAJ}} [https://books.google.com/books?id=Z4bjBwAAQBAJ&pg=PA293 Expression G.2 on page 293]</ref> | A more restrictive requirement is the [[functional equation]] which interpolates the shifted factorial <math>f(n) = (n{-}1)! </math> :<ref>{{cite book |title=Special Functions: A Graduate Text |first1=Richard |last1=Beals |first2=Roderick |last2=Wong |publisher=Cambridge University Press |year=2010 |isbn=978-1-139-49043-6 |page=28 |url=https://books.google.com/books?id=w87QUuTVIXYC}} [https://books.google.com/books?id=w87QUuTVIXYC&pg=PA28 Extract of page 28]</ref><ref>{{cite book |title=Differential Equations: An Introduction with Mathematica |edition=illustrated |first1=Clay C. |last1=Ross |publisher=Springer Science & Business Media |year=2013 |isbn=978-1-4757-3949-7 |page=293 |url=https://books.google.com/books?id=Z4bjBwAAQBAJ}} [https://books.google.com/books?id=Z4bjBwAAQBAJ&pg=PA293 Expression G.2 on page 293]</ref> | ||
<math display="block">f(x+1) = x f(x)\ \text{ for all } x>0, \qquad f(1) = 1.</math><!-- please note that this is not the factorial function. It is the gamma function, which is a translated version of the factorial. See the cited sources --> | <math display="block">f(x+1) = x f(x)\ \text{ for all } x>0, \qquad f(1) = 1.</math><!-- please note that this is not the factorial function. It is the gamma function, which is a translated version of the factorial. See the cited sources --> | ||
But this still does not give a unique solution, since it allows for multiplication by any periodic function <math>g(x)</math> with <math>g(x) = g(x+1)</math> and | But this still does not give a unique solution, since it allows for multiplication by any periodic function <math>g(x)</math> with <math>g(x) = g(x+1)</math> and {{tmath|1=g(0)=1}}, such as {{tmath|1=g(x) = e^{{mset|k\sin(m\pi x)}}}}. | ||
One way to resolve the ambiguity is the [[Bohr–Mollerup theorem]], which shows that <math>f(x) = \Gamma(x)</math> is the unique interpolating function for the factorial, defined over the positive reals, which is [[Logarithmically convex function|logarithmically convex]],<ref name="Kingman1961">{{cite journal|last1=Kingman|first1=J. F. C.|title=A Convexity Property of Positive Matrices|journal=The Quarterly Journal of Mathematics|date=1961|volume=12|issue=1|pages=283–284|doi=10.1093/qmath/12.1.283|bibcode=1961QJMat..12..283K}}</ref> meaning that <math>y = \log f(x) </math> is [[Convex function|convex]].<ref>{{MathWorld | urlname=Bohr-MollerupTheorem | title=Bohr–Mollerup Theorem}}</ref> | One way to resolve the ambiguity is the [[Bohr–Mollerup theorem]], which shows that <math>f(x) = \Gamma(x)</math> is the unique interpolating function for the factorial, defined over the positive reals, which is [[Logarithmically convex function|logarithmically convex]],<ref name="Kingman1961">{{cite journal|last1=Kingman|first1=J. F. C.|title=A Convexity Property of Positive Matrices|journal=The Quarterly Journal of Mathematics|date=1961|volume=12|issue=1|pages=283–284|doi=10.1093/qmath/12.1.283|bibcode=1961QJMat..12..283K}}</ref> meaning that <math>y = \log f(x) </math> is [[Convex function|convex]].<ref>{{MathWorld | urlname=Bohr-MollerupTheorem | title=Bohr–Mollerup Theorem}}</ref> | ||
| Line 44: | Line 44: | ||
The notation <math>\Gamma (z)</math> is due to [[Adrien-Marie Legendre|Legendre]].<ref name="Davis" /> If the real part of the complex number {{mvar|z}} is strictly positive (<math>\Re (z) > 0</math>), then the [[integral]] | The notation <math>\Gamma (z)</math> is due to [[Adrien-Marie Legendre|Legendre]].<ref name="Davis" /> If the real part of the complex number {{mvar|z}} is strictly positive (<math>\Re (z) > 0</math>), then the [[integral]] | ||
<math display="block"> \Gamma(z) = \int_0^\infty t^{z-1} e^{-t}\, dt</math> | <math display="block"> \Gamma(z) = \int_0^\infty t^{z-1} e^{-t}\, dt</math> | ||
[[absolute convergence|converges absolutely]], and is known as the '''Euler integral of the second kind'''. (Euler's integral of the first kind is the [[beta function]].<ref name="Davis" />) | [[absolute convergence|converges absolutely]], and is known as the '''Euler integral of the second kind'''. (Euler's integral of the first kind is the [[beta function]].<ref name="Davis" />) | ||
[[File:Plot of gamma function in complex plane in 3D with color and legend and 1000 plot points created with Mathematica.svg|alt=Absolute value (vertical) and argument (color) of the gamma function on the complex plane|thumb|Absolute value (vertical) and argument (color) of the gamma function on the complex plane]] | |||
[[File:Plot of gamma function in complex plane in 3D with color and legend and 1000 plot points created with Mathematica.svg|alt=Absolute value (vertical) and argument (color) of the gamma function on the complex plane|thumb|upright=1.65|Absolute value (vertical) and argument (color) of the gamma function on the complex plane]] | |||
The value <math>\Gamma(1)</math> can be calculated as: | |||
<math display="block">\begin{align} | |||
\Gamma(1) & = \int_0^\infty t^{1-1} e^{-t}\,dt \\ | |||
& = \int_0^\infty e^{-t} \, dt = 1. | |||
\end{align}</math> | |||
Using [[integration by parts]], one sees that: | |||
<math display="block">\begin{align} | <math display="block">\begin{align} | ||
\Gamma(z+1) & = \int_0^\infty t^{z} e^{-t} \, dt \\ | \Gamma(z+1) & = \int_0^\infty t^{z} e^{-t} \, dt \\ | ||
&= \Bigl[-t^z e^{-t}\Bigr]_0^\infty + \int_0^\infty z t^{z-1} e^{-t}\, dt | &= \Bigl[-t^z e^{-t}\Bigr]_0^\infty + \int_0^\infty z t^{z-1} e^{-t}\, dt | ||
\end{align}</math> | \end{align}</math> | ||
Recognizing that <math>-t^z e^{-t}\to 0</math> as {{tmath|t\to 0}} (so long as <math>\Re (z) > 0</math>) and as {{tmath|t\to \infty}}, | |||
Recognizing that <math>-t^z e^{-t}\to 0</math> as <math>t\to \infty, | |||
<math display="block">\begin{align} | <math display="block">\begin{align} | ||
\Gamma(z+1) & = z\int_0^\infty t^{z-1} e^{-t}\, dt \\ | \Gamma(z+1) & = z\int_0^\infty t^{z-1} e^{-t}\, dt \\ | ||
| Line 58: | Line 64: | ||
\end{align}</math> | \end{align}</math> | ||
Thus we have shown that <math>\Gamma(n) = (n-1)!</math> for any positive integer {{mvar|n}} by [[proof by induction|induction]]. | |||
Thus we | |||
The identity <math display="inline">\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>\Gamma (z)</math> to a [[meromorphic function]] defined for all complex numbers {{mvar|z}}, except integers less than or equal to zero.<ref name="Davis" /> It is this extended version that is commonly referred to as the gamma function.<ref name="Davis" /> | The identity <math display="inline">\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>\Gamma (z)</math> to a [[meromorphic function]] defined for all complex numbers {{mvar|z}}, except integers less than or equal to zero.<ref name="Davis" /> It is this extended version that is commonly referred to as the gamma function.<ref name="Davis" /> | ||
| Line 73: | Line 72: | ||
==== Euler's definition as an infinite product ==== | ==== Euler's definition as an infinite product ==== | ||
<!-- Linked to from [[Binomial coefficient]] -->For a fixed integer | <!-- Linked to from [[Binomial coefficient]] -->For a fixed integer {{tmath|m}}, as the integer <math>n</math> increases, we have that<ref>{{Cite journal |last=Davis |first=Philip |title=Leonhard Euler's Integral: A Historical Profile of the Gamma Function |url=https://ia800108.us.archive.org/view_archive.php?archive=/24/items/wikipedia-scholarly-sources-corpus/10.2307%252F2287541.zip&file=10.2307%252F2309786.pdf |website=maa.org}}</ref> | ||
<math display="block">\lim_{n \to \infty} \frac{n! \, \left(n+1\right)^m}{(n+m)!} = 1\,.</math> | <math display="block">\lim_{n \to \infty} \frac{n! \, \left(n+1\right)^m}{(n+m)!} = 1\,.</math> | ||
If <math>m</math> is not an integer | If <math>m</math> is not an integer then this equation is meaningless since, in this section, the factorial of a non-integer has not been defined yet. However, in order to define the Gamma function for non-integers, let us assume that this equation continues to hold when <math>m</math> is replaced by an arbitrary complex number {{tmath|z}}: | ||
<math display="block">\lim_{n \to \infty} \frac{n! \, \left(n+1\right)^z}{(n+z)!} = 1\,.</math> | <math display="block">\lim_{n \to \infty} \frac{n! \, \left(n+1\right)^z}{(n+z)!} = 1\,.</math> | ||
| Line 87: | Line 86: | ||
\end{align}</math>This [[infinite product]], which is due to Euler,<ref>{{Cite journal |last=Bonvini |first=Marco |date=October 9, 2010 |title=The Gamma function |url=https://www.roma1.infn.it/~bonvini/math/Marco_Bonvini__Gamma_function.pdf |journal=Roma1.infn.it}}</ref> converges for all complex numbers <math>z</math> except the non-positive integers, which fail because of a division by zero. In fact, the above assumption produces a unique definition of <math>\Gamma(z)</math> as {{tmath|(z-1)!}}. | \end{align}</math>This [[infinite product]], which is due to Euler,<ref>{{Cite journal |last=Bonvini |first=Marco |date=October 9, 2010 |title=The Gamma function |url=https://www.roma1.infn.it/~bonvini/math/Marco_Bonvini__Gamma_function.pdf |journal=Roma1.infn.it}}</ref> converges for all complex numbers <math>z</math> except the non-positive integers, which fail because of a division by zero. In fact, the above assumption produces a unique definition of <math>\Gamma(z)</math> as {{tmath|(z-1)!}}. | ||
Intuitively, this formula indicates that <math>\Gamma(z)</math> is approximately the result of computing <math>\Gamma(n+1)=n!</math> for some large integer | Intuitively, this formula indicates that <math>\Gamma(z)</math> is approximately the result of computing <math>\Gamma(n+1)=n!</math> for some large integer {{tmath|n}}, multiplying by <math>(n+1)^z</math> to approximate {{tmath|\Gamma(n+z+1)}}, and then using the relationship <math>\Gamma(x+1) = x \Gamma(x)</math> backwards <math>n+1</math> times to get an approximation for <math>\Gamma(z)</math>; and furthermore that this approximation becomes exact as <math>n</math> increases to infinity. | ||
The infinite product for the [[reciprocal gamma function|reciprocal]] | The infinite product for the [[reciprocal gamma function|reciprocal]] | ||
| Line 96: | Line 95: | ||
The definition for the gamma function due to [[Karl Weierstrass|Weierstrass]] is also valid for all complex numbers <math>z</math> except non-positive integers: | The definition for the gamma function due to [[Karl Weierstrass|Weierstrass]] is also valid for all complex numbers <math>z</math> except non-positive integers: | ||
<math display="block">\Gamma(z) = \frac{e^{-\gamma z}} z \prod_{n=1}^\infty \left(1 + \frac z n \right)^{-1} e^{z/n},</math> | <math display="block">\Gamma(z) = \frac{e^{-\gamma z}} z \prod_{n=1}^\infty \left(1 + \frac z n \right)^{-1} e^{z/n},</math> | ||
where <math>\gamma \approx 0.577216</math> is the [[Euler–Mascheroni constant]].<ref name="Davis" /> This is the [[Entire function#Genus|Hadamard product]] of <math>1 | where <math>\gamma \approx 0.577216</math> is the [[Euler–Mascheroni constant]].<ref name="Davis" /> This is the [[Entire function#Genus|Hadamard product]] of <math>\frac{1}{\Gamma(z)}</math> in a rewritten form. | ||
{{Collapse top|title=Proof of equivalence of the three definitions}} | {{Collapse top|title=Proof of equivalence of the three definitions}} | ||
| Line 103: | Line 102: | ||
By the integral definition, the relation <math>\Gamma (z+1)=z\Gamma (z)</math> and [[Hadamard factorization theorem]], | By the integral definition, the relation <math>\Gamma (z+1)=z\Gamma (z)</math> and [[Hadamard factorization theorem]], | ||
<math display="block>\frac{1}{\Gamma (z)}=ze^{c_1 z+c_2}\prod_{n=1}^\infty e^{-\frac{z}{n}}\left(1+\frac{z}{n}\right)</math> | <math display="block>\frac{1}{\Gamma (z)}=ze^{c_1 z+c_2}\prod_{n=1}^\infty e^{-\frac{z}{n}}\left(1+\frac{z}{n}\right)</math> | ||
for some constants <math>c_1,c_2</math> since <math>1/\Gamma</math> is an entire function of order | for some constants <math>c_1,c_2</math> since <math>1/\Gamma</math> is an entire function of order {{tmath|1}}. Since <math>z\Gamma (z)\to 1</math> as {{tmath|z\to 0}}, <math>c_2=0</math> (or an integer multiple of <math>2\pi i</math>) and since {{tmath|1=\Gamma (1)=1}}, | ||
<math display="block">\begin{align}e^{-c_1} | <math display="block">\begin{align}e^{-c_1} | ||
&=\prod_{n=1}^\infty e^{-\frac{1}{n}}\left(1+\frac{1}{n}\right)\\ | &=\prod_{n=1}^\infty e^{-\frac{1}{n}}\left(1+\frac{1}{n}\right)\\ | ||
| Line 109: | Line 108: | ||
&=\exp\left(\lim_{N\to\infty}\left(\log (N+1)-\sum_{n=1}^N \frac{1}{n}\right)\right).\end{align}</math> | &=\exp\left(\lim_{N\to\infty}\left(\log (N+1)-\sum_{n=1}^N \frac{1}{n}\right)\right).\end{align}</math> | ||
where <math>c_1=\gamma+2\pi i k</math> for some integer | where <math>c_1=\gamma+2\pi i k</math> for some integer {{tmath|k}}. Since <math>\Gamma (z)\in\mathbb{R}</math> for {{tmath|z\in\mathbb{R}\setminus\mathbb{Z}_0^-}}, we have <math>k=0</math> and | ||
<math display="block>\frac{1}{\Gamma (z)}=ze^{\gamma z}\prod_{n=1}^\infty e^{-\frac{z}{n}}\left(1+\frac{z}{n}\right)</math> | <math display="block>\frac{1}{\Gamma (z)}=ze^{\gamma z}\prod_{n=1}^\infty e^{-\frac{z}{n}}\left(1+\frac{z}{n}\right)</math> | ||
| Line 149: | Line 148: | ||
First prove that | First prove that | ||
<math display="block">I=\int_{-\infty}^\infty \frac{e^{ax}}{1+e^x}\, dx=\int_0^\infty \frac{v^{a-1}}{1+v}\, dv=\frac{\pi}{\sin\pi a},\quad a\in (0,1).</math> | <math display="block">I=\int_{-\infty}^\infty \frac{e^{ax}}{1+e^x}\, dx=\int_0^\infty \frac{v^{a-1}}{1+v}\, dv=\frac{\pi}{\sin\pi a},\quad a\in (0,1).</math> | ||
Consider the positively oriented rectangular contour <math>C_R</math> with vertices at | Consider the positively oriented rectangular contour <math>C_R</math> with vertices at {{tmath|R}}, {{tmath|-R}}, <math>R+2\pi i</math> and <math>-R+2\pi i</math> where {{tmath|R\in\mathbb{R}^+}}. Then by the [[residue theorem]], | ||
<math display="block">\int_{C_R}\frac{e^{az}}{1+e^z}\, dz=-2\pi ie^{a\pi i}.</math> | <math display="block">\int_{C_R}\frac{e^{az}}{1+e^z}\, dz=-2\pi ie^{a\pi i}.</math> | ||
Let | Let | ||
<math display="block">I_R=\int_{-R}^R \frac{e^{ax}}{1+e^x}\, dx</math> | <math display="block">I_R=\int_{-R}^R \frac{e^{ax}}{1+e^x}\, dx</math> | ||
and let <math>I_R'</math> be the analogous integral over the top side of the rectangle. Then <math>I_R\to I</math> as <math>R\to\infty</math> and | and let <math>I_R'</math> be the analogous integral over the top side of the rectangle. Then <math>I_R\to I</math> as <math>R\to\infty</math> and {{tmath|1=I_R'=-e^{2\pi i a}I_R}}. If <math>A_R</math> denotes the right vertical side of the rectangle, then | ||
<math display="block">\left|\int_{A_R} \frac{e^{az}}{1+e^z}\, dz\right|\le \int_0^{2\pi}\left|\frac{e^{a(R+it)}}{1+e^{R+it}}\right|\, dt\le Ce^{(a-1)R}</math> | <math display="block">\left|\int_{A_R} \frac{e^{az}}{1+e^z}\, dz\right|\le \int_0^{2\pi}\left|\frac{e^{a(R+it)}}{1+e^{R+it}}\right|\, dt\le Ce^{(a-1)R}</math> | ||
for some constant <math>C</math> and since | for some constant <math>C</math> and since {{tmath|a<1}}, the integral tends to <math>0</math> as {{tmath|R\to\infty}}. Analogously, the integral over the left vertical side of the rectangle tends to <math>0</math> as {{tmath|R\to\infty}}. Therefore | ||
<math display="block">I-e^{2\pi ia}I=-2\pi ie^{a\pi i},</math> | <math display="block">I-e^{2\pi ia}I=-2\pi ie^{a\pi i},</math> | ||
from which | from which | ||
| Line 221: | Line 220: | ||
{{Collapse top|title=Proof of absolute value formulas for arguments of integer or half-integer real part}} | {{Collapse top|title=Proof of absolute value formulas for arguments of integer or half-integer real part}} | ||
First, consider the reflection formula applied to | First, consider the reflection formula applied to {{tmath|1=z=bi}}. | ||
<math display="block">\Gamma(bi)\Gamma(1-bi)=\frac{\pi}{\sin \pi bi}</math> | <math display="block">\Gamma(bi)\Gamma(1-bi)=\frac{\pi}{\sin \pi bi}</math> | ||
Applying the recurrence relation to the second term: | Applying the recurrence relation to the second term: | ||
| Line 228: | Line 227: | ||
<math display="block">\Gamma(bi)\Gamma(-bi)=\frac{\pi}{-bi\sin \pi bi}=\frac{\pi}{b\sinh \pi b}</math> | <math display="block">\Gamma(bi)\Gamma(-bi)=\frac{\pi}{-bi\sin \pi bi}=\frac{\pi}{b\sinh \pi b}</math> | ||
Second, consider the reflection formula applied to | Second, consider the reflection formula applied to {{tmath|1=z=\tfrac{1}{2}+bi}}. | ||
<math display="block">\Gamma(\tfrac{1}{2}+bi)\Gamma\left(1-(\tfrac{1}{2}+bi)\right)=\Gamma(\tfrac{1}{2}+bi)\Gamma(\tfrac{1}{2}-bi)=\frac{\pi}{\sin \pi (\tfrac{1}{2}+bi)}=\frac{\pi}{\cos \pi bi}=\frac{\pi}{\cosh \pi b}</math> | <math display="block">\Gamma(\tfrac{1}{2}+bi)\Gamma\left(1-(\tfrac{1}{2}+bi)\right)=\Gamma(\tfrac{1}{2}+bi)\Gamma(\tfrac{1}{2}-bi)=\frac{\pi}{\sin \pi (\tfrac{1}{2}+bi)}=\frac{\pi}{\cos \pi bi}=\frac{\pi}{\cosh \pi b}</math> | ||
| Line 237: | Line 236: | ||
Perhaps the best-known value of the gamma function at a non-integer argument is | Perhaps the best-known value of the gamma function at a non-integer argument is | ||
<math display="block">\Gamma\left(\tfrac12\right)=\sqrt{\pi},</math> | <math display="block">\Gamma\left(\tfrac12\right)=\sqrt{\pi},</math> | ||
which can be found by setting <math display="inline">z = \frac{1}{2}</math> in the reflection formula, by using the relation to the [[beta function]] given below with | which can be found by setting <math display="inline">z = \frac{1}{2}</math> in the reflection formula, by using the relation to the [[beta function]] given below with {{tmath|1=z_1 = z_2 = \frac{1}{{mset|2}}}}, or simply by making the substitution <math>t = u^2</math> in the integral definition of the gamma function, resulting in a [[Gaussian integral]]. In general, for non-negative integer values of <math>n</math> we have: | ||
<math display="block">\begin{align} | <math display="block">\begin{align} | ||
\Gamma\left(\tfrac 1 2 + n\right) &= {(2n)! \over 4^n n!} \sqrt{\pi} = \frac{(2n-1)!!}{2^n} \sqrt{\pi} = \binom{n-\frac{1}{2}}{n} n! \sqrt{\pi} \\[8pt] | \Gamma\left(\tfrac 1 2 + n\right) &= {(2n)! \over 4^n n!} \sqrt{\pi} = \frac{(2n-1)!!}{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}{(2n-1)!!} \sqrt{\pi} = \frac{\sqrt{\pi}}{\binom{-1/2}{n} n!} | \Gamma\left(\tfrac 1 2 - n\right) &= {(-4)^n n! \over (2n)!} \sqrt{\pi} = \frac{(-2)^n}{(2n-1)!!} \sqrt{\pi} = \frac{\sqrt{\pi}}{\binom{-1/2}{n} n!} | ||
\end{align}</math> | \end{align}</math> | ||
where the [[double factorial]] | where the [[double factorial]] {{tmath|1=(2n-1)!! = (2n-1)(2n-3)\cdots(3)(1)}}. See [[Particular values of the gamma function]] for calculated values. | ||
It might be tempting to generalize the result that <math display="inline">\Gamma \left( \frac{1}{2} \right) = \sqrt\pi</math> by looking for a formula for other individual values <math>\Gamma(r)</math> where <math>r</math> is rational, especially because according to [[Digamma function#Gauss's digamma theorem|Gauss's digamma theorem]], it is possible to do so for the closely related [[digamma function]] at every rational value. However, these numbers <math>\Gamma(r)</math> are not known to be expressible by themselves in terms of elementary functions. It has been proved that <math>\Gamma (n + r)</math> is a [[transcendental number]] and [[algebraic independence|algebraically independent]] of <math>\pi</math> for any integer <math>n</math> and each of the fractions <math display="inline">r = \frac{1}{6}, \frac{1}{4}, \frac{1}{3}, \frac{2}{3}, \frac{3}{4}, \frac{5}{6}</math>.<ref>{{cite journal|last=Waldschmidt |first=M. |date=2006 |url=http://www.math.jussieu.fr/~miw/articles/pdf/TranscendencePeriods.pdf |archive-url=https://web.archive.org/web/20060506050646/http://www.math.jussieu.fr/~miw/articles/pdf/TranscendencePeriods.pdf |archive-date=2006-05-06 |url-status=live |title=Transcendence of Periods: The State of the Art |journal=Pure Appl. Math. Quart. |volume=2 |issue=2 |pages=435–463 |doi=10.4310/pamq.2006.v2.n2.a3|doi-access=free}}</ref> In general, when computing values of the gamma function, we must settle for numerical approximations. | It might be tempting to generalize the result that <math display="inline">\Gamma \left( \frac{1}{2} \right) = \sqrt\pi</math> by looking for a formula for other individual values <math>\Gamma(r)</math> where <math>r</math> is rational, especially because according to [[Digamma function#Gauss's digamma theorem|Gauss's digamma theorem]], it is possible to do so for the closely related [[digamma function]] at every rational value. However, these numbers <math>\Gamma(r)</math> are not known to be expressible by themselves in terms of elementary functions. It has been proved that <math>\Gamma (n + r)</math> is a [[transcendental number]] and [[algebraic independence|algebraically independent]] of <math>\pi</math> for any integer <math>n</math> and each of the fractions <math display="inline">r = \frac{1}{6}, \frac{1}{4}, \frac{1}{3}, \frac{2}{3}, \frac{3}{4}, \frac{5}{6}</math>.<ref>{{cite journal|last=Waldschmidt |first=M. |date=2006 |url=http://www.math.jussieu.fr/~miw/articles/pdf/TranscendencePeriods.pdf |archive-url=https://web.archive.org/web/20060506050646/http://www.math.jussieu.fr/~miw/articles/pdf/TranscendencePeriods.pdf |archive-date=2006-05-06 |url-status=live |title=Transcendence of Periods: The State of the Art |journal=Pure Appl. Math. Quart. |volume=2 |issue=2 |pages=435–463 |doi=10.4310/pamq.2006.v2.n2.a3|doi-access=free}}</ref> In general, when computing values of the gamma function, we must settle for numerical approximations. | ||
| Line 249: | Line 248: | ||
<math display="block">\Gamma'(z)=\Gamma(z)\psi^{(0)}(z).</math> | <math display="block">\Gamma'(z)=\Gamma(z)\psi^{(0)}(z).</math> | ||
For a positive integer {{mvar|m}} the derivative of the gamma function can be calculated as follows: | For a positive integer {{mvar|m}} the derivative of the gamma function can be calculated as follows: | ||
[[File:Plot of gamma function in the complex plane from -2-i to 6+2i with colors created in Mathematica.svg|alt=Gamma function in the complex plane with colors showing its argument|thumb|Colors showing the argument of the gamma function in the complex plane from {{math|−2 − 2''i''}} to {{math|6 + 2''i''}}]] | [[File:Plot of gamma function in the complex plane from -2-i to 6+2i with colors created in Mathematica.svg|upright=1.65|alt=Gamma function in the complex plane with colors showing its argument|thumb|Colors showing the argument of the gamma function in the complex plane from {{math|−2 − 2''i''}} to {{math|6 + 2''i''}}]] | ||
<math display="block">\Gamma'(m+1) = m! \left( - \gamma + \sum_{k=1}^m\frac{1}{k} \right)= m! \left( - \gamma + H(m) \right)\,,</math> | <math display="block">\Gamma'(m+1) = m! \left( - \gamma + \sum_{k=1}^m\frac{1}{k} \right)= m! \left( - \gamma + H(m) \right)\,,</math> | ||
where H(m) is the mth [[harmonic number]] and {{ | where H(m) is the mth [[harmonic number]] and {{mvar|γ}} is the [[Euler–Mascheroni constant]]. | ||
For <math>\Re(z) > 0</math> the <math>n</math>th derivative of the gamma function is: | For <math>\Re(z) > 0</math> the <math>n</math>th derivative of the gamma function is: | ||
<math display="block">\frac{d^n}{dz^n}\Gamma(z) = \int_0^\infty t^{z-1} e^{-t} (\log t)^n \, dt.</math> | <math display="block">\frac{d^n}{dz^n}\Gamma(z) = \int_0^\infty t^{z-1} e^{-t} (\log t)^n \, dt.</math> | ||
(This can be derived by differentiating the integral form of the gamma function with respect to | (This can be derived by differentiating the integral form of the gamma function with respect to {{tmath|z}}, and using the technique of [[differentiation under the integral sign]].) | ||
Using the identity | Using the identity | ||
| Line 266: | Line 266: | ||
* For any two positive real numbers <math>x_1</math> and <math>x_2</math>, and for any <math>t \in [0, 1]</math>, <math display="block">\Gamma(tx_1 + (1 - t)x_2) \le \Gamma(x_1)^t\Gamma(x_2)^{1 - t}.</math> | * For any two positive real numbers <math>x_1</math> and <math>x_2</math>, and for any <math>t \in [0, 1]</math>, <math display="block">\Gamma(tx_1 + (1 - t)x_2) \le \Gamma(x_1)^t\Gamma(x_2)^{1 - t}.</math> | ||
* For any two positive real numbers <math>x_1</math> and <math>x_2</math>, and <math>x_2</math> > <math>x_1</math><math display="block"> \left(\frac{\Gamma(x_2)}{\Gamma(x_1)}\right)^{\frac{1}{x_2 - x_1}} > \exp\left(\frac{\Gamma'(x_1)}{\Gamma(x_1)}\right).</math> | * For any two positive real numbers <math>x_1</math> and <math>x_2</math>, and <math>x_2</math> > <math>x_1</math><math display="block"> \left(\frac{\Gamma(x_2)}{\Gamma(x_1)}\right)^{\frac{1}{x_2 - x_1}} > \exp\left(\frac{\Gamma'(x_1)}{\Gamma(x_1)}\right).</math> | ||
* For any positive real number | * For any positive real number {{tmath|x}}, <math display="block"> \Gamma''(x) \Gamma(x) > \Gamma'(x)^2.</math> | ||
The last of these statements is, essentially by definition, the same as the statement that <math>\psi^{(1)}(x) > 0</math>, where <math>\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>\psi^{(1)}</math> has a series representation which, for positive real {{mvar|x}}, consists of only positive terms. | The last of these statements is, essentially by definition, the same as the statement that <math>\psi^{(1)}(x) > 0</math>, where <math>\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>\psi^{(1)}</math> has a series representation which, for positive real {{mvar|x}}, consists of only positive terms. | ||
| Line 278: | Line 278: | ||
{{Main|Stirling's approximation}} | {{Main|Stirling's approximation}} | ||
[[File:Gamma cplot.svg|thumb|Representation of the gamma function in the complex plane. Each point <math>z</math> is colored according to the argument of {{nowrap|<math>\Gamma(z)</math>.}} The contour plot of the modulus <math>|\Gamma(z)|</math> is also displayed.]] | [[File:Gamma cplot.svg|thumb|upright=1.65|Representation of the gamma function in the complex plane. Each point <math>z</math> is colored according to the argument of {{nowrap|<math>\Gamma(z)</math>.}} The contour plot of the modulus <math>|\Gamma(z)|</math> is also displayed.]] | ||
[[File:Gamma abs 3D.png|thumb|3-dimensional plot of the absolute value of the complex gamma function]] | [[File:Gamma abs 3D.png|thumb|upright=1.65|3-dimensional plot of the absolute value of the complex gamma function]] | ||
The behavior of <math>\Gamma(x)</math> for an increasing positive real variable is given by [[Stirling's formula]] | The behavior of <math>\Gamma(x)</math> for an increasing positive real variable is given by [[Stirling's formula]] | ||
<math display="block">\Gamma(x+1)\sim\sqrt{2\pi x}\left(\frac{x}{e}\right)^x,</math> | <math display="block">\Gamma(x+1)\sim\sqrt{2\pi x}\left(\frac{x}{e}\right)^x,</math> | ||
| Line 292: | Line 292: | ||
=== Extension to negative, non-integer values === | === Extension to negative, non-integer values === | ||
Although the main definition of the gamma function—the Euler integral of the second kind—is only valid (on the real axis) for positive arguments, its domain can be extended with [[analytic continuation]]<ref>{{cite book |last1=Oldham |first1=Keith |last2=Myland |first2=Jan |last3=Spanier |first3=Jerome |title=An Atlas of Functions |date=2010 |publisher=Springer Science & Business Media |location= | Although the main definition of the gamma function—the Euler integral of the second kind—is only valid (on the real axis) for positive arguments, its domain can be extended with [[analytic continuation]]<ref>{{cite book |last1=Oldham |first1=Keith |last2=Myland |first2=Jan |last3=Spanier |first3=Jerome |title=An Atlas of Functions | chapter=Chapter 43 - The Gamma Function <math>\Gamma(\nu)</math> |date=2010 |publisher=Springer Science & Business Media |location=New York, NY |isbn=9780387488073 |edition=2}}</ref> to negative arguments by shifting the negative argument to positive values by using either the Euler's reflection formula, | ||
<math display="block"> | <math display="block"> | ||
\Gamma(-x) = \frac{1}{\Gamma(x+1)}\frac{\pi}{\sin\big(\pi(x+1)\big)}, | \Gamma(-x) = \frac{1}{\Gamma(x+1)}\frac{\pi}{\sin\big(\pi(x+1)\big)}, | ||
| Line 298: | Line 298: | ||
or the fundamental property, | or the fundamental property, | ||
<math display="block"> | <math display="block"> | ||
\Gamma(-x):=\ | \Gamma(-x):=\frac{\, 1}{-x}\,\Gamma(-x+1) , | ||
</math> | </math> | ||
when <math>x\not\in\mathbb{Z}</math>. | when <math>x\not\in\mathbb{Z}</math>. | ||
For example, | For example, | ||
<math display="block"> | <math display="block"> | ||
\Gamma\left(-\frac12\right)=-2\Gamma\left(\frac12\right) . | \Gamma\!\left(\!-\frac12\right)=-2\,\Gamma\!\left(\frac12\right) . | ||
</math> | </math> | ||
| Line 311: | Line 311: | ||
choosing <math>n</math> such that <math>z + n</math> is positive. The product in the denominator is zero when <math>z</math> equals any of the integers <math>0, -1, -2, \ldots</math>. Thus, the gamma function must be undefined at those points to avoid [[division by zero]]; it is a [[meromorphic function]] with [[simple pole]]s at the non-positive integers.<ref name="Davis" /> | choosing <math>n</math> such that <math>z + n</math> is positive. The product in the denominator is zero when <math>z</math> equals any of the integers <math>0, -1, -2, \ldots</math>. Thus, the gamma function must be undefined at those points to avoid [[division by zero]]; it is a [[meromorphic function]] with [[simple pole]]s at the non-positive integers.<ref name="Davis" /> | ||
For a function <math>f</math> of a complex variable | For a function <math>f</math> of a complex variable {{tmath|z}}, at a [[simple pole]] {{tmath|c}}, the [[Residue (complex analysis)|residue]] of <math>f</math> is given by: | ||
<math display="block">\operatorname{Res}(f,c)=\lim_{z\to c}(z-c)f(z).</math> | <math display="block">\operatorname{Res}(f,c)=\lim_{z\to c}(z-c)f(z).</math> | ||
For the simple pole <math>z = -n</math>, the recurrence formula can be rewritten as: | For the simple pole <math>z = -n</math>, the recurrence formula can be rewritten as: | ||
<math display="block">(z+n) \Gamma(z)=\frac{\Gamma(z+n+1)}{z(z+1)\cdots(z+n-1)}.</math> | <math display="block">(z+n) \Gamma(z)=\frac{\Gamma(z+n+1)}{z(z+1)\cdots(z+n-1)}.</math> | ||
The numerator at | The numerator at {{tmath|1=z = -n}}, is | ||
<math display="block">\Gamma(z+n+1) = \Gamma(1) = 1</math> | <math display="block">\Gamma(z+n+1) = \Gamma(1) = 1</math> | ||
and the denominator | and the denominator | ||
<math display="block">z(z+1)\cdots(z+n-1) = -n(1-n)\cdots(n-1-n) = (-1)^n n!.</math> | <math display="block">z(z+1)\cdots(z+n-1) = -n(1-n)\cdots(n-1-n) = (-1)^n n!.</math> | ||
So the residues of the gamma function at those points are:<ref name="Mathworld">{{MathWorld|urlname=GammaFunction |title=Gamma Function}}</ref> | So the residues of the gamma function at those points are:<ref name="Mathworld">{{MathWorld|urlname=GammaFunction |title=Gamma Function}}</ref> | ||
| Line 352: | Line 352: | ||
<math display="block">\operatorname{log\Gamma}(z) = \left(z - \frac{1}{2}\right)\log z - z + \frac{1}{2}\log(2\pi) + 2\int_0^\infty \frac{\arctan(t/z)}{e^{2\pi t} - 1}\,dt.</math> | <math display="block">\operatorname{log\Gamma}(z) = \left(z - \frac{1}{2}\right)\log z - z + \frac{1}{2}\log(2\pi) + 2\int_0^\infty \frac{\arctan(t/z)}{e^{2\pi t} - 1}\,dt.</math> | ||
Let {{ | Let {{mvar|C}} be a [[Hankel contour]], meaning a path that begins and ends at the point {{math|∞}} on the [[Riemann sphere]], whose unit tangent vector converges to {{math|−1}} at the start of the path and to {{math|1}} at the end, which has [[winding number]] 1 around {{math|0}}, and which does not cross {{closed-open|0, ∞}}. Fix a branch of <math>\log(-t)</math> by taking a branch cut along {{closed-open|0, ∞}} and by taking <math>\log(-t)</math> to be real when {{math|t}} is on the negative real axis. Assume {{mvar|z}} is not an integer. Then Hankel's formula for the gamma function is:<ref>Whittaker and Watson, 12.22.</ref> | ||
<math display="block">\Gamma(z) = -\frac{1}{2i\sin \pi z}\int_C (-t)^{z-1}e^{-t}\,dt,</math> | <math display="block">\Gamma(z) = -\frac{1}{2i\sin \pi z}\int_C (-t)^{z-1}e^{-t}\,dt,</math> | ||
where <math>(-t)^{z-1}</math> is interpreted as <math>\exp((z-1)\log(-t))</math>. The reflection formula leads to the closely related expression | where <math>(-t)^{z-1}</math> is interpreted as <math>\exp((z-1)\log(-t))</math>. The reflection formula leads to the closely related expression | ||
<math display="block">\frac{1}{\Gamma(z)} = \frac{i}{2\pi}\int_C (-t)^{-z}e^{-t}\,dt,</math> | <math display="block">\frac{1}{\Gamma(z)} = \frac{i}{2\pi}\int_C (-t)^{-z}e^{-t}\,dt,</math> | ||
again valid whenever {{ | again valid whenever {{mvar|z}} is not an integer. | ||
=== Continued fraction representation === | === Continued fraction representation === | ||
| Line 408: | Line 408: | ||
An alternative notation introduced by [[Carl Friedrich Gauss|Gauss]] is the <math>\Pi</math>-function, a shifted version of the gamma function: | An alternative notation introduced by [[Carl Friedrich Gauss|Gauss]] is the <math>\Pi</math>-function, a shifted version of the gamma function: | ||
<math display="block">\Pi(z) = \Gamma(z+1) = z \Gamma(z) = \int_0^\infty e^{-t} t^z\, dt,</math> | <math display="block">\Pi(z) = \Gamma(z+1) = z \Gamma(z) = \int_0^\infty e^{-t} t^z\, dt,</math> | ||
so that <math>\Pi(n) = n!</math> for every non-negative integer | so that <math>\Pi(n) = n!</math> for every non-negative integer {{tmath|n}}. | ||
Using the pi function, the reflection formula is: | Using the pi function, the reflection formula is: | ||
| Line 415: | Line 415: | ||
<math display="block">\Pi\left(\frac{z}{m}\right) \, \Pi\left(\frac{z-1}{m}\right) \cdots \Pi\left(\frac{z-m+1}{m}\right) = (2 \pi)^{\frac{m-1}{2}} m^{-z-\frac12} \Pi(z)\ .</math> | <math display="block">\Pi\left(\frac{z}{m}\right) \, \Pi\left(\frac{z-1}{m}\right) \cdots \Pi\left(\frac{z-m+1}{m}\right) = (2 \pi)^{\frac{m-1}{2}} m^{-z-\frac12} \Pi(z)\ .</math> | ||
The shifted [[reciprocal gamma function]] is sometimes denoted | The shifted [[reciprocal gamma function]] is sometimes denoted {{tmath|1=\pi(z) = \frac{1}{{mset|\Pi(z)}}}}, an [[entire function]]. | ||
an [[entire function]]. | |||
The [[volume of an n-ball|volume of an {{ | The [[volume of an n-ball|volume of an {{mvar|n}}-ellipsoid]] with radii {{math|''r''{{sub|1}}, ..., ''r''{{sub|''n''}}}} can be expressed as | ||
<math display="block">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> | <math display="block">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> | ||
| Line 427: | Line 426: | ||
* The analog of the gamma function over a [[finite field]] or a [[finite ring]] is the [[Gaussian sum]]s, a type of [[exponential sum]]. | * The analog of the gamma function over a [[finite field]] or a [[finite ring]] is the [[Gaussian sum]]s, a type of [[exponential sum]]. | ||
* The [[reciprocal gamma function]] is an [[entire function]] and has been studied as a specific topic. | * 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>\zeta (z)</math>. <math display="block">\pi^{-\frac{z}{2}} \; \Gamma\left(\frac{z}{2}\right) \zeta(z) = \pi^{-\frac{1-z}{2}} \; \Gamma\left(\frac{1-z}{2}\right) \; \zeta(1-z).</math> It also appears in the following formula: <math display="block">\zeta(z) \Gamma(z) = \int_0^\infty \frac{u^{z}}{e^u - 1} \, \frac{du}{u},</math> which is valid only for <math>\Re (z) > 1</math>.{{pb}} The logarithm of the gamma function satisfies the following formula due to Lerch: <math display="block">\operatorname{log\Gamma}(z) = \zeta_H'(0,z) - \zeta'(0),</math> where <math>\zeta_H</math> is the [[Hurwitz zeta function]], <math>\zeta</math> is the Riemann zeta function and the prime ({{math| | * The gamma function also shows up in an important relation with the [[Riemann zeta function]], <math>\zeta (z)</math>. <math display="block">\pi^{-\frac{z}{2}} \; \Gamma\left(\frac{z}{2}\right) \zeta(z) = \pi^{-\frac{1-z}{2}} \; \Gamma\left(\frac{1-z}{2}\right) \; \zeta(1-z).</math> It also appears in the following formula: <math display="block">\zeta(z) \Gamma(z) = \int_0^\infty \frac{u^{z}}{e^u - 1} \, \frac{du}{u},</math> which is valid only for <math>\Re (z) > 1</math>.{{pb}} The logarithm of the gamma function satisfies the following formula due to Lerch: <math display="block">\operatorname{log\Gamma}(z) = \zeta_H'(0,z) - \zeta'(0),</math> where <math>\zeta_H</math> is the [[Hurwitz zeta function]], <math>\zeta</math> is the Riemann zeta function and the prime ({{math|{{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 display="block">\langle\tau^n\rangle \equiv \int_0^\infty t^{n-1}\, e^{ - \left( \frac{t}{\tau} \right)^\beta} \, \mathrm{d}t = \frac{\tau^n}{\beta}\Gamma \left({n \over \beta }\right).</math> | * The gamma function is related to the [[stretched exponential function]]. For instance, the moments of that function are <math display="block">\langle\tau^n\rangle \equiv \int_0^\infty t^{n-1}\, e^{ - \left( \frac{t}{\tau} \right)^\beta} \, \mathrm{d}t = \frac{\tau^n}{\beta}\Gamma \left({n \over \beta }\right).</math> | ||
| Line 451: | Line 450: | ||
== Log-gamma function == | == Log-gamma function == | ||
[[File:LogGamma Analytic Function.png|thumb|The analytic function {{math|logΓ(''z'')}}]] | [[File:LogGamma Analytic Function.png|thumb|upright=1.65|The analytic function {{math|logΓ(''z'')}}]] | ||
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 <code>lgamma</code> or <code>lngamma</code> in programming environments or <code>gammaln</code> in spreadsheets. This grows much more slowly, and for combinatorial calculations allows adding and subtracting logarithmic values instead of multiplying and dividing very large values. It is often defined as<ref>{{cite web |title=Log Gamma Function |url=http://mathworld.wolfram.com/LogGammaFunction.html |website=Wolfram MathWorld |access-date=3 January 2019}}</ref> | 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 <code>lgamma</code> or <code>lngamma</code> in programming environments or <code>gammaln</code> in spreadsheets. This grows much more slowly, and for combinatorial calculations allows adding and subtracting logarithmic values instead of multiplying and dividing very large values. It is often defined as<ref>{{cite web |title=Log Gamma Function |url=http://mathworld.wolfram.com/LogGammaFunction.html |website=Wolfram MathWorld |access-date=3 January 2019}}</ref> | ||
| Line 459: | Line 458: | ||
In the context of technical and physical applications, e.g. with wave propagation, the functional equation | In the context of technical and physical applications, e.g. with wave propagation, the functional equation | ||
<math display="block"> \operatorname{log\Gamma}(z) = \operatorname{log\Gamma}(z+1) - \log z</math> | <math display="block"> \operatorname{log\Gamma}(z) = \operatorname{log\Gamma}(z+1) - \log z</math> | ||
[[File:Plot of logarithmic gamma function in the complex plane from -2-2i to 2+2i with colors created with Mathematica 13.1 function ComplexPlot3D.svg|alt=Logarithmic gamma function in the complex plane from −2 − 2i to 2 + 2i with colors|thumb|Logarithmic gamma function in the complex plane from −2 − 2i to 2 + 2i with colors]] | [[File:Plot of logarithmic gamma function in the complex plane from -2-2i to 2+2i with colors created with Mathematica 13.1 function ComplexPlot3D.svg|alt=Logarithmic gamma function in the complex plane from {{math|−2 − 2i}} to {{math|2 + 2i}} with colors|thumb|upright=1.65|Logarithmic gamma function in the complex plane<br>from {{math|−2 − 2i}} to {{math|2 + 2i}} with colors]] | ||
is often used since it allows one to determine function values in one strip of width 1 in {{mvar|z}} from the neighbouring strip. In particular, starting with a good approximation for a {{mvar|z}} with large real part one may go step by step down to the desired {{mvar|z}}. Following an indication of [[Carl Friedrich Gauss]], Rocktaeschel (1922) proposed for {{math|logΓ(''z'')}} an approximation for large {{math|Re(''z'')}}: | is often used since it allows one to determine function values in one strip of width 1 in {{mvar|z}} from the neighbouring strip. In particular, starting with a good approximation for a {{mvar|z}} with large real part one may go step by step down to the desired {{mvar|z}}. Following an indication of [[Carl Friedrich Gauss]], Rocktaeschel (1922) proposed for {{math|logΓ(''z'')}} an approximation for large {{math|Re(''z'')}}: | ||
<math display="block"> \operatorname{log\Gamma}(z) \approx (z - \tfrac{1}{2}) \log z - z + \tfrac{1}{2}\log(2\pi).</math> | <math display="block"> \operatorname{log\Gamma}(z) \approx (z - \tfrac{1}{2}) \log z - z + \tfrac{1}{2}\log(2\pi).</math> | ||
| Line 487: | Line 486: | ||
# <math>\Gamma(1) = 1</math>, | # <math>\Gamma(1) = 1</math>, | ||
# <math>\Gamma(z+1) = z \Gamma(z)</math> for all complex numbers <math>z</math> except the non-positive integers, and, | # <math>\Gamma(z+1) = z \Gamma(z)</math> for all complex numbers <math>z</math> except the non-positive integers, and, | ||
# for integer {{mvar|n}}, <math display="inline">\lim_{n \to \infty} \frac{\Gamma(n+z)}{\Gamma(n)\;n^z} = 1</math> for all complex numbers | # for integer {{mvar|n}}, <math display="inline">\lim_{n \to \infty} \frac{\Gamma(n+z)}{\Gamma(n)\;n^z} = 1</math> for all complex numbers {{tmath|z}}.<ref name="Davis" /> | ||
In a certain sense, the log-gamma function is the more natural form; it makes some intrinsic attributes of the function clearer. A striking example is the [[Taylor series]] of {{math|logΓ}} around 1: | In a certain sense, the log-gamma function is the more natural form; it makes some intrinsic attributes of the function clearer. A striking example is the [[Taylor series]] of {{math|logΓ}} around 1: | ||
| Line 497: | Line 496: | ||
an integral representation for the log-gamma function is: | an integral representation for the log-gamma function is: | ||
<math display="block">\operatorname{log\Gamma}(z+1)= -\gamma z + \int_0^\infty \frac{e^{-zt} - 1 + z t}{t \left(e^t - 1\right)} \, dt </math> | <math display="block">\operatorname{log\Gamma}(z+1)= -\gamma z + \int_0^\infty \frac{e^{-zt} - 1 + z t}{t \left(e^t - 1\right)} \, dt </math> | ||
or, setting {{math|1=''z'' = 1}} to obtain an integral for {{ | or, setting {{math|1=''z'' = 1}} to obtain an integral for {{mvar|γ}}, we can replace the {{mvar|γ}} term with its integral and incorporate that into the above formula, to get: | ||
<math display="block">\operatorname{log\Gamma}(z+1)= \int_0^\infty \frac{e^{-zt} - ze^{-t} - 1 + z}{t \left(e^t -1\right)} \, dt\,. </math> | <math display="block">\operatorname{log\Gamma}(z+1)= \int_0^\infty \frac{e^{-zt} - ze^{-t} - 1 + z}{t \left(e^t -1\right)} \, dt\,. </math> | ||
There also exist special formulas for the logarithm of the gamma function for rational {{mvar|z}}. | There also exist special formulas for the logarithm of the gamma function for rational {{mvar|z}}. | ||
For instance, if <math>k</math> and <math>n</math> are integers with <math>k<n</math> and | For instance, if <math>k</math> and <math>n</math> are integers with <math>k<n</math> and {{tmath|k\neq n/2}}, then<ref name="iaroslav_07">{{cite journal |last=Blagouchine |first=Iaroslav V. |year=2015 |title=A theorem for the closed-form evaluation of the first generalized Stieltjes constant at rational arguments and some related summations |journal=Journal of Number Theory |volume=148 |pages=537–592 |arxiv=1401.3724 |doi=10.1016/j.jnt.2014.08.009}}</ref> | ||
<math display="block"> | <math display="block"> | ||
\begin{align} | \begin{align} | ||
| Line 513: | Line 512: | ||
The integral | The integral | ||
<math display="block"> \int_0^z \operatorname{log\Gamma} (x) \, dx</math> | <math display="block"> \int_0^z \operatorname{log\Gamma} (x) \, dx</math> | ||
can be expressed in terms of the [[Barnes G-function|Barnes {{ | can be expressed in terms of the [[Barnes G-function|Barnes {{mvar|G}}-function]]<ref name="Alexejewsky">{{cite journal|first=W. P. |last=Alexejewsky |title=Über eine Classe von Funktionen, die der Gammafunktion analog sind |trans-title=On a class of functions analogous to the gamma function |journal=Leipzig Weidmannsche Buchhandlung |volume=46 |date=1894 |pages=268–275}}</ref><ref name="Barnes">{{cite journal|first=E. W. |last=Barnes |title=The theory of the ''G''-function |journal=Quart. J. Math. |volume=31 |date=1899 |pages=264–314}}</ref> (see [[Barnes G-function|Barnes {{mvar|G}}-function]] for a proof): | ||
<math display="block">\int_0^z \operatorname{log\Gamma}(x) \, dx = \frac{z}{2} \log (2 \pi) + \frac{z(1-z)}{2} + z \operatorname{log\Gamma}(z) - \log G(z+1)</math> | <math display="block">\int_0^z \operatorname{log\Gamma}(x) \, dx = \frac{z}{2} \log (2 \pi) + \frac{z(1-z)}{2} + z \operatorname{log\Gamma}(z) - \log G(z+1)</math> | ||
where {{math|Re(''z'') > −1}}. | where {{math|Re(''z'') > −1}}. | ||
| Line 536: | Line 535: | ||
== Approximations == | == Approximations == | ||
[[File:Mplwp factorial gamma stirling.svg|thumb|right|upright=1. | [[File:Mplwp factorial gamma stirling.svg|thumb|right|upright=1.65|Comparison of the gamma function (blue line) with the factorial (blue dots) and Stirling's approximation (red line)]] | ||
Complex values of the gamma function can be approximated using [[Stirling's approximation]] or the [[Lanczos approximation]], | Complex values of the gamma function can be approximated using [[Stirling's approximation]] or the [[Lanczos approximation]], | ||
<math display="block">\Gamma(z) \sim \sqrt{2\pi}z^{z-1/2}e^{-z}\quad\hbox{as }z\to\infty\hbox{ in } \left|\arg(z)\right|<\pi.</math> | <math display="block">\Gamma(z) \sim \sqrt{2\pi}z^{z-1/2}e^{-z}\quad\hbox{as }z\to\infty\hbox{ in } \left|\arg(z)\right|<\pi.</math> | ||
This is precise in the sense that the ratio of the approximation to the true value approaches 1 in the limit as {{math|{{abs|''z''}}}} goes to infinity. | This is precise in the sense that the ratio of the approximation to the true value approaches 1 in the limit as {{math|{{abs|''z''}}}} goes to infinity. | ||
| Line 547: | Line 546: | ||
\end{align}</math> | \end{align}</math> | ||
When {{math|Re(''z'') ∈ [1,2]}} and <math>x \geq 1</math>, the absolute value of the last integral is smaller than <math>(x + 1)e^{-x}</math>. By choosing a large enough | When {{math|Re(''z'') ∈ [1,2]}} and <math>x \geq 1</math>, the absolute value of the last integral is smaller than <math>(x + 1)e^{-x}</math>. By choosing a large enough {{tmath|x}}, this last expression can be made smaller than <math>2^{-N}</math> for any desired value {{tmath|N}}. Thus, the gamma function can be evaluated to <math>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.<ref>E.A. Karatsuba, Fast evaluation of transcendental functions. Probl. Inf. Transm. Vol.27, No.4, pp. 339–360 (1991).</ref><ref>E.A. Karatsuba, On a new method for fast evaluation of transcendental functions. Russ. Math. Surv. Vol.46, No.2, pp. 246–247 (1991).</ref><ref>E.A. Karatsuba "[http://www.ccas.ru/personal/karatsuba/algen.htm Fast Algorithms and the FEE Method]".</ref> | A fast algorithm for calculation of the Euler gamma function for any algebraic argument (including rational) was constructed by E.A. Karatsuba.<ref>E.A. Karatsuba, Fast evaluation of transcendental functions. Probl. Inf. Transm. Vol.27, No. 4, pp. 339–360 (1991).</ref><ref>E.A. Karatsuba, On a new method for fast evaluation of transcendental functions. Russ. Math. Surv. Vol.46, No. 2, pp. 246–247 (1991).</ref><ref>E.A. Karatsuba "[http://www.ccas.ru/personal/karatsuba/algen.htm Fast Algorithms and the FEE Method]".</ref> | ||
For arguments that are integer multiples of {{math|{{sfrac|1|24}}}}, the gamma function can also be evaluated quickly using [[arithmetic–geometric mean]] iterations (see [[particular values of the gamma function]]).<ref>{{cite journal |last1=Borwein |first1=J. M. |last2=Zucker |first2=I. J. |title=Fast evaluation of the gamma function for small rational fractions using complete elliptic integrals of the first kind |journal=IMA Journal of Numerical Analysis |date=1992 |volume=12 |issue=4 |pages=519–526 |doi=10.1093/IMANUM/12.4.519}}</ref> | For arguments that are integer multiples of {{math|{{sfrac|1|24}}}}, the gamma function can also be evaluated quickly using [[arithmetic–geometric mean]] iterations (see [[particular values of the gamma function]]).<ref>{{cite journal |last1=Borwein |first1=J. M. |last2=Zucker |first2=I. J. |title=Fast evaluation of the gamma function for small rational fractions using complete elliptic integrals of the first kind |journal=IMA Journal of Numerical Analysis |date=1992 |volume=12 |issue=4 |pages=519–526 |doi=10.1093/IMANUM/12.4.519}}</ref> | ||
| Line 559: | Line 558: | ||
== Applications == | == Applications == | ||
One author describes the gamma function as "Arguably, the most common special function, or the least 'special' of them. The other transcendental functions [ | 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 {{math|1= Γ(''z'')}} is most difficult to avoid."<ref>Michon, G. P. "[http://home.att.net/~numericana/answer/functions.htm Trigonometry and Basic Functions] {{Webarchive|url=https://web.archive.org/web/20100109035934/http://home.att.net/~numericana/answer/functions.htm |date=9 January 2010 }}". ''Numericana''. Retrieved 5 May 2007.</ref> | ||
=== Integration problems === | === Integration problems === | ||
<!-- [[Gamma integral]] redirects here --> | <!-- [[Gamma integral]] redirects here --> | ||
The gamma function finds application in such diverse areas as [[quantum physics]], [[astrophysics]] and [[fluid dynamics]].<ref>{{cite book | | The gamma function finds application in such diverse areas as [[quantum physics]], [[astrophysics]] and [[fluid dynamics]].<ref>{{cite book |last1=Chaudry |first1=M. A. |last2=Zubair |first2=S. M. |year=2001 |title=On A Class of Incomplete Gamma Functions with Applications |publisher=CRC Press |location=Boca Raton |isbn=1-58488-143-7 |page=37 }}</ref> 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.<ref>{{cite book |last=Rice |first=J. A. |year=1995 |title=Mathematical Statistics and Data Analysis |edition=Second |publisher=Duxbury Press |location=Belmont |isbn=0-534-20934-3 |pages=52–53 }}</ref> | ||
The primary reason for the gamma function's usefulness in such contexts is the prevalence of expressions of the type <math>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 {{ | The primary reason for the gamma function's usefulness in such contexts is the prevalence of expressions of the type <math>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 {{mvar|f}} is a power function and {{mvar|g}} is a linear function, a simple change of variables <math>u:=a\cdot t</math> gives the evaluation | ||
<math display="block">\int_0^\infty t^b e^{-at} \,dt = \frac{1}{a^b} \int_0^\infty u^b e^{-u} d\left(\frac{u}{a}\right) = \frac{\Gamma(b+1)}{a^{b+1}}.</math> | <math display="block">\int_0^\infty t^b e^{-at} \,dt = \frac{1}{a^b} \int_0^\infty u^b e^{-u} d\left(\frac{u}{a}\right) = \frac{\Gamma(b+1)}{a^{b+1}}.</math> | ||
| Line 577: | Line 576: | ||
and integrals thereof, such as the [[error function]]. There are many interrelations between these functions and the gamma function; notably, the factor <math>\sqrt{\pi}</math> obtained by evaluating <math display="inline">\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]]. | and integrals thereof, such as the [[error function]]. There are many interrelations between these functions and the gamma function; notably, the factor <math>\sqrt{\pi}</math> obtained by evaluating <math display="inline">\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 discussed so far involve [[transcendental function]]s, but the gamma function also arises from integrals of purely algebraic functions. In particular, the [[arc length]]s of [[ellipse]]s and of the [[Lemniscate of Bernoulli#Arc length and elliptic functions|lemniscate]], which are curves defined by algebraic equations, are given by [[elliptic integral]]s that in special cases can be evaluated in terms of the gamma function. The gamma function can also be used to [[Volume of an n-ball|calculate "volume" and "area"]] of {{ | The integrals discussed so far involve [[transcendental function]]s, but the gamma function also arises from integrals of purely algebraic functions. In particular, the [[arc length]]s of [[ellipse]]s and of the [[Lemniscate of Bernoulli#Arc length and elliptic functions|lemniscate]], which are curves defined by algebraic equations, are given by [[elliptic integral]]s that in special cases can be evaluated in terms of the gamma function. The gamma function can also be used to [[Volume of an n-ball|calculate "volume" and "area"]] of {{mvar|n}}-dimensional [[hypersphere]]s. | ||
=== Calculating products === | === Calculating products === | ||
| Line 587: | Line 586: | ||
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 {{mvar|k}} elements from a set of {{mvar|n}} elements; if {{math|''k'' > ''n''}}, there are of course no ways. If {{math|''k'' > ''n''}}, {{math|(''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. | 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 {{mvar|k}} elements from a set of {{mvar|n}} elements; if {{math|''k'' > ''n''}}, there are of course no ways. If {{math|''k'' > ''n''}}, {{math|(''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 {{ | 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 {{mvar|P}} and {{mvar|Q}} are monic polynomials of degree {{mvar|m}} and {{mvar|n}} with respective roots {{math|''p''{{sub|1}}, ..., ''p{{sub|m}}''}} and {{math|''q''{{sub|1}}, ..., ''q{{sub|n}}''}}, we have | ||
<math display="block">\prod_{i=a}^b \frac{P(i)}{Q(i)} = \left( \prod_{j=1}^m \frac{\Gamma(b-p_j+1)}{\Gamma(a-p_j)} \right) \left( \prod_{k=1}^n \frac{\Gamma(a-q_k)}{\Gamma(b-q_k+1)} \right).</math> | <math display="block">\prod_{i=a}^b \frac{P(i)}{Q(i)} = \left( \prod_{j=1}^m \frac{\Gamma(b-p_j+1)}{\Gamma(a-p_j)} \right) \left( \prod_{k=1}^n \frac{\Gamma(a-q_k)}{\Gamma(b-q_k+1)} \right).</math> | ||
| Line 610: | Line 609: | ||
=== 18th century: Euler and Stirling === | === 18th century: Euler and Stirling === | ||
[[File:DanielBernoulliLettreAGoldbach-1729-10-06.jpg|thumb|[[Daniel Bernoulli]]'s letter to [[Christian Goldbach]] | [[File:DanielBernoulliLettreAGoldbach-1729-10-06.jpg|thumb|upright=1.65|[[Daniel Bernoulli]]'s letter to [[Christian Goldbach]] (Oct 6, 1729)]] | ||
The problem of extending the factorial to non-integer 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<ref>{{cite web |url=https://www.luschny.de/math/factorial/history.html |title=Interpolating the natural factorial n! or The birth of the real factorial function (1729 - 1826) }}</ref> | The problem of extending the factorial to non-integer 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<ref>{{cite web |url=https://www.luschny.de/math/factorial/history.html |title=Interpolating the natural factorial n! or The birth of the real factorial function (1729 - 1826) }}</ref> | ||
<math display="block">x!=\lim_{n\to\infty}\left(n+1+\frac{x}{2}\right)^{x-1}\prod_{k=1}^{n}\frac{k+1}{k+x}</math> | <math display="block">x!=\lim_{n\to\infty}\left(n+1+\frac{x}{2}\right)^{x-1}\prod_{k=1}^{n}\frac{k+1}{k+x}</math> | ||
which is well defined for real values of {{ | which is well defined for real values of {{mvar|x}} other than the negative integers. | ||
[[Leonhard Euler]] later gave two different definitions: the first was not his integral but an [[infinite product]] that is well defined for all complex numbers {{ | [[Leonhard Euler]] later gave two different definitions: the first was not his integral but an [[infinite product]] that is well defined for all complex numbers {{mvar|n}} other than the negative integers, | ||
<math display="block">n! = \prod_{k=1}^\infty \frac{\left(1+\frac{1}{k}\right)^n}{1+\frac{n}{k}}\,,</math> | <math display="block">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 | 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 display="block">n!=\int_0^1 (-\log s)^n\, ds\,,</math> | <math display="block">n!=\int_0^1 (-\log s)^n\, ds\,,</math> | ||
which is valid when the real part of the complex number {{ | which is valid when the real part of the complex number {{mvar|n}} is strictly greater than {{math|−1}} (i.e., <math>\Re (n) > -1</math>). By the change of variables {{math|1=''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.<ref>Euler's paper was published in ''Commentarii academiae scientiarum Petropolitanae'' 5, 1738, 36–57. See [http://math.dartmouth.edu/~euler/pages/E019.html E19 -- De progressionibus transcendentibus seu quarum termini generales algebraice dari nequeunt], from The Euler Archive, which includes a scanned copy of the original article.</ref> Euler further discovered some of the gamma function's important functional properties, including the reflection formula. | ||
[[James Stirling (mathematician)|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 {{math|''n''!}}, also for non-integers, 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]]. | [[James Stirling (mathematician)|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 {{math|''n''!}}, also for non-integers, 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 === | === 19th century: Gauss, Weierstrass and Legendre === | ||
[[File:Euler factorial paper.png|thumb| | [[File:Euler factorial paper.png|thumb|upright=1.65|alt=De progressionibus transcendentibus, seu quarum termini generales algebraicae dari nequeunt|The first page of Euler's paper]] | ||
[[Carl Friedrich Gauss]] rewrote Euler's product as | [[Carl Friedrich Gauss]] rewrote Euler's product as | ||
| Line 633: | Line 632: | ||
[[Karl Weierstrass]] further established the role of the gamma function in [[complex analysis]], starting from yet another product representation, | [[Karl Weierstrass]] further established the role of the gamma function in [[complex analysis]], starting from yet another product representation, | ||
<math display="block">\Gamma(z) = \frac{e^{-\gamma z}}{z} \prod_{k=1}^\infty \left(1 + \frac{z}{k}\right)^{-1} e^\frac{z}{k},</math> | <math display="block">\Gamma(z) = \frac{e^{-\gamma z}}{z} \prod_{k=1}^\infty \left(1 + \frac{z}{k}\right)^{-1} e^\frac{z}{k},</math> | ||
where {{ | where {{mvar|γ}} is the [[Euler–Mascheroni constant]]. Weierstrass originally wrote his product as one for {{math|{{sfrac|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 {{math|Γ}} were introduced by [[Adrien-Marie Legendre]] around 1811; Legendre also rewrote Euler's integral definition in its modern form. Although the symbol is an upper-case Greek gamma, there is no accepted standard for whether the function name should be written "gamma function" or "Gamma function" (some authors simply write "{{math|Γ}}-function"). The alternative "pi function" notation {{math|1=Π(''z'') = ''z''!}} due to Gauss is sometimes encountered in older literature, but Legendre's notation is dominant in modern works. | The name gamma function and the symbol {{math|Γ}} were introduced by [[Adrien-Marie Legendre]] around 1811; Legendre also rewrote Euler's integral definition in its modern form. Although the symbol is an upper-case Greek gamma, there is no accepted standard for whether the function name should be written "gamma function" or "Gamma function" (some authors simply write "{{math|Γ}}-function"). The alternative "pi function" notation {{math|1=Π(''z'') = ''z''!}} due to Gauss is sometimes encountered in older literature, but Legendre's notation is dominant in modern works. | ||
| Line 650: | Line 649: | ||
[[Jonathan Borwein|Borwein]] & Corless review three centuries of work on the gamma function.<ref>{{cite journal | [[Jonathan Borwein|Borwein]] & Corless review three centuries of work on the gamma function.<ref>{{cite journal | ||
| last1 = Borwein | | last1 = Borwein | ||
| first1 = Jonathan M. | | first1 = Jonathan M. | ||
| author-link1 = Jonathan Borwein | | author-link1 = Jonathan Borwein | ||
| last2 = Corless | | last2 = Corless | ||
| first2 = Robert M. | | first2 = Robert M. | ||
| title = Gamma and Factorial in the Monthly | | title = Gamma and Factorial in the Monthly | ||
| journal = American Mathematical Monthly | | journal = American Mathematical Monthly | ||
| Line 660: | Line 659: | ||
| date = 2017 | | date = 2017 | ||
| volume = 125 | | volume = 125 | ||
| issue = 5 | | issue = 5 | ||
| pages = 400–24 | | pages = 400–24 | ||
| arxiv = 1703.05349 | | arxiv = 1703.05349 | ||
| bibcode= 2017arXiv170305349B | | bibcode= 2017arXiv170305349B | ||
| doi = 10.1080/00029890.2018.1420983 | | doi = 10.1080/00029890.2018.1420983 | ||
| s2cid = 119324101 | | s2cid = 119324101 | ||
}}</ref> | }}</ref> | ||
=== Reference tables and software === | === Reference tables and software === | ||
[[File:Jahnke gamma function.png|thumb|upright=1.65|A hand-drawn graph of the absolute value of the complex gamma function, from ''Tables of Higher Functions'' by [[Eugen Jahnke|Jahnke]] and {{ill|Fritz Emde|de|lt=Emde}}]] | |||
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 mid-20th century, mathematicians relied on hand-made tables; in the case of the gamma function, notably a table computed by Gauss in 1813 and one computed by Legendre in 1825.<ref>{{Cite web |title=What's the history of Gamma_function? |url=https://yearis.com/gamma_function/ |access-date=2022-11-05 |website=yearis.com}}</ref> | 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 mid-20th century, mathematicians relied on hand-made tables; in the case of the gamma function, notably a table computed by Gauss in 1813 and one computed by Legendre in 1825.<ref>{{Cite web |title=What's the history of Gamma_function? |url=https://yearis.com/gamma_function/ |access-date=2022-11-05 |website=yearis.com}}</ref> | ||
Tables of complex values of the gamma function, as well as hand-drawn graphs, were given in ''[[Tables of Functions With Formulas and Curves]]'' by [[Eugen Jahnke|Jahnke]] and {{ill|Fritz Emde|de|lt=Emde}}, first published in Germany in 1909. According to [[Michael Berry (physicist)|Michael Berry]], "the publication in J&E of a three-dimensional graph showing the poles of the gamma function in the complex plane acquired an almost iconic status."<ref>{{cite news|last=Berry |first=M. |url=http://scitation.aip.org/journals/doc/PHTOAD-ft/vol_54/iss_4/11_1.shtml?bypassSSO=1 |title=Why are special functions special? |newspaper=Physics Today |date=April 2001}}</ref> | Tables of complex values of the gamma function, as well as hand-drawn graphs, were given in ''[[Tables of Functions With Formulas and Curves]]'' by [[Eugen Jahnke|Jahnke]] and {{ill|Fritz Emde|de|lt=Emde}}, first published in Germany in 1909. According to [[Michael Berry (physicist)|Michael Berry]], "the publication in J&E of a three-dimensional graph showing the poles of the gamma function in the complex plane acquired an almost iconic status."<ref>{{cite news|last=Berry |first=M. |url=http://scitation.aip.org/journals/doc/PHTOAD-ft/vol_54/iss_4/11_1.shtml?bypassSSO=1 |title=Why are special functions special? |newspaper=Physics Today |date=April 2001}}</ref> | ||
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]].<ref name=Davis /> | 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]].<ref name=Davis /> | ||
[[File:Famous complex plot by Janhke and Emde (Tables of Functions with Formulas and Curves, 4th ed., Dover, 1945) gamma function from -4.5-2.5i to 4.5+2.5i.svg|alt=Reproduction of a famous complex plot by Janhke and Emde (Tables of Functions with Formulas and Curves, 4th ed., Dover, 1945) of the gamma function from −4.5 − 2.5i to 4.5 + 2.5i|thumb|Reproduction of a famous complex plot by Janhke and Emde (Tables of Functions with Formulas and Curves, 4th ed., Dover, 1945) of the gamma function from −4.5 − 2.5i to 4.5 + 2.5i]] | [[File:Famous complex plot by Janhke and Emde (Tables of Functions with Formulas and Curves, 4th ed., Dover, 1945) gamma function from -4.5-2.5i to 4.5+2.5i.svg|upright=1.65|alt=Reproduction of a famous complex plot by Janhke and Emde (Tables of Functions with Formulas and Curves, 4th ed., Dover, 1945) of the gamma function from −4.5 − 2.5i to 4.5 + 2.5i|thumb|Reproduction of a famous complex plot by Janhke and Emde (Tables of Functions with Formulas and Curves, 4th ed., Dover, 1945) of the gamma function from −4.5 − 2.5i to 4.5 + 2.5i]] | ||
Double-precision floating-point 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 (programming language)|C]] standard library ([[math.h]]). Arbitrary-precision implementations are available in most [[computer algebra system]]s, such as [[Mathematica]] and [[Maple (software)|Maple]]. [[PARI/GP]], [[MPFR]] and [[MPFUN]] contain free arbitrary-precision implementations. In some [[software calculator]]s, e.g. [[Windows Calculator]] and [[GNOME]] Calculator, the factorial function returns Γ(''x'' + 1) when the input | Double-precision floating-point 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 (programming language)|C]] standard library ([[math.h]]). Arbitrary-precision implementations are available in most [[computer algebra system]]s, such as [[Mathematica]] and [[Maple (software)|Maple]]. [[PARI/GP]], [[MPFR]] and [[MPFUN]] contain free arbitrary-precision implementations. In some [[software calculator]]s, e.g. [[Windows Calculator]] and [[GNOME]] Calculator, the factorial function returns {{math|Γ(''x'' + 1)}} when the input {{mvar|x}} is a non-integer value.<ref>{{Cite web|title=microsoft/calculator|url=https://github.com/microsoft/calculator|access-date=2020-12-25|website=GitHub|language=en}}</ref><ref>{{Cite web|title=gnome-calculator|url=https://gitlab.gnome.org/GNOME/gnome-calculator|access-date=2023-03-03|website=GNOME.org|language=en}}</ref> | ||
{{clear}} | {{clear}} | ||
| Line 693: | Line 692: | ||
* [[Multiple gamma function]] | * [[Multiple gamma function]] | ||
* [[Multivariate gamma function]] | * [[Multivariate gamma function]] | ||
* [[p-adic gamma function|{{ | * [[p-adic gamma function|{{mvar|p}}-adic gamma function]] | ||
* [[Pochhammer k-symbol|Pochhammer {{ | * [[Pochhammer k-symbol|Pochhammer {{mvar|k}}-symbol]] | ||
* [[q-gamma function|{{ | * [[Polygamma function]] | ||
* [[q-gamma function|{{mvar|q}}-gamma function]] | |||
* [[Ramanujan's master theorem]] | * [[Ramanujan's master theorem]] | ||
* [[Spouge's approximation]] | * [[Spouge's approximation]] | ||
* [[Stirling's approximation]] | * [[Stirling's approximation]] | ||
* [[Bhargava factorial]] | |||
{{div col end}} | {{div col end}} | ||
| Line 714: | Line 715: | ||
* {{cite book|first=P. E. |last=Böhmer |title=Differenzengleichungen und bestimmte Integrale |trans-title=Differential Equations and Definite Integrals |publisher=Köhler Verlag |location=Leipzig |date=1939}} | * {{cite book|first=P. E. |last=Böhmer |title=Differenzengleichungen und bestimmte Integrale |trans-title=Differential Equations and Definite Integrals |publisher=Köhler Verlag |location=Leipzig |date=1939}} | ||
* {{cite journal|first=Philip J. |last=Davis |title=Leonhard Euler's Integral: A Historical Profile of the Gamma Function |journal=[[American Mathematical Monthly]] |volume=66 |issue=10 |pages=849–869 |date=1959 |doi=10.2307/2309786|jstor=2309786 }} | * {{cite journal|first=Philip J. |last=Davis |title=Leonhard Euler's Integral: A Historical Profile of the Gamma Function |journal=[[American Mathematical Monthly]] |volume=66 |issue=10 |pages=849–869 |date=1959 |doi=10.2307/2309786|jstor=2309786 }} | ||
* {{cite journal |last1=Post |first1=Emil |title=The Generalized Gamma Functions |journal=Annals of Mathematics |series=Second Series |date=1919 |volume=20 |issue=3 |pages=202–217 |doi=10.2307/1967871 |jstor=1967871 | * {{cite journal |last1=Post |first1=Emil |title=The Generalized Gamma Functions |journal=Annals of Mathematics |series=Second Series |date=1919 |volume=20 |issue=3 |pages=202–217 |doi=10.2307/1967871 |jstor=1967871}} | ||
* {{cite book|last1 = Press |first1 = W. H. |last2 = Teukolsky |first2 = S. A. |last3 = Vetterling |first3 = W. T. |last4 = Flannery |first4 = B. P. |year = 2007 |title = Numerical Recipes: The Art of Scientific Computing |edition = 3rd |publisher = Cambridge University Press |location = New York |isbn = 978-0-521-88068-8 |chapter = Section 6.1. Gamma Function |chapter-url = http://apps.nrbook.com/empanel/index.html?pg=256 }} | * {{cite book|last1 = Press |first1 = W. H. |last2 = Teukolsky |first2 = S. A. |last3 = Vetterling |first3 = W. T. |last4 = Flannery |first4 = B. P. |year = 2007 |title = Numerical Recipes: The Art of Scientific Computing |edition = 3rd |publisher = Cambridge University Press |location = New York |isbn = 978-0-521-88068-8 |chapter = Section 6.1. Gamma Function |chapter-url = http://apps.nrbook.com/empanel/index.html?pg=256 }} | ||
* {{cite book|first=O. R. |last=Rocktäschel |title=Methoden zur Berechnung der Gammafunktion für komplexes Argument |trans-title=Methods for Calculating the Gamma Function for Complex Arguments |publisher=[[Technische Universität Dresden|Technical University of Dresden]] |location=Dresden |date=1922}} | * {{cite book|first=O. R. |last=Rocktäschel |title=Methoden zur Berechnung der Gammafunktion für komplexes Argument |trans-title=Methods for Calculating the Gamma Function for Complex Arguments |publisher=[[Technische Universität Dresden|Technical University of Dresden]] |location=Dresden |date=1922}} | ||
* {{cite book|first=Nico M. |last=Temme |title=Special Functions: An Introduction to the Classical Functions of Mathematical Physics |publisher=John Wiley & Sons |location=New York |isbn=978-0-471-11313-3 |date=1996}} | * {{cite book|first=Nico M. |last=Temme |title=Special Functions: An Introduction to the Classical Functions of Mathematical Physics |publisher=John Wiley & Sons |location=New York |isbn=978-0-471-11313-3 |date=1996}} | ||
* {{cite book|author-link1=E. T. Whittaker |first1=E. T. |last1=Whittaker |first2=G. N. |last2=Watson|author-link2=G. N. Watson |title=[[A Course of Modern Analysis]] |publisher=Cambridge University Press |date=1927 | | * {{cite book|author-link1=E. T. Whittaker |first1=E. T. |last1=Whittaker |first2=G. N. |last2=Watson|author-link2=G. N. Watson |title=[[A Course of Modern Analysis]] |publisher=Cambridge University Press |date=1927}} {{isbn|978-0-521-58807-2}} | ||
* {{cite journal|first1=Xin |last1=Li |first2=Chao-Ping | last2=Chen|title=Pade approximant related to asymptotics of the gamma function |journal=J. Inequal. Applic. |volume=2017 |pages=53 |date=2017 |issue=1 |doi=10.1186/s13660-017-1315-1 |doi-access=free |pmid=28303079 |pmc=5331117 }} | |||
{{refend}} | {{refend}} | ||
| Line 726: | Line 728: | ||
* Pascal Sebah and Xavier Gourdon. ''Introduction to the Gamma Function''. In [http://numbers.computation.free.fr/Constants/Miscellaneous/gammaFunction.ps PostScript] and [http://numbers.computation.free.fr/Constants/Miscellaneous/gammaFunction.html HTML] formats. | * Pascal Sebah and Xavier Gourdon. ''Introduction to the Gamma Function''. In [http://numbers.computation.free.fr/Constants/Miscellaneous/gammaFunction.ps PostScript] and [http://numbers.computation.free.fr/Constants/Miscellaneous/gammaFunction.html HTML] formats. | ||
* [http://en.cppreference.com/w/cpp/numeric/math/tgamma C++ reference for <code>std::tgamma</code>] | * [http://en.cppreference.com/w/cpp/numeric/math/tgamma C++ reference for <code>std::tgamma</code>] | ||
* [https://www.postgresql.org/docs/18/release-18.html#RELEASE-18-FUNCTIONS <code>gamma()</code> and <code>lgamma()</code> exposed from C99 in Postgres version 18] | |||
* Examples of problems involving the gamma function can be found at [https://web.archive.org/web/20161002083601/http://www.exampleproblems.com/wiki/index.php?title=Special_Functions Exampleproblems.com]. | * Examples of problems involving the gamma function can be found at [https://web.archive.org/web/20161002083601/http://www.exampleproblems.com/wiki/index.php?title=Special_Functions Exampleproblems.com]. | ||
* {{springer|title=Gamma function|id=p/g043310|ref=none}} | * {{springer|title=Gamma function|id=p/g043310|ref=none}} | ||
* [http://functions.wolfram.com/webMathematica/FunctionEvaluation.jsp?name=Gamma Wolfram gamma function evaluator (arbitrary precision)] | * [http://functions.wolfram.com/webMathematica/FunctionEvaluation.jsp?name=Gamma Wolfram gamma function evaluator (arbitrary precision)] {{Webarchive|url=https://web.archive.org/web/20191028215555/http://functions.wolfram.com/webMathematica/FunctionEvaluation.jsp?name=Gamma |date=28 October 2019 }} | ||
* {{WolframFunctionsSite | urlname=GammaBetaErf/Gamma | title=Gamma}} | * {{WolframFunctionsSite | urlname=GammaBetaErf/Gamma | title=Gamma}} | ||
* [http://www.mathpages.com/home/kmath163/kmath163.htm Volume of n-Spheres and the Gamma Function] at MathPages | * [http://www.mathpages.com/home/kmath163/kmath163.htm Volume of n-Spheres and the Gamma Function] at MathPages | ||
Latest revision as of 01:54, 9 November 2025
Template:Short description Template:Log(x) Script error: No such module "about". Template:Use dmy dates
In mathematics, the gamma function (represented by Template:Math, capital Greek letter gamma) is the most common extension of the factorial function to complex numbers. Derived by Daniel Bernoulli, the gamma function is defined for all complex numbers except non-positive integers, and for every positive integer Template:Tmath. The gamma function can be defined via a convergent improper integral for complex numbers with positive real part:
The gamma function then is defined in the complex plane as the analytic continuation of this integral function: it is a meromorphic function which is holomorphic except at zero and the negative integers, where it has simple poles.
The gamma function has no zeros, so the reciprocal gamma function Template:Math 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 appears as a factor in various probability-distribution functions and other formulas in the fields of probability, statistics, analytic number theory, and combinatorics.
Motivation
Template:Dark mode invert 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 Template:Tmath. The simple formula for the factorial, Template:Math is only valid when Template:Mvar is a positive integer, and no elementary function has this property, but a good solution is the gamma function Template:Tmath.[1]
The gamma function is not only smooth but analytic (except at the non-positive 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 Template:Tmath.[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 Template:Tmath, such as Template:Tmath.
One way to resolve the ambiguity is the Bohr–Mollerup theorem, which shows that is the unique interpolating function for the factorial, defined over the positive reals, which is logarithmically convex,[5] meaning that is convex.[6]
Definition
Main definition
The notation is due to Legendre.[1] If the real part of the complex number Template:Mvar 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])
The value can be calculated as:
Using integration by parts, one sees that: Recognizing that as Template:Tmath (so long as ) and as Template:Tmath,
Thus we have shown that for any positive integer Template:Mvar by induction.
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 Template:Mvar, 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
There are many equivalent definitions.
Euler's definition as an infinite product
For a fixed integer Template:Tmath, as the integer increases, we have that[7]
If is not an integer then this equation is meaningless since, in this section, the factorial of a non-integer has not been defined yet. However, in order to define the Gamma function for non-integers, let us assume that this equation continues to hold when is replaced by an arbitrary complex number Template:Tmath:
Multiplying both sides by gives This infinite product, which is due to Euler,[8] converges for all complex numbers except the non-positive integers, which fail because of a division by zero. In fact, the above assumption produces a unique definition of as Template:Tmath.
Intuitively, this formula indicates that is approximately the result of computing for some large integer Template:Tmath, multiplying by to approximate Template:Tmath, and then 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 Template:Mvar.
Weierstrass's definition
The definition for the gamma function due to Weierstrass is also valid for all complex numbers except non-positive integers: where is the Euler–Mascheroni constant.[1] This is the Hadamard product of in a rewritten form.
Template:Collapse top 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 Template:Tmath. Since as Template:Tmath, (or an integer multiple of ) and since Template:Tmath,
where for some integer Template:Tmath. Since for Template:Tmath, we have and
Equivalence of the Weierstrass definition and Euler definition
Properties
General
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
Template:Collapse top Proof 1
With Euler's infinite product compute where the last equality is a known result. A similar derivation begins with Weierstrass's definition.
Proof 2
First prove that Consider the positively oriented rectangular contour with vertices at Template:Tmath, Template:Tmath, and where Template:Tmath. Then by the residue theorem, Let and let be the analogous integral over the top side of the rectangle. Then as and Template:Tmath. If denotes the right vertical side of the rectangle, then for some constant and since Template:Tmath, the integral tends to as Template:Tmath. Analogously, the integral over the left vertical side of the rectangle tends to as Template:Tmath. Therefore from which Then and Proving the reflection formula for all proves it for all by analytic continuation. Template:Collapse bottom
The beta function can be represented as
Setting yields
After the substitution :
The function is even, hence
Now
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 Template:Math, this product is
If the real part is an integer or a half-integer, this can be finitely expressed in closed form:
First, consider the reflection formula applied to Template:Tmath. Applying the recurrence relation to the second term: which with simple rearrangement gives
Second, consider the reflection formula applied to Template:Tmath.
Formulas for other values of for which the real part is integer or half-integer quickly follow by induction using the recurrence relation in the positive and negative directions.
Perhaps the best-known value of the gamma function at a non-integer argument is which can be found by setting in the reflection formula, by using the relation to the beta function given below with Template:Tmath, or simply by making the substitution in the integral definition of the gamma function, resulting in a Gaussian integral. In general, for non-negative integer values of we have: where the double factorial Template:Tmath. 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, Template:Math: For a positive integer Template:Mvar the derivative of the gamma function can be calculated as follows:
where H(m) is the mth harmonic number and Template:Mvar 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 Template:Tmath, 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]
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 and , and for any ,
- For any two positive real numbers and , and >
- For any positive real number Template:Tmath,
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 Template:Mvar, 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 best-known is Gautschi's inequality, which says that for any positive real number Template:Mvar and any Template:Math,
Stirling's formula
Script error: No such module "Labelled list hatnote".
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]
Extension to negative, non-integer values
Although the main definition of the gamma function—the Euler integral of the second kind—is only valid (on the real axis) for positive arguments, its domain can be extended with analytic continuation[13] to negative arguments by shifting the negative argument to positive values by using either the Euler's reflection formula, or the fundamental property, when . For example,
Residues
The behavior for non-positive is more intricate. Euler's integral does not converge for , but the function it defines in the positive complex half-plane has a unique analytic continuation to the negative half-plane. 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 non-positive integers.[1]
For a function of a complex variable Template:Tmath, at a simple pole Template:Tmath, the residue of is given by:
For the simple pole , the recurrence formula can be rewritten as: The numerator at Template:Tmath, is and the denominator So the residues of the gamma function at those points are:[14] The gamma function is non-zero everywhere along the real line, although it comes arbitrarily close to zero as Template:Math. There is in fact no complex number for which , and hence the reciprocal gamma function is an entire function, with zeros at .[1]
Minima and maxima
On the real line, the gamma function has a local minimum at Template:Math[15] where it attains the value Template:Math.[16] The gamma function rises to either side of this minimum. The solution to Template:Math is Template:Math and the common value is Template:Math. The positive solution to Template:Math is Template:Math, the golden ratio, and the common value is Template:Math.[17]
The gamma function must alternate sign between its poles at the non-positive 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.[14] The values at the local extrema of the gamma function along the real axis between the non-positive integers are:
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 Template:Mvar is positive,[18] and[19] where the three integrals respectively follow from the substitutions , [20] and [21] 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 get
Binet's first integral formula for the gamma function states that, when the real part of Template:Mvar is positive, then:[22] The integral on the right-hand side may be interpreted as a Laplace transform. That is,
Binet's second integral formula states that, again when the real part of Template:Mvar is positive, then:[23]
Let Template:Mvar be a Hankel contour, meaning a path that begins and ends at the point Template:Math on the Riemann sphere, whose unit tangent vector converges to Template:Math at the start of the path and to Template:Math at the end, which has winding number 1 around Template:Math, and which does not cross Template:Closed-open. Fix a branch of by taking a branch cut along Template:Closed-open and by taking to be real when Template:Math is on the negative real axis. Assume Template:Mvar is not an integer. Then Hankel's formula for the gamma function is:[24] where is interpreted as . The reflection formula leads to the closely related expression again valid whenever Template:Mvar is not an integer.
Continued fraction representation
The gamma function can also be represented by a sum of two continued fractions:[25][26] where .
Fourier series expansion
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.[27][28] However, Iaroslav Blagouchine discovered that Carl Johan Malmsten first derived this series in 1842.[29][30]
Raabe's formula
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.
Pi function
An alternative notation introduced by Gauss is the -function, a shifted version of the gamma function: so that for every non-negative integer Template:Tmath.
Using the pi function, the reflection formula is: using the normalized sinc function; while the multiplication theorem becomes:
The shifted reciprocal gamma function is sometimes denoted Template:Tmath, an entire function.
The [[volume of an n-ball|volume of an Template:Mvar-ellipsoid]] with radii Template:Math can be expressed as
Relation to other functions
- In the first integral defining the gamma function, the limits of integration are fixed. The upper incomplete gamma function is obtained by allowing the lower limit of integration to vary:There is a similar lower incomplete gamma function.
- The gamma function is related to Euler's beta function by the formula
- 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, . It also appears in the following formula: which is valid only for .Template:Pb The logarithm of the gamma function satisfies the following formula due to Lerch: where is the Hurwitz zeta function, is the Riemann zeta function and the prime (Template:Math) denotes differentiation in the first variable.
- The gamma function is related to the stretched exponential function. For instance, the moments of that function are
Particular values
Script error: No such module "Labelled list hatnote". 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.[31][32][33][34][35][36] The values presented here are truncated rather than rounded.) The complex-valued gamma function is undefined for non-positive integers, but in these cases the value can be defined in the Riemann sphere as Template:Math. The reciprocal gamma function is well defined and analytic at these values (and in the entire complex plane):
Log-gamma 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 logarithmic values instead of multiplying and dividing very large values. It is often defined as[37]
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
from Template:Math to Template:Math with colors
is often used since it allows one to determine function values in one strip of width 1 in Template:Mvar from the neighbouring strip. In particular, starting with a good approximation for a Template:Mvar with large real part one may go step by step down to the desired Template:Mvar. Following an indication of Carl Friedrich Gauss, Rocktaeschel (1922) proposed for Template:Math an approximation for large Template:Math:
This can be used to accurately approximate Template:Math for Template:Mvar with a smaller Template:Math via (P.E.Böhmer, 1939)
A more accurate approximation can be obtained by using more terms from the asymptotic expansions of Template:Math and Template:Math, which are based on Stirling's approximation.
- as Template:Math at constant Template:Math. (See sequences A001163 and A001164 in the OEIS.)
In a more "natural" presentation:
- as Template:Math at constant Template:Math. (See sequences A046968 and A046969 in the OEIS.)
The coefficients of the terms with Template:Math of Template:Math in the last expansion are simply where the Template:Math are the Bernoulli numbers.
The gamma function also has Stirling Series (derived by Charles Hermite in 1900) equal to[38]
Properties
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 on the positive real axis. Another characterisation is given by the Wielandt theorem.
The gamma function is the unique function that simultaneously satisfies
- ,
- for all complex numbers except the non-positive integers, and,
- for integer Template:Mvar, for all complex numbers Template:Tmath.[1]
In a certain sense, the log-gamma function is the more natural form; it makes some intrinsic attributes of the function clearer. A striking example is the Taylor series of Template:Math around 1: with Template:Math denoting the Riemann zeta function at Template:Mvar.
So, using the following property: an integral representation for the log-gamma function is: or, setting Template:Math to obtain an integral for Template:Mvar, we can replace the Template:Mvar 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 Template:Mvar. For instance, if and are integers with and Template:Tmath, then[39] This formula is sometimes used for numerical computation, since the integrand decreases very quickly.
Integration over log-gamma
The integral can be expressed in terms of the [[Barnes G-function|Barnes Template:Mvar-function]][40][41] (see [[Barnes G-function|Barnes Template:Mvar-function]] for a proof): where Template:Math.
It can also be written in terms of the Hurwitz zeta function:[42][43]
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 :[44] where is .
D. H. Bailey and his co-authors[45] gave an evaluation for when in terms of the Tornheim–Witten zeta function and its derivatives.
In addition, it is also known that[46]
Approximations
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 Template:Math 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 Template:Mvar the gamma function can be written
When Template:Math and , the absolute value of the last integral is smaller than . By choosing a large enough Template:Tmath, this last expression can be made smaller than for any desired value Template:Tmath. 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.[47][48][49]
For arguments that are integer multiples of Template:Math, the gamma function can also be evaluated quickly using arithmetic–geometric mean iterations (see particular values of the gamma function).[50]
Practical implementations
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.[51]
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 Stirling's formula for the Gamma Function may be used.
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 Template:Math is most difficult to avoid."[52]
Integration problems
The gamma function finds application in such diverse areas as quantum physics, astrophysics and fluid dynamics.[53] 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.[54]
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 Template:Mvar is a power function and Template:Mvar 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 time-dependent 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 Template:Math 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 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 Template:Mvar-dimensional 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. For example, for any complex numbers Template:Mvar and Template:Mvar, with Template:Math, we can write which closely resembles the binomial coefficient when Template:Mvar is a non-negative 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 Template:Mvar elements from a set of Template:Mvar elements; if Template:Math, there are of course no ways. If Template:Math, Template:Math 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 Template:Mvar and Template:Mvar are monic polynomials of degree Template:Mvar and Template:Mvar with respective roots Template:Math and Template:Math, 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 right-hand side depends only on the degree of the polynomials, so it does not matter whether Template:Math equals 5 or 105. By taking the appropriate limits, the equation can also be made to hold even when the left-hand 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:
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 so-called "trivial" zeros on the real line. Borwein et al. call this formula "one of the most beautiful findings in mathematics".[55] 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.
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 non-integer 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[56] which is well defined for real values of Template:Mvar other than the negative integers.
Leonhard Euler later gave two different definitions: the first was not his integral but an infinite product that is well defined for all complex numbers Template:Mvar 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 Template:Mvar is strictly greater than Template:Math (i.e., ). By the change of variables Template:Math, 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.[57] 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 Template:Math, also for non-integers, 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 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.[58] 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 Template:Mvar is the Euler–Mascheroni constant. Weierstrass originally wrote his product as one for Template:Math, 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 Template:Math were introduced by Adrien-Marie Legendre around 1811; Legendre also rewrote Euler's integral definition in its modern form. Although the symbol is an upper-case Greek gamma, there is no accepted standard for whether the function name should be written "gamma function" or "Gamma function" (some authors simply write "Template:Math-function"). The alternative "pi function" notation Template:Math 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 Template:Math instead of simply using "Template:Math". Consider that the notation for exponents, Template:Math, has been generalized from integers to complex numbers Template:Math without any change. Legendre's motivation for the normalization is not known, and has been criticized as cumbersome by some (the 20th-century mathematician Cornelius Lanczos, for example, called it "void of any rationality" and would instead use Template:Math).[59] 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 Template:Math against the multiplicative character Template:Math with respect to the Haar measure on the Lie group Template:Math. Thus this normalization makes it clearer that the gamma function is a continuous analogue of a Gauss sum.[60]
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.[61] 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 Template:Mvar 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 review three centuries of work on the gamma function.[62]
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 mid-20th century, mathematicians relied on hand-made tables; in the case of the gamma function, notably a table computed by Gauss in 1813 and one computed by Legendre in 1825.[63]
Tables of complex values of the gamma function, as well as hand-drawn graphs, were given in Tables of Functions With Formulas and Curves by Jahnke and Template:Ill, first published in Germany in 1909. According to Michael Berry, "the publication in J&E of a three-dimensional graph showing the poles of the gamma function in the complex plane acquired an almost iconic status."[64]
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]
Double-precision floating-point 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). Arbitrary-precision implementations are available in most computer algebra systems, such as Mathematica and Maple. PARI/GP, MPFR and MPFUN contain free arbitrary-precision implementations. In some software calculators, e.g. Windows Calculator and GNOME Calculator, the factorial function returns Template:Math when the input Template:Mvar is a non-integer value.[65][66]
See also
- Ascending factorial
- Cahen–Mellin integral
- Elliptic gamma function
- Lemniscate constant
- Pseudogamma function
- Hadamard's gamma function
- Inverse gamma function
- Lanczos approximation
- Multiple gamma function
- Multivariate gamma function
- [[p-adic gamma function|Template:Mvar-adic gamma function]]
- [[Pochhammer k-symbol|Pochhammer Template:Mvar-symbol]]
- Polygamma function
- [[q-gamma function|Template:Mvar-gamma function]]
- Ramanujan's master theorem
- Spouge's approximation
- Stirling's approximation
- Bhargava factorial
Notes
Further reading
- Script error: No such module "citation/CS1".
- Script error: No such module "citation/CS1".
- Script error: No such module "citation/CS1".
- Template:Dlmf
- Script error: No such module "Citation/CS1".
- Script error: No such module "citation/CS1".
- Script error: No such module "Citation/CS1".
- Script error: No such module "Citation/CS1".
- Script error: No such module "citation/CS1".
- Script error: No such module "citation/CS1".
- Script error: No such module "citation/CS1".
- Script error: No such module "citation/CS1". Template:Isbn
- Script error: No such module "Citation/CS1".
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 gamma()andlgamma()exposed from C99 in Postgres version 18- Examples of problems involving the gamma function can be found at Exampleproblems.com.
- Template:Springer
- Wolfram gamma function evaluator (arbitrary precision) Template:Webarchive
- Script error: No such module "citation/CS1".
- Volume of n-Spheres and the Gamma Function at MathPages
- ↑ a b c d e f g h i j k l m n Script error: No such module "Citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1". Extract of page 28
- ↑ Script error: No such module "citation/CS1". Expression G.2 on page 293
- ↑ Script error: No such module "Citation/CS1".
- ↑ Script error: No such module "Template wrapper".
- ↑ Script error: No such module "Citation/CS1".
- ↑ Script error: No such module "Citation/CS1".
- ↑ Template:Dlmf
- ↑ Script error: No such module "Citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ a b Script error: No such module "Template wrapper".
- ↑ Template:Cite OEIS
- ↑ Template:Cite OEIS
- ↑ Template:Cite OEIS
- ↑ Script error: No such module "citation/CS1".
- ↑ Whittaker and Watson, 12.2 example 1.
- ↑ Script error: No such module "Citation/CS1".
- ↑ Script error: No such module "Citation/CS1".
- ↑ Whittaker and Watson, 12.31.
- ↑ Whittaker and Watson, 12.32.
- ↑ Whittaker and Watson, 12.22.
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "Citation/CS1".
- ↑ Script error: No such module "Citation/CS1".
- ↑ Template:Cite OEIS
- ↑ Template:Cite OEIS
- ↑ Template:Cite OEIS
- ↑ Template:Cite OEIS
- ↑ Template:Cite OEIS
- ↑ Template:Cite OEIS
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "Citation/CS1".
- ↑ Script error: No such module "Citation/CS1".
- ↑ Script error: No such module "Citation/CS1".
- ↑ Script error: No such module "Citation/CS1".
- ↑ Script error: No such module "Citation/CS1".
- ↑ Script error: No such module "Citation/CS1".
- ↑ Script error: No such module "Citation/CS1".
- ↑ Script error: No such module "Citation/CS1".
- ↑ 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".
- ↑ Script error: No such module "Citation/CS1".
- ↑ Script error: No such module "Citation/CS1".
- ↑ Michon, G. P. "Trigonometry and Basic Functions Template:Webarchive". Numericana. Retrieved 5 May 2007.
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ 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.
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "Citation/CS1".
- ↑ Script error: No such module "citation/CS1". Extract of page 205
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "Citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".
- ↑ Script error: No such module "citation/CS1".