Combinatorics Behind the Gaussian
Central Question
How can counting discrete paths reveal the bell-shaped profile of aggregate randomness?
Why This Matters
Binomial coefficients turn a probabilistic limit into a counting problem and show how a smooth shape can emerge from discrete combinatorics.
Learning Prompt
Explore why the rows of Pascal's triangle, after probability normalization and suitable rescaling, begin to resemble a Gaussian. Start from counting coin-toss sequences and derive the binomial distribution. Make me locate its center, predict its width and explain why raw binomial coefficients alone are not a probability density. Use ratios of neighbouring coefficients or Stirling's approximation to expose the quadratic behaviour of the logarithm near the peak. Connect this local calculation with the central limit theorem, and distinguish a useful heuristic from a uniform or local limit theorem.