- Foundation
- About 18 min
- 5 practice questions
The binomial theorem and its proof
Write Pascal's triangle with nCr entries, state the binomial theorem for a positive integer n in full and in Σ notation, follow its proof by mathematical induction, and use it to expand powers.
If something looks wrong, please tell us.
By the end of this lesson you can
- Write the entries of Pascal's triangle as nC0, nC1, ..., nCn.
- State the binomial theorem and write it with Σ notation.
- Follow the proof by mathematical induction, step by step.
- Use the theorem to expand (x + 3)⁵ and to find particular coefficients.
In Chapter 6 you met nCr, the number of ways of choosing r objects from n. These are exactly the numbers in Pascal's triangle. Writing them this way lets us write down any row directly, and so expand any positive integer power of a binomial without building the whole triangle.
Pascal's triangle with combinations
Row n of Pascal's triangle is nC0, nC1, nC2, ..., nCn. For example, row 4 is 4C0 = 1, 4C1 = 4, 4C2 = 6, 4C3 = 4, 4C4 = 1. The rule each entry is the sum of the two above it is just Pascal's rule from Chapter 6, nCr + nC(r − 1) = (n + 1)Cr, and the symmetry of each row is nCr = nC(n − r).
The binomial theorem
For any positive integer n: (a + b)ⁿ = nC0 aⁿ + nC1 aⁿ⁻¹b + nC2 aⁿ⁻²b² + ... + nC(n − 1) abⁿ⁻¹ + nCn bⁿ. In Σ notation, (a + b)ⁿ = Σ (k = 0 to n) nCk aⁿ⁻ᵏ bᵏ.
The numbers nCk in the theorem are called binomial coefficients. In the term nCk aⁿ⁻ᵏ bᵏ, the power of b is k and the power of a is n − k, so the powers add up to n, matching the patterns of lesson 1. Here a⁰ and b⁰ are taken as 1.
Proof by mathematical induction
Mathematical induction proves a statement P(n) for every positive integer n in two steps: show that P(1) is true, and show that whenever P(k) is true, P(k + 1) is also true. Then P(1) gives P(2), P(2) gives P(3), and so on for ever.
Structure of the proof
- Base step Check P(1): (a + b)¹ = 1C0 a + 1C1 b = a + b.
- Assume P(k) (a + b)ᵏ = kC0 aᵏ + kC1 aᵏ⁻¹b + ... + kCk bᵏ.
- Multiply by (a + b) (a + b)ᵏ⁺¹ = (a + b)(a + b)ᵏ; multiply out.
- Group like terms Pair kCr with kC(r − 1).
- Use Pascal's rule kCr + kC(r − 1) = (k + 1)Cr gives P(k + 1).
- Base step. For n = 1: 1C0 a + 1C1 b = a + b = (a + b)¹. So P(1) is true.
- Inductive step. Assume (a + b)ᵏ = kC0 aᵏ + kC1 aᵏ⁻¹b + kC2 aᵏ⁻²b² + ... + kCk bᵏ for some positive integer k.
- Multiply both sides by (a + b). Multiplying by a gives kC0 aᵏ⁺¹ + kC1 aᵏb + kC2 aᵏ⁻¹b² + ... + kCk abᵏ. Multiplying by b gives kC0 aᵏb + kC1 aᵏ⁻¹b² + ... + kC(k − 1) abᵏ + kCk bᵏ⁺¹.
- Add and group terms with the same powers: (a + b)ᵏ⁺¹ = kC0 aᵏ⁺¹ + (kC1 + kC0) aᵏb + (kC2 + kC1) aᵏ⁻¹b² + ... + (kCk + kC(k − 1)) abᵏ + kCk bᵏ⁺¹.
- Use kC0 = 1 = (k + 1)C0, kCk = 1 = (k + 1)C(k + 1) and Pascal's rule kCr + kC(r − 1) = (k + 1)Cr. The right side becomes (k + 1)C0 aᵏ⁺¹ + (k + 1)C1 aᵏb + ... + (k + 1)C(k + 1) bᵏ⁺¹, which is P(k + 1).
- So P(k + 1) is true whenever P(k) is true. By the principle of mathematical induction, the theorem holds for every positive integer n.
Worked example 1: (x + 3)⁵
Working: (x + 3)⁵ = 5C0 x⁵ + 5C1 x⁴(3) + 5C2 x³(3²) + 5C3 x²(3³) + 5C4 x(3⁴) + 5C5 (3⁵) = x⁵ + 5(3)x⁴ + 10(9)x³ + 10(27)x² + 5(81)x + 243 = x⁵ + 15x⁴ + 90x³ + 270x² + 405x + 243. Check with x = 1: 1 + 15 + 90 + 270 + 405 + 243 = 1024 = 4⁵.
Worked example 2: writing a row directly
The coefficients of (a + b)⁷ are 7C0, 7C1, ..., 7C7, that is 1, 7, 21, 35, 35, 21, 7, 1. So (a + b)⁷ = a⁷ + 7a⁶b + 21a⁵b² + 35a⁴b³ + 35a³b⁴ + 21a²b⁵ + 7ab⁶ + b⁷. Only 7C1, 7C2 and 7C3 had to be worked out; the rest follow from 7Cr = 7C(7 − r).
Worked example 3: one coefficient
Find the coefficient of x³ in (x + 2)⁷. Working: the term with x³ has a = x to the power 3, so b = 2 has power 7 − 3 = 4. That term is 7C4 x³ (2⁴) = 35 × 16 x³ = 560x³. The coefficient is 560.
| Term number | Term in (a + b)ⁿ | Power of a | Power of b |
|---|---|---|---|
| 1st | nC0 aⁿ | n | 0 |
| 2nd | nC1 aⁿ⁻¹ b | n − 1 | 1 |
| 3rd | nC2 aⁿ⁻² b² | n − 2 | 2 |
| (n + 1)th | nCn bⁿ | 0 | n |
Key takeaways: the coefficients of (a + b)ⁿ are nC0, nC1, ..., nCn. The binomial theorem writes (a + b)ⁿ = Σ nCk aⁿ⁻ᵏ bᵏ. It is proved by induction, using Pascal's rule to combine terms. To find one coefficient, match the powers first and then compute only that term.
Check your understanding
-
1. What is the coefficient of a⁴b² in (a + b)⁶?
- 6
- 20
- 15
- 30
Show answer
Answer: C. The term with b² is 6C2 a⁴b². 6C2 = (6 × 5)/2 = 15.
-
2. What is the coefficient of x² in (x + 2)⁴?
- 24
- 12
- 6
- 32
Show answer
Answer: A. The x² term has 2 raised to the power 4 − 2 = 2: 4C2 x² (2²) = 6 × 4 x² = 24x². So the coefficient is 24.
-
3. How many terms are there in the expansion of (2x + 3y)¹²?
- 12
- 24
- 11
- 13
Show answer
Answer: D. A binomial raised to the power n has n + 1 terms, so (2x + 3y)¹² has 13 terms.
-
4. Which is the third term in the expansion of (a + b)ⁿ?
- nC3 aⁿ⁻³ b³
- nC2 aⁿ⁻² b²
- nC2 aⁿ b²
- nC1 aⁿ⁻¹ b
Show answer
Answer: B. Terms start from nC0 aⁿ, so the third term has k = 2: nC2 aⁿ⁻² b². The power of a is n − 2 so that the powers add up to n.
-
5. Assertion (A): In the expansion of (a + b)ⁿ, coefficients equidistant from the beginning and the end are equal. Reason (R): nCr = nC(n − r).
- Both A and R are true, and R is the correct explanation of A.
- Both A and R are true, but R is not the correct explanation of A.
- A is true, but R is false.
- A is false, but R is true.
Show answer
Answer: A. The (r + 1)th coefficient from the start is nCr and the (r + 1)th from the end is nC(n − r). R says these are equal, which is exactly A.
Sign in to keep track of the lessons you finish.