Use Pascal's Triangle to Expand the Binomial: Easy Guide

To use Pascal’s Triangle to expand the binomial (a + b)ⁿ, write row n of the triangle — where the top “1” is row 0 — and use those numbers as the coefficients, then attach descending powers of a and ascending powers of b to each term. Pascal’s Triangle is a triangular array of numbers in which every entry is the sum of the two entries directly above it. Each row lists the binomial coefficients for the expansion of (a + b) raised to that row’s power. For example, row 4 is 1, 4, 6, 4, 1, so (a + b)⁴ expands to a⁴ + 4a³b + 6a²b² + 4ab³ + b⁴.
Pascal’s Triangle and Binomials
Pascal’s Triangle starts with a single 1 at the top. Each row begins and ends with 1, and every interior number is the sum of the two numbers above it. So the rows read:
- Row 0: 1
- Row 1: 1, 1
- Row 2: 1, 2, 1
- Row 3: 1, 3, 3, 1
- Row 4: 1, 4, 6, 4, 1
- Row 5: 1, 5, 10, 10, 5, 1
Those numbers are exactly the binomial coefficients, the values that appear in the Binomial Theorem. The theorem states that (a + b)ⁿ equals the sum of terms of the form C(n, k)·aⁿ⁻ᵏ·bᵏ, where C(n, k) is a binomial coefficient. Row n of Pascal’s Triangle gives every C(n, k) for that n in order, which is why the triangle is a shortcut: you read the coefficients instead of computing combinations one by one. If you want to see the underlying combination formula, Khan Academy walks through it step by step, while Wolfram MathWorld catalogs the triangle’s many number patterns.
Two structural facts make the mapping reliable. First, row n has exactly n + 1 entries, matching the n + 1 terms in the expansion. Second, the rows are symmetric, which mirrors the fact that C(n, k) = C(n, n − k).
Read the Coefficients
Matching the row to the exponent is the one step people get wrong, so make it mechanical. Count the rows from the single top 1, and call that top row 0. The exponent you are expanding tells you which row to read.
| Exponent n | Row of Pascal’s Triangle |
|---|---|
| 0 | 1 |
| 1 | 1, 1 |
| 2 | 1, 2, 1 |
| 3 | 1, 3, 3, 1 |
| 4 | 1, 4, 6, 4, 1 |
| 5 | 1, 5, 10, 10, 5, 1 |
Once you have the row, the coefficients go in order from left to right across your terms. The first coefficient multiplies the first term, the second coefficient multiplies the second term, and so on. If the row has five numbers, your expansion has five terms.
Expand Step-by-Step
Every term follows the same skeleton. The powers of the first part of the binomial count down from n to 0, while the powers of the second part count up from 0 to n. In each term the two exponents always add to n.
Start with the first term as aⁿ, then for each following term decrease the a-exponent by 1 and increase the b-exponent by 1. For (a + b)⁴ that power pattern is a⁴, a³b, a²b², ab³, b⁴ — the exponents in every term sum to 4. Now slide the coefficients from row 4 — 1, 4, 6, 4, 1 — in front of those terms in order. That gives a⁴ + 4a³b + 6a²b² + 4ab³ + b⁴.
One worked example in full
Expand (x + 3)³. The exponent is 3, so use row 3: 1, 3, 3, 1. Build the power pattern for a = x and b = 3: x³, x²·3, x·3², 3³. Apply the coefficients: 1·x³ + 3·(x²·3) + 3·(x·9) + 1·27. Multiply out: x³ + 9x² + 27x + 27. Check it by plugging x = 1 into both sides: (1 + 3)³ = 64, and 1 + 9 + 27 + 27 = 64. The expansion is correct.
A few practical notes: parentheses matter when the second term is negative or when either part is itself a product like 2x; raise each factor inside the parentheses to the right power before multiplying by the coefficient. Keep the coefficients and the powers separate in your head — the triangle only supplies the numbers in front, never the exponents.
Key Takeaways
- Row n of Pascal’s Triangle supplies the coefficients for (a + b)ⁿ; the top 1 is row 0.
- Each row has n + 1 entries, so the expansion always has n + 1 terms.
- In every term the two exponents add to n: a’s power counts down, b’s power counts up.
- Include the sign of the second term inside parentheses, so odd powers of a negative stay negative.
- Check your work two ways: substitute x = 1 into both sides, or confirm the coefficients sum to 2ⁿ.