Stirling's approximation
James Stirling (1692-1770, Scotland)
Because of Euler-MacLaurin formula
- Failed to parse (Conversion error. Server ("https://wikimedia.org/api/rest_") reported: "Cannot get mml. Server problem."): {\displaystyle \sum _{k=1}^{N}\ln k=\int _{1}^{N}\ln x\,dx+\sum _{k=1}^{p}{\frac {B_{2k}}{2k(2k-1)}}\left({\frac {1}{n^{2k-1}}}-1\right)+R}
where B1 = −1/2, B2 = 1/6, B3 = 0, B4 = −1/30, B5 = 0, B6 = 1/42, B7 = 0, B8 = −1/30, ... are the Bernoulli numbers, and R is an error term which is normally small for suitable values of p.
Then
Thus, for large N