Pascal's Triangle

Pascal's triangle is a triangular array of numbers where each row starts and ends with 1, and every number in between is the sum of the two numbers diagonally above it. It looks simple, but it encodes the coefficients used in the binomial theorem and counts combinations at the same time.

Start row 0 with a single 1. To build the next row, place a 1 at each end, and fill each interior spot with the sum of the two numbers diagonally above it in the previous row. Row 3, for instance, comes from row 2 (1, 2, 1): the interior entries are 1+2=3 and 2+1=3, giving row 3 = 1, 3, 3, 1.

Row n of the triangle gives the coefficients for expanding a binomial raised to the power n. Row 3 (1, 3, 3, 1) is exactly the coefficients in (x + y)³ = x³ + 3x²y + 3xy² + y³. Each entry in row n is also the number of ways to choose k items from n — the same value as a combination, C(n, k).

You don't have to build every row from scratch. The k-th entry (starting from 0) in row n equals C(n, k) = n! ÷ (k!(n−k)!). For row 5, position 2 is C(5,2) = 10, which matches the triangle's row 5: 1, 5, 10, 10, 5, 1.

Related lessons

• Algebra