Linked from

The 11 pages that link to Stirling's approximation, each with the reason it gives.

• FactorialRelated: It estimates factorials too large to compute directly.

• Gamma functionRelated: It describes how Γ(z) grows when its argument becomes large.

• PiRelated: Its leading expression includes √(2πn), linking pi to factorial growth.

• Root testRelated: It evaluates root-test limits for terms containing factorials.

• Abraham de MoivreRelated: De Moivre found an early version while approximating factorials in probability calculations.

• Euler–Mascheroni constantRelated: Its refined forms connect γ with asymptotic estimates involving factorials and harmonic sums.

• Bohr–Mollerup theoremRelated: Log-convexity and recurrence help derive bounds related to this approximation.

• Carleman's inequalityRelated: Factorial estimates explain why finite versions approach the constant e.