Abstract
About 1730 James Stirling, building on the work of Abraham de Moivre, published what is known as Stirling's approximation of $n!$. He gave a good formula which is asymptotic to $n!$. Since then hundreds of papers have given alternative proofs of his result and improved upon it, including notably by Burside, Gosper, and Mortici. However, Srinivasa Ramanujan gave a remarkably better asymptotic formula. Hirschhorn and Villarino gave nice proof of Ramanujan's result and an error estimate for the approximation. In recent years there have been several improvements of Stirling's formula including by Nemes, Windschitl, and Chen. Here it is shown (i) how all these asymptotic results can be easily verified; (ii) how Hirschhorn and Villarino's argument allows tweaking of Ramanujan's result to give a better approximation; and (iii) that new asymptotic formulae can be obtained by further tweaking of Ramanujan's result. Tables are calculated displaying how good each of these approximations is for $n$ up to one million.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
