(x + y)ⁿ = Σ C(n, k) xⁿ⁻ₜ yₐ, summed over k = 0 to n. Each term's coefficient, C(n, k), is the same value counted by combinations — the number of ways to choose k items from n. That coefficient is also entry k of Pascal's triangle row n, so you rarely need to compute C(n, k) from scratch for small n.