Elementary Proofs of Some Stirling Bounds
Functional Analysis
2020-01-06 v2 Computational Complexity
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
Keywords
Cite
@article{arxiv.1802.07046,
title = {Elementary Proofs of Some Stirling Bounds},
author = {Nader H. Bshouty and Vivian E. Bshouty-Hurani and George Haddad and Thomas Hashem and Fadi Khoury and Omar Sharafy},
journal= {arXiv preprint arXiv:1802.07046},
year = {2020}
}