proof of Stirling’s approximation


Computing the Taylor expansionMathworldPlanetmath with remainder of the functions log and x↦x⁢log⁡x-x, we have

(n+1)⁢log⁡(n+1)-log⁡(n+1) = n⁢log⁡n-n+log⁡n+12⁢n+16⁢ξn2
log⁡(n+1) = log⁡n+1n-12⁢ηn2

where n≤ξn≤n+1 and n≤ηn≤n+1. Summing the first equation from 1 to n-1, we have

nlogn-n=-1+log(n-1)!+12∑m=1n-11m+16∑m=1n-11ξn2.
Title proof of Stirling’s approximation
Canonical name ProofOfStirlingsApproximation
Date of creation 2014-05-08 22:09:30
Last modified on 2014-05-08 22:09:30
Owner rspuzio (6075)
Last modified by rspuzio (6075)
Numerical id 6
Author rspuzio (6075)
Entry type Proof
Classification msc 68Q25
Classification msc 30E15