Stirling’s formula. Let us seek an asymptotic expansion for n!; this leads us to expand sn=∑p=1nlogp, and then exp(sn). The method of n 2 gives successively
We shall show in VII, p. 322, that ek=2π. The formula (5) (with this value of k) is called Stirling's formula. In the same way, for every real number a not an integer >0, one shows that
(a+1)(a+2)…(a+n)∼K(a)nn+a+21e−n.(6)
We shall determine the function K(a) too (VII, p. 18). From formulae (5) and (6) one derives in particular that
(na)∼(−1)nφ(a)n−a−1(7)
for every real number a not an integer >0, where φ(a) is a function of a which will be specified in VII, p. 322.
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.