Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Factorial Asymptotics, Stirling's Formula - Lecture 3b of CS Theory Toolkit

Ryan O'Donnell via YouTube

Overview

Explore the asymptotics of n! and delve into Stirling's Formula in this graduate-level lecture from Carnegie Mellon University's "CS Theory Toolkit" course. Learn how to prove most of Stirling's Formula and understand its final version. Gain insights into essential math and computer science fundamentals for theoretical computer science research. Utilize resources like "Asymptopia" by Joel Spencer, "Concrete Mathematics" by Graham-Knuth-Patashnik, and "Asymptotic Methods in Analysis" by Dick de Bruijn to enhance your understanding of factorial asymptotics.

Syllabus

Factorials
Adhoc Bound
F of N
Integral Trick
Calculus

Taught by

Ryan O'Donnell

Reviews

Start your review of Factorial Asymptotics, Stirling's Formula - Lecture 3b of CS Theory Toolkit

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.