last updated: May 1, 2025

Stochastic Processes and Financial Mathematics
(part one)

9.2 Stirling’s Approximation \msconly

Stirling’s approximation is a fundamental inequality that is used across many different parts of mathematics. It connects the factorial function with the constants π and e, and is often written informally as n!2πn(ne)n. We mention it here because the distribution of Sn, where (Sn) is a random walk, can sometimes be expressed using formulae involving binomial coefficients. Stirling’s approximation is helpful to calculate the limits of such quantities as n.

It is also helpful to introduce some notation from analysis that you may not have seen before: if (an) and (bn) are real valued sequences then we write

anbn to mean that limnanbn=1.

We will use this notation throughout the remainder of Chapter 9.

  • Theorem 9.2.1 For all nN it holds that

    2πn(ne)ne1/(12n+1)<n!<2πn(ne)ne1/(12n).

This is a result from real analysis so we won’t include a proof in this course. Using that e1/n1, it is straightforward to check that Theorem 9.2.1 implies the weaker result

(9.7)n!2πn(ne)n.

We will apply Stirling’s approximation in this form. Equation (9.7) appears on the formula sheet.