Discrete Probability & Asymptotics

Counting meets chance and growth

• Expected value via indicator variables simplifies many counting arguments.
• Algorithm analysis: worst-case time as a function of input size.
• Stirling's approximation: n! ≈ √(2πn) (n/e)ⁿ for rough magnitude.