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.