#distro

Exploring the factorial function and determining the first $n$ such that $n!$ exceeds the maximum size of an unsigned integer, for various bitwidths. We’ll take a look at Stirling’s approximation and the Lambert W function.