Math 2.0

statement theorem

Stirling's formula

Statement

As n→∞n \to \infty, n!∼2πn(ne)n.n! \sim \sqrt{2 \pi n} \left( \frac{n}{e} \right)^n. That is, the ratio n!2πn (n/e)n\frac{n!}{\sqrt{2 \pi n} \, (n/e)^n} tends to 11.

Remarks

The relation ∼\sim is asymptotic equivalence. The absolute error grows, but the relative error tends to 00. Comparing ln⁡n!=∑k≤nln⁡k\ln n! = \sum_{k \le n} \ln k with ∫1nln⁡x dx\int_1^n \ln x \, dx gives the form n!∼Cn(n/e)nn! \sim C \sqrt{n} (n/e)^n. The Wallis product gives C=2πC = \sqrt{2\pi}. A sharper form is n!=2πn(n/e)n(1+112n+O(n−2))n! = \sqrt{2 \pi n} (n/e)^n \big(1 + \frac{1}{12 n} + O(n^{-2})\big). Mathlib states the limit as Stirling.tendsto_stirlingSeq_sqrt_pi.

History

Abraham de Moivre first stated a less precise form of the result. In 1730, James Stirling showed that the constant is 2π\sqrt{2\pi}.

Explanations

L1 human

Stirling's formula gives the size of n!n! for large nn. For example, it gives 10!≈3.599×10610! \approx 3.599 \times 10^6, while 10!=362880010! = 3628800.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Stirling%27s_approximation, Derivation