YoVDO

Two Nice Approximations for n! - Factorial Calculation Methods

Offered By: Michael Penn via YouTube

Tags

Mathematical Analysis Courses Combinatorics Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore two useful approximations for calculating factorials in this informative mathematics video. Learn about Stirling's approximation and the Ramanujan approximation for n!, understanding their derivations and applications. Discover how these formulas provide accurate estimates for large factorials, which are crucial in various fields of mathematics and science. Gain insights into the mathematical reasoning behind these approximations and see how they compare in terms of accuracy and computational efficiency.

Syllabus

Two nice approximations for n!


Taught by

Michael Penn

Related Courses

Analytic Combinatorics, Part I
Princeton University via Coursera
Analytic Combinatorics, Part II
Princeton University via Coursera
Analytic Combinatorics
Princeton University via Coursera
Principles of Computing (Part 1)
Rice University via Coursera
Combinatorics and Probability
Moscow Institute of Physics and Technology via Coursera