Papers
Topics
Authors
Recent
Search
2000 character limit reached

Elementary Proofs of Some Stirling Bounds

Published 20 Feb 2018 in math.FA and cs.CC | (1802.07046v2)

Abstract: We give elementary proofs of several Stirling's precise bounds. We first improve all the precise bounds from the literature and give new precise bounds. In particular, we show that for all n≥8n\ge 8 2πn(ne)<sup>n</sup>e<sup>112n−1360n<sup>3+103n</sup></sup>≥n!≥2πn(ne)<sup>n</sup>e<sup>112n−1360n<sup>3+102n\sqrt{2\pi n}\left(\frac{n}{e}\right)<sup>n</sup> e<sup>{\frac{1}{12n}-\frac{1}{360n<sup>3+103n}}</sup></sup> \ge n!\ge \sqrt{2\pi n}\left(\frac{n}{e}\right)<sup>n</sup> e<sup>{\frac{1}{12n}-\frac{1}{360n<sup>3+102n}} and for all n≥3n\ge 3 2πn(ne)<sup>n</sup>e<sup>112n+25n−1.110n<sup>3</sup></sup>≥n!≥2πn(ne)<sup>n</sup>e<sup>112n+25n−0.910n<sup>3.\sqrt{2\pi n}\left(\frac{n}{e}\right)<sup>n</sup> e<sup>{\frac{1}{12n+\frac{2}{5n}-\frac{1.1}{10n<sup>3}}}</sup></sup> \ge n!\ge \sqrt{2\pi n}\left(\frac{n}{e}\right)<sup>n</sup> e<sup>{\frac{1}{12n+\frac{2}{5n}-\frac{0.9}{10n<sup>3}}}.

Citations (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.