WordGPT

Stirling's approximation

A good estimate of a factorial; the relative error shrinks as n grows. History: 1730.

How to work it out

  1. 1

    The statement:

    n!ā‰ˆ2Ļ€n(ne)nn! \approx \sqrt{2\pi n}\left(\frac{n}{e}\right)^n
  2. 2

    A good estimate of a factorial; the relative error shrinks as n grows.

  3. 3

    Below, the numbers in the table are computed by this site from the definition, not copied.

LaTeX source of the formulas on this page
\[ n! \approx \sqrt{2\pi n}\left(\frac{n}{e}\right)^n \]

n! against the estimate (computed)

nn!StirlingRatio
110.922137010.92214
5120118.019170.98349
1036288003598695.60.99170
20243290200817664000024227868000000000000.99584
50ā‰ˆ 64.48 (log10)ā‰ˆ 64.48 (log10)0.99833

Questions

What is the stirling's approximation?

A good estimate of a factorial; the relative error shrinks as n grows.

Who is the Stirling's approximation associated with?

Leonhard Euler.

People

More theorems

    Stirling's approximation: statement, example and proof idea | WordGPT