Papers
Topics
Authors
Recent
Search
2000 character limit reached

Tweaking Ramanujan's Approximation of n!

Published 29 Oct 2020 in math.NT and math.CA | (2010.15512v1)

Abstract: In 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 a 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 a tweaking of Ramanujan's result to give a better approximation; (iii) that a new asymptotic formula can be obtained by further tweaking of Ramanujan's result; (iv) that Chen's asymptotic formula is better than the others mentioned here, and the new asymptotic formula is comparable with Chen's.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.