Stirling's approximation

From SklogWiki
Revision as of 18:14, 4 November 2008 by Carl McBride (talk | contribs) (Added a table)
Jump to navigation Jump to search

James Stirling (1692-1770, Scotland)

lnN!=ln1+ln2+ln3+...+lnN=∑k=1Nlnk.

Because of Euler-MacLaurin formula

∑k=1Nlnk=∫1Nlnxdx+∑k=1pB2k2k(2k−1)(1n2k−1−1)+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, for large N,

lnN!∼∫1Nlnxdx∼NlnN−N.

after some further manipulation one arrives at

N!=2πNNNe−NeλN

where

112N+1<λN<112N.

For example:

N N! (exact) N! (Stirling) Error (%)
5 120 118.019168 1.016
6 720 710.078185 1.014
7 5040 4980.39583 1.012
8 40320 39902.3955 1.010
9 362880 359536.873 1.009
10 3628800 3598695.62 1.008

As one usually deals with number of the order of the Avogadro constant (1023) this formula is essentially exact.

Applications in statistical mechanics