Proof without words: an upper bound for n !
Abstract
Stirling's approximation is an asymptotic approximation for factorials. It is expressed mathematically as n!≈2πn⋅(n/e)n. In [1] (problem 20, pp. 200), there is a simple computation that yields a go...
Fields of Study & Subjects
Advanced Combinatorial Mathematics
semigroups and automata theory
History and Theory of Mathematics
Publication details
- Journal / source
- The Mathematical Gazette
- Publisher
- Informa UK Limited
- Pages
- 1–2
- Publication date
- 21 January 2026
- Language
- EN