weaker version of Stirling’s approximation


One can prove a weaker version of Stirling’s approximation without appealing to the gamma functionDlmfDlmfMathworldPlanetmath. Consider the graph of ln⁡x and note that

ln(n-1)!≤∫1nlnxdx≤lnn!

But ∫ln⁡x⁢d⁢x=x⁢ln⁡x-x, so

ln(n-1)!≤nlnn-n+1≤lnn!

and thus

nlnn-n+1+lnn≥ln(n-1)!+lnn=lnn!≥nlnn-n+1

so

ln⁡n-1+1n+ln⁡nn≥1n⁢ln⁡n!≥ln⁡n-1+1n

As n gets large, the expressions on either end approach ln⁡n-1, so we have

1n⁢ln⁡n!≈ln⁡n-1

Multiplying through by n and exponentiating, we get

n!≈nn⁢e-n
Title weaker version of Stirling’s approximation
Canonical name WeakerVersionOfStirlingsApproximation
Date of creation 2013-03-22 16:25:21
Last modified on 2013-03-22 16:25:21
Owner rm50 (10146)
Last modified by rm50 (10146)
Numerical id 7
Author rm50 (10146)
Entry type Result
Classification msc 41A60
Classification msc 30E15
Classification msc 68Q25