Elementary Proofs of Some Stirling Bounds
Nader H. Bshouty, Vivian E. Bshouty-Hurani, George Haddad and, Thomas Hashem, Fadi Khoury, Omar Sharafy

TL;DR
This paper provides elementary proofs of improved and new precise bounds for Stirling's approximation of factorials, enhancing accuracy for all sufficiently large n with explicit exponential correction terms.
Contribution
It introduces elementary proofs that tighten existing Stirling bounds and presents new bounds with explicit correction factors for large n.
Findings
Improved Stirling bounds for n ≥ 8.
New precise bounds for n ≥ 3.
Explicit exponential correction terms enhance approximation accuracy.
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 and for all
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Inequalities and Applications · Advanced Mathematical Identities · Functional Equations Stability Results
