• Foundation
  • About 13 min
  • 5 practice questions

Patterns in Pascal's triangle and the row sums

Use the patterns of Pascal's triangle: symmetry, the sum of each row being 2ⁿ, the alternating sum being 0, and building a row from the one above, and apply them to counting subsets.

If something looks wrong, please tell us.

Pascal's triangle is more than a table of coefficients. It is full of patterns that give quick answers, such as the sum of any row without adding it. This lesson collects the patterns you need, explains why each works in terms of the binomial theorem, and ends with one use: counting how many ways there are to choose items from a set.

The first rows

Row nEntries (ⁿC₀, ⁿC₁, …, ⁿCₙ)Sum
011
11, 12
21, 2, 14
31, 3, 3, 18
41, 4, 6, 4, 116
51, 5, 10, 10, 5, 132
61, 6, 15, 20, 15, 6, 164

Four patterns

  • Symmetry. Each row reads the same forwards and backwards, because ⁿCᵣ = ⁿCₙ₋ᵣ.
  • Building rows. Each entry is the sum of the two entries above it (Pascal's rule). Every row begins and ends with 1.
  • Row sum. The entries of row n add up to 2ⁿ. Put a = b = 1 in (a + b)ⁿ: (1 + 1)ⁿ = ⁿC₀ + ⁿC₁ + … + ⁿCₙ = 2ⁿ.
  • Alternating sum. Put a = 1, b = −1: (1 − 1)ⁿ = 0 = ⁿC₀ − ⁿC₁ + ⁿC₂ − … for n ≥ 1. So the entries in even positions add to the same as those in odd positions, each 2ⁿ⁻¹.

The sum of row n is 2ⁿ. The alternating sum of row n is 0, so the even-position entries and odd-position entries each add to 2ⁿ⁻¹.

Worked example 1: building row 7

Row 6 is 1, 6, 15, 20, 15, 6, 1. Add neighbours: 1 + 6 = 7, 6 + 15 = 21, 15 + 20 = 35, 20 + 15 = 35, 15 + 6 = 21, 6 + 1 = 7. With a 1 at each end, row 7 is 1, 7, 21, 35, 35, 21, 7, 1. Its sum is 1 + 7 + 21 + 35 + 35 + 21 + 7 + 1 = 128, which is 2⁷.

Worked example 2: even and odd positions

In row 6, the entries in positions 0, 2, 4, 6 are 1, 15, 15, 1, with sum 32. The entries in positions 1, 3, 5 are 6, 20, 6, with sum 32. Each is 2⁵ = 32, and together they make 64 = 2⁶. This matches the alternating sum: 1 − 6 + 15 − 20 + 15 − 6 + 1 = 0.

Worked example 3: which row?

Which row of Pascal's triangle has entries adding up to 1024? Since 1024 = 2¹⁰, it is row 10. Its second entry is ¹⁰C₁ = 10. Its middle entry is ¹⁰C₅ = 252, because 10 × 9 × 8 × 7 × 6 / 120 = 30240/120 = 252.

Worked example 4: counting subsets

A student can borrow any number of books, including none, from a shelf of 5 different books. How many choices are there? She may take 0 books (⁵C₀ = 1 way), 1 book (5 ways), 2 books (10 ways), 3 books (10 ways), 4 books (5 ways) or all 5 (1 way). The total is 1 + 5 + 10 + 10 + 5 + 1 = 32 = 2⁵. In general a set of n items has 2ⁿ subsets, including the empty one. Excluding the empty choice gives 2ⁿ − 1, here 31.

Key takeaways: rows are symmetric and start and end with 1. Each entry is the sum of the two above. Row n adds up to 2ⁿ, and its even-position and odd-position entries each add up to 2ⁿ⁻¹ when n ≥ 1. A set of n items has 2ⁿ subsets. These facts come straight from putting a = b = 1 or a = 1, b = −1 in the binomial theorem.

Check your understanding

  1. 1. What is the sum of the entries in row 6 of Pascal's triangle?

    1. 36
    2. 32
    3. 128
    4. 64
    Show answer

    Answer: D. The sum of row n is 2ⁿ, so for n = 6 it is 64. Check: 1 + 6 + 15 + 20 + 15 + 6 + 1 = 64.

  2. 2. What is the sum of the entries in row 9?

    1. 81
    2. 512
    3. 256
    4. 1024
    Show answer

    Answer: B. Row 9 adds up to 2⁹ = 512.

  3. 3. What is the value of ⁵C₀ − ⁵C₁ + ⁵C₂ − ⁵C₃ + ⁵C₄ − ⁵C₅?

    1. 1
    2. 32
    3. 0
    4. −1
    Show answer

    Answer: C. This is (1 − 1)⁵ = 0. Directly: 1 − 5 + 10 − 10 + 5 − 1 = 0.

  4. 4. What is the second entry of row 12?

    1. 12
    2. 11
    3. 66
    4. 13
    Show answer

    Answer: A. The second entry of row n is ⁿC₁ = n, so for row 12 it is 12.

  5. 5. How many different subsets, including the empty one, does a set of 5 items have?

    1. 25
    2. 10
    3. 32
    4. 31
    Show answer

    Answer: C. Each subset size contributes ⁵Cᵣ ways, and the total is 2⁵ = 32. (Without the empty set the number is 31.)

Privacy · Terms · Refunds · Delivery