You are currently browsing the tag archive for the ‘factorial function’ tag.

In this supplemental set of notes we derive some approximations for ${n!}$, when ${n}$ is large, and in particular Stirling’s formula. This formula (and related formulae for binomial coefficients ${\binom{n}{m}}$ will be useful for estimating a number of combinatorial quantities in this course, and also in allowing one to analyse discrete random walks accurately.