Pascal's Triangle and Combinatorial Coefficients Structure

A 10-slide presentation deck walking through the formal construction of Pascal's Triangle, its recursive rule $P(n, k) = P(n-1, k-1) + P(n-1, k)$, its connection to combinations via binomial coefficients $$\binom{n}{k}$$, and applications to binomial expansion and probability.

Lara from Teachy