Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Sterling is not only an approximation, but gives rigorous bounds: $n!=(n/e)^n\sqrt{2\pi n} e^{\theta/(12 n}$ for some $\theta\in[0,1]$. So this argument gives a proof for all but a few very small cases.
