
arXiv: 0711.4412
Stirling's formula, the asymptotic expansion of $n!$ for $n$ large, or of $Γ(z)$ for $z\to \infty$, is derived directly from the recursion equation $Γ(z+1) =z Γ(s)$ and the normalization condition $Γ({1/2}) =\sqrtπ$.
4 pages; omitted second author added
33B15; 11B37, FOS: Mathematics, Mathematics - Combinatorics, 33B15, 11B37, Combinatorics (math.CO)
33B15; 11B37, FOS: Mathematics, Mathematics - Combinatorics, 33B15, 11B37, Combinatorics (math.CO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
