Sign inSign in
ConceptMathematics

Stirling's approximation

An approximation for factorials used to find the asymptotically dominating term of n!n!.
as Erik Demaine defines itMITThe wording closest to all 4 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

3

Each in their own terms, from the easiest level.

  • Ankur Moitra

    MIT · Undergraduate

    An approximation for factorials used to estimate large factorials and binomial coefficients.
    • 52:05Data Compression and Shannon’s Noiseless Coding Theorem
    • 37:16Transmitting Information Reliably over a Noisy Channel & Shannon’s Noisy Coding Theorem
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    An asymptotic formula for factorials, n! ∼ √(2π n) (n/e)ⁿ.
    • 32:25Binomial Coefficients Asymptotics

Lectures that assume it

1

Connections

12

The lectures that define it or assume it, and the concepts next to it.

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.