# .

# Stirling's approximation

In mathematics, Stirling's approximation (or Stirling's formula) is an approximation for large factorials. It is named after James Stirling.

The formula as typically used in applications is

\( \ln n! = n\ln n - n +O(\ln(n))\ \)

The next term in the O(ln(n)) is (1/2)ln(2πn); a more precise variant of the formula is therefore

\( \lim_{n \rightarrow \infty} {\frac{n!}{\sqrt{2\pi n}\, \left(\frac{n}{e}\right)^n}} = 1,\)

often written

\( n! \sim \sqrt{2 \pi n} \left(\frac{n}{e}\right)^n.\)

Sometimes, bounds for n! rather than asymptotics are required: one has, for all n\in\N _ +

\( \sqrt{2\pi}\ n^{n+1/2}e^{-n} \le n! \le e\ n^{n+1/2}e^{-n} , \)

so for all \( n \ge 1 \) the ratio \( \frac{n!}{n^{n+1/2}e^{-n}} \) is always e.g. between 2.5 and 3.

Derivation

The formula, together with precise estimates of its error, can be derived as follows. Instead of approximating n!, one considers its natural logarithm as this is a slowly varying function:

\( \ln(n!) = \ln 1 + \ln 2 + \cdots + \ln n.\)

The right-hand side of this equation is (almost) the approximation by the trapezoid rule of the integral \( \int_1^n \ln(x)\,{\rm d}x = n \ln n - n + 1 \) , and the error in this approximation is given by the Euler–Maclaurin formula:

\( \begin{align} \ln (n!) - \frac{\ln n}{2} & = \frac{\ln 1}{2} + \ln 2 + \cdots + \ln(n-1) + \frac{\ln n}{2} \\ & = n \ln n - n + 1 + \sum_{k=2}^{m} \frac{(-1)^k B_k}{k(k-1)} \left( \frac{1}{n^{k-1}} - 1 \right) + R_{m,n}, \end{align}\)

where Bk is a Bernoulli number and Rm,n is the remainder term in the Euler–Maclaurin formula. Take limits to find that

\( \lim_{n \to \infty} \left( \ln n! - n \ln n + n - \frac{\ln n}{2} \right) = 1 - \sum_{k=2}^{m} \frac{(-1)^k B_k}{k(k-1)} + \lim_{n \to \infty} R_{m,n}.\)

Denote this limit by y. Because the remainder Rm,n in the Euler–Maclaurin formula satisfies

\( R_{m,n} = \lim_{n \to \infty} R_{m,n} + O \left( \frac{1}{n^m} \right),\)

where we use Big-O notation, combining the equations above yields the approximation formula in its logarithmic form:

\( \ln n! = n \ln \left( \frac{n}{e} \right) + \frac{\ln n}{2} + y + \sum_{k=2}^{m} \frac{(-1)^k B_k}{k(k-1)n^{k-1}} + O \left( \frac{1}{n^m} \right).\)

Taking the exponential of both sides, and choosing any positive integer m, we get a formula involving an unknown quantity ey. For m=1, the formula is

\( n! = e^{y} \sqrt{n}~{\left( \frac{n}{e} \right)}^n \left( 1 + O \left( \frac{1}{n} \right) \right).\)

The quantity ey can be found by taking the limit on both sides as n tends to infinity and using Wallis' product, which shows that \( e^y = \sqrt{2 \pi}\) . Therefore, we get Stirling's formula:

\( n! = \sqrt{2 \pi n}~{\left( \frac{n}{e} \right)}^n \left( 1 + O \left( \frac{1}{n} \right) \right).\)

The formula may also be obtained by repeated integration by parts, and the leading term can be found through Laplace's method. Stirling's formula, without the factor \( \sqrt{2 \pi n} that is often irrelevant in applications, can be quickly obtained by approximating the sum

\( \ln n! = \sum_{j=1}^n \ln j\)

with an integral:

\( \sum_{j=1}^n \ln j \approx \int_1^n \ln x \,{\rm d}x = n\ln n - n + 1.\)

Speed of convergence and error estimates

The relative error in a truncated Stirling series vs. n, for 1 to 5 terms.

More precisely,

\( n! = \sqrt{2 \pi n} \left(\frac{n}{e}\right)^n e^{\lambda_n}\)

with

\( \frac{1}{12n+1} < \lambda_n < \frac{1}{12n}.\)

Stirling's formula is in fact the first approximation to the following series (now called the Stirling series):

\( n!=\sqrt{2\pi n}\left({n\over e}\right)^n \left( 1 +{1\over12n} +{1\over288n^2} -{139\over51840n^3} -{571\over2488320n^4} + \cdots \right) \)

\( =\sqrt{2\pi n}\left({n\over e}\right)^n \left( 1 +{1\over(2^1)(6n)^1} +{1\over(2^3)(6n)^2} -{139\over(2^3)(2\cdot3\cdot5)(6n)^3} -{571\over(2^6)(2\cdot3\cdot5)(6n)^4} + \cdots \right). \)

The first graph in this section shows the relative error vs. n, for 1 through all 5 terms listed above.

The relative error in a truncated Stirling series vs. the number of terms used.

As \( n \to \infty, the error in the truncated series is asymptotically equal to the first omitted term. This is an example of an asymptotic expansion. It is not a convergent series; for any particular value of n there are only so many terms of the series that improve accuracy, after which point accuracy actually gets worse. This is demonstrated in the next graph, which shows the relative error vs. the number of terms in the series.

(More precisely, let S(n, t) be the Stirling series to t terms evaluated at n. The graphs show \( \left | \ln (S(n, t) / n!) \right | , which, when small, is essentially the relative error.)

The asymptotic expansion of the logarithm is also called Stirling's series:

\( \ln n!=n\ln n - n + {1\over 2}\ln(2\pi n) +{1\over12n} -{1\over360n^3} +{1\over1260n^5} -{1\over 1680n^7} +\cdots \)

\( =n\ln n - n + {1\over 2}\ln(2\pi n) +{1\over(2^2\cdot3^1)n} -{1\over(2^3\cdot3^2\cdot5^1)n^3} +{1\over(2^2\cdot3^2\cdot5^1\cdot7^1)n^5} -{1\over(2^4\cdot3^1\cdot5^1\cdot7^1)n^7} +\cdots.\)

In this case, it is known that the error in truncating the series is always of the same sign and at most the same magnitude as the first omitted term.

Stirling's formula for the Gamma function

For all positive integers,

\( n! = \Pi(n) = \Gamma(n+1).\,\)

However, the Pi function, unlike the factorial, is more broadly defined for all complex numbers other than non-positive integers; nevertheless, Stirling's formula may still be applied. If \Re(z) > 0 then

\( \ln \Gamma (z) = \left(z-\frac12\right)\ln z -z + \frac{\ln {2 \pi}}{2} + 2 \int_0^\infty \frac{\arctan \frac{t}{z}}{\exp(2 \pi t)-1}\,{\rm d}t.\)

Repeated integration by parts gives

\( \ln \Gamma (z) \sim \left(z-\frac12\right)\ln z -z + \frac{\ln {2 \pi}}{2} + \sum_{n=1}^\infty \frac{B_{2n}}{2n(2n-1)z^{2n-1}}\)

where Bn is the nth Bernoulli number (note that the infinite sum is not convergent, so this formula is just an asymptotic expansion). The formula is valid for z large enough in absolute value when \( |\arg z| < \pi - \epsilon, where ε is positive, with an error term of O(z^{-m - 1/2}) when the first m terms are used. The corresponding approximation may now be written:

\( \Gamma(z) = \sqrt{\frac{2 \pi}{ z}}~{\left( \frac{z}{e} \right)}^z \left( 1 + O \left( \frac{1}{z} \right) \right).\)

A convergent version of Stirling's formula

Thomas Bayes showed, in a letter to John Canton published by the Royal Society in 1763, that Stirling's formula did not give a convergent series.[1]

Obtaining a convergent version of Stirling's formula entails evaluating

\( \int_0^\infty \frac{2\arctan \frac{t}{z}}{\exp(2 \pi t)-1}\,{\rm d}t = \ln\Gamma (z) - \left( z-\frac12 \right) \ln z +z - \frac12\ln(2\pi). \)

One way to do this is by means of a convergent series of inverted rising exponentials. If\( z^{\bar n} = z(z+1) \cdots (z+n-1)\) , then

\( \int_0^\infty \frac{2\arctan \frac{t}{z}}{\exp(2 \pi t)-1} \,{\rm d}t = \sum_{n=1}^\infty \frac{c_n}{(z+1)^{\bar n}}\)

where

\( c_n = \frac{1}{n} \int_0^1 x^{\bar n} \left( x-\frac12 \right) \,{\rm d}x = \frac{1}{{2n}}\sum\limits_{k = 1}^n {\frac{{k\left| {s(n,k)} \right|}}{{\left( {k + 1} \right)\left( {k + 2} \right)}}}\)

where \( {s\left( {n,k} \right)}\) denotes the Stirling numbers of the first kind. From this we obtain a version of Stirling's series

\( \begin{align} \ln \Gamma (z) & = \left( z-\frac12 \right) \ln z -z + \frac{\ln (2 \pi)}{2} \\[8pt] & {} + \frac{1}{12(z+1)} + \frac{1}{12(z+1)(z+2)} + \frac{59}{360(z+1)(z+2)(z+3)} \\[8pt] & {} + \frac{29}{60(z+1)(z+2)(z+3)(z+4)} + \cdots \end{align} \)

which converges when \( \Re(z)>0.\)

Versions suitable for calculators

The approximation:

\( \Gamma(z) \approx \sqrt{\frac{2 \pi}{z} } \left( \frac{z}{e} \sqrt{ z \sinh \frac{1}{z} + \frac{1}{810z^6} } \right)^{z},\)

or equivalently,

\( 2 \ln \Gamma(z) \approx \ln(2 \pi) - \ln z + z \left(2 \ln z + \ln \left( z \sinh \frac{1}{z} + \frac{1}{810z^6} \right) - 2 \right),\)

can be obtained by rearranging Stirling's extended formula and observing a coincidence between the resultant power series and the Taylor series expansion of the hyperbolic sine function. This approximation is good to more than 8 decimal digits for z with a real part greater than 8. Robert H. Windschitl suggested it in 2002 for computing the Gamma function with fair accuracy on calculators with limited program or register memory.[2]

Gergő Nemes proposed in 2007 an approximation which gives the same number of exact digits as the Windschitl approximation but is much simpler:[3]

\( \Gamma(z) \approx \sqrt{\frac{2 \pi}{z} } \left( \frac{1}{e} \left( z + \frac{1}{12z- \frac{1}{10z}} \right) \right)^{z},\)

or equivalently,

\( \ln \Gamma(z) \approx \frac{1}{2} \left[\ln(2 \pi) - \ln z \right] + z \left[\ln \left( z + \frac{1}{12z- \frac{1}{10z}} \right)-1\right]. \) \)

An apparently superior approximation[citation needed] for log n! was also given by Srinivasa Ramanujan (Ramanujan 1988)

\( \log n! \approx n\log n - n + \frac {\log(n(1+4n(1+2n)))} {6} + \frac {\log(\pi)} {2}.\)

History

The formula was first discovered by Abraham de Moivre[4][5] in the form

\( n!\sim [{\rm constant}]\cdot n^{n+1/2} e^{-n}.\)

De Moivre gave an expression for the constant in terms of its natural logarithm. Stirling's contribution consisted of showing that the constant is \( \sqrt{2\pi} \) . The more precise versions are due to Jacques Binet.

See also

Factorial

Lanczos approximation

Spouge's approximation

Notes

^ http://www.york.ac.uk/depts/maths/histstat/letter.pdf

^ Toth, V. T. Programmable Calculators: Calculators and the Gamma Function (2006)

^ Nemes, Gergő (2010), "New asymptotic expansion for the Gamma function", Archiv der Mathematik 95 (2): 161–169, doi:10.1007/s00013-010-0146-9, ISSN 0003-889X.

^ Le Cam, L. (1986), "The central limit theorem around 1935", Statistical Science 1 (1): 78–96 [p. 81], doi:10.1214/ss/1177013818, "The result, obtained using a formula originally proved by de Moivre but now called Sterling's formula, occurs in his `Doctrine of Chances' of 1733.".[unreliable source?]

^ Pearson, Karl, "Historical note on the origin of the normal curve of errors", Biometrika 16: 402–404 [p. 403], "I consider that the fact that Stirling showed that De Moivre's arithmetical constant was \sqrt{2\pi} does not entitle him to claim the theorem, [...]"

References

Abramowitz, M. & Stegun, I. (2002), Handbook of Mathematical Functions

Nemes, G. (2010), "New asymptotic expansion for the Gamma function", Archiv der Mathematik 95 (2): 161–169, doi:10.1007/s00013-010-0146-9

Paris, R. B. & Kaminsky, D. (2001), Asymptotics and the Mellin–Barnes Integrals, New York: Cambridge University Press, ISBN 0-521-79001-8

Whittaker, E. T. & Watson, G. N. (1996), A Course in Modern Analysis (4th ed.), New York: Cambridge University Press, ISBN 0-521-58807-3

Dan Romik, Stirling’s Approximation for n!: The Ultimate Short Proof?, The American Mathematical Monthly, Vol. 107, No. 6 (Jun. – Jul., 2000), 556–557.

Y.-C. Li, A Note on an Identity of The Gamma Function and Stirling’s Formula, Real Analysis Exchang, Vol. 32(1), 2006/2007, pp. 267–272.

External links

Peter Luschny, Approximation formulas for the factorial function n!

Weisstein, Eric W., "Stirling's Approximation" from MathWorld.

Stirling's approximation at PlanetMath

When k = n or n−1 we saw in the previous section that Vk(Fn) is a principal homogeneous space, and therefore diffeomorphic to the corresponding classical group. These are listed in the table at the right.

Retrieved from "http://en.wikipedia.org/"

All text is available under the terms of the GNU Free Documentation License