Richard Feynman • 3/6/2025

Approximating Stirling’s Approximation

Read Original

This article delves into the historical development of Stirling's approximation (n! ≈ √(2πn)(n/e)^n). It reconstructs the plausible, intuitive reasoning early mathematicians like de Moivre and Stirling might have used, focusing on approximating log(n!) as an integral and using elementary calculus rather than providing a formal proof.

0 comments
#mathematics #Factorial #Approximation
Approximating Stirling’s Approximation

Comments

No comments yet

Be the first to share your thoughts!

Browser Extension

Get instant access to AllDevBlogs from your browser

Top of the Week

1
The Beautiful Web
Jens Oliver Meiert • 2 votes
2
When your coding agent doesn’t understand your project, you’ll get junk
Benjamin Cane • 1 votes
3
LLM Use in the Python Source Code
Miguel Grinberg • 1 votes
4
Wagon’s algorithm in Python
John D. Cook • 1 votes
5
An example conversation with Claude Code
Dumm Zeuch • 1 votes