10.5: E- Stirling's Approximation
- Page ID
- 6396
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\( \newcommand{\dsum}{\displaystyle\sum\limits} \)
\( \newcommand{\dint}{\displaystyle\int\limits} \)
\( \newcommand{\dlim}{\displaystyle\lim\limits} \)
\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)
( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\id}{\mathrm{id}}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\kernel}{\mathrm{null}\,}\)
\( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\)
\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\)
\( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)
\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)
\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)
\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vectorC}[1]{\textbf{#1}} \)
\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)
\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)
\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\(\newcommand{\longvect}{\overrightarrow}\)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\(\newcommand{\ket}[1]{\left| #1 \right>}\)
\(\newcommand{\bra}[1]{\left< #1 \right|}\)
\(\newcommand{\braket}[2]{\left< #1 \vphantom{#2} \right| \left. #2 \vphantom{#1} \right>}\)
\(\newcommand{\braopket}[3]{\left< #1 \vphantom{#2}\vphantom{#3} \right| #2 \vphantom{#1}\vphantom{#3} \left| #3 \vphantom{#1}\vphantom{#2} \right>}\)
\(\newcommand{\qmvec}[1]{\mathbf{\vec{#1}}}\)
\(\newcommand{\op}[1]{\hat{\mathbf{#1}}}\)
\(\newcommand{\expect}[1]{\langle #1 \rangle}\)
\(\newcommand{\dfn}[1]{\emph{\textbf{#1}}}\)
The Stirling formula is an approximation for n! that is good at large values of n.
\[ n !=1 \cdot 2 \cdot 3 \cdots(n-1) \cdot n\]
\[ \ln (n !)=\underbrace{\ln 1}_{0}+\ln 2+\ln 3+\cdots+\ln (n-1)+\ln (n)\]
Note that the function ln x is nearly flat for large values of x. For example, ln 1023 is about equal to 23.
From the figure
\[ \ln (6 !)=\text { area under the staircase }>\int_{1}^{6} \ln x d x\]
and in general
\[ \ln (n !)>\int_{1}^{n} \ln x d x=[x \ln x-x]_{1}^{n}=n \ln n-n+1. \]
For large values of n, where the ln n function is nearly flat, the two expressions above become quite close. Also, the 1 becomes negligible. We conclude that
\[ \ln (n !) \approx n \ln n-n \quad \text { for } n \gg 1.\]
This is Stirling’s formula. For corrections to the formula, see M. Boas, Mathematical Methods in the Physical Sciences, sections 9-10 and 9-11. You know that
\[ A^n\]
increases rapidly with n for positive A, but
\[ n ! \approx\left(\frac{n}{e}\right)^{n}\]
increases a bit more rapidly still.
E.1 Problem: An upper bound for the factorial function
Stirling’s approximation gives a rigorous lower bound for n!.
a. Use the general ideas presented in the derivation of that lower bound to show that
\[ \int_{1}^{n} \ln (x+1) d x>\ln n !.\]
b. Conclude that
\[ (n+1) \ln (n+1)-n+1-2 \ln 2>\ln n !>n \ln n-n+1.\]