Revision notes

Chapter 7 Binomial Theorem: Foundation

The key points, rules to remember, tables and diagrams from all 5 lessons, on one page for quick revision. To keep a copy, use your browser's Print and choose "Save as PDF".

Lesson 1

Patterns in (a + b)ⁿ and Pascal's triangle

Pascal's triangle up to index 7
Index nRow of coefficients
01
11 1
21 2 1
31 3 3 1
41 4 6 4 1
51 5 10 10 5 1
61 6 15 20 15 6 1
71 7 21 35 35 21 7 1

Making the next row

  1. Start with 1 Every row begins with 1.
  2. Add neighbouring pairs Each new entry is the sum of the two above it.
  3. End with 1 Every row ends with 1.
  4. Check the count Row n has n + 1 numbers, and they add up to 2ⁿ.

In (a + b)ⁿ there are n + 1 terms; the power of a falls from n to 0 while the power of b rises from 0 to n; in every term the powers add up to n.

— Three patterns

Key takeaways: (a + b)ⁿ has n + 1 terms, the powers of a fall and the powers of b rise, and the powers in each term add up to n. In Pascal's triangle every entry is the sum of the two above it, each row is symmetric, and row n adds up to 2ⁿ. Substitute whole terms, with their signs and coefficients, into the pattern.

Read the full lesson

Lesson 2

The binomial theorem and its proof

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ᵏ.

— Binomial theorem

Structure of the proof

  1. Base step Check P(1): (a + b)¹ = 1C0 a + 1C1 b = a + b.
  2. Assume P(k) (a + b)ᵏ = kC0 aᵏ + kC1 aᵏ⁻¹b + ... + kCk bᵏ.
  3. Multiply by (a + b) (a + b)ᵏ⁺¹ = (a + b)(a + b)ᵏ; multiply out.
  4. Group like terms Pair kCr with kC(r − 1).
  5. Use Pascal's rule kCr + kC(r − 1) = (k + 1)Cr gives P(k + 1).
Reading off the terms
Term numberTerm in (a + b)ⁿPower of aPower of b
1stnC0 aⁿn0
2ndnC1 aⁿ⁻¹ bn − 11
3rdnC2 aⁿ⁻² b²n − 22
(n + 1)thnCn bⁿ0n

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.

Read the full lesson

Lesson 3

Expanding with negative terms, fractions and special forms

(x − y)ⁿ = Σ (−1)ᵏ nCk xⁿ⁻ᵏ yᵏ: terms with odd powers of y are negative. (1 + x)ⁿ = nC0 + nC1 x + ... + nCn xⁿ.

— Special forms

(a + b)ⁿ ± (a − b)ⁿ

  • Sum (a + b)ⁿ + (a − b)ⁿ
    • Odd powers of b cancel
    • Even powers of b doubled
    • n = 4: 2(a⁴ + 6a²b² + b⁴)
  • Difference (a + b)ⁿ − (a − b)ⁿ
    • Even powers of b cancel
    • Odd powers of b doubled
    • n = 4: 8a³b + 8ab³

Key takeaways: substitute the whole second term, with its sign, into the binomial theorem; a minus sign makes the terms alternate. Simplify powers of x by adding or subtracting exponents. In (a + b)ⁿ ± (a − b)ⁿ, half of the terms cancel, which makes surd expressions quick to evaluate.

Read the full lesson

Lesson 4

Using the binomial theorem with numbers: powers, comparisons and approximations

Evaluating a power by the binomial theorem

  1. Split the base Use a round number: 102 = 100 + 2, 97 = 100 − 3.
  2. Expand Use the row of Pascal's triangle or nCr.
  3. Work out each term Powers of 10 are just zeros.
  4. Add with signs Line up the digits carefully.

For x > 0 and n ≥ 2: (1 + x)ⁿ > 1 + nx, since all the other terms are positive.

— A useful inequality
How good are the approximations?
ExpressionTwo termsThree termsExact
(1.02)⁶1.121.1261.12616 (approx.)
(0.98)⁴0.920.92240.92236816

Key takeaways: split a base into a round number plus or minus a small number, then expand. For x > 0, (1 + x)ⁿ > 1 + nx, which proves that some powers are large without calculating them. For small x, keep the first two or three terms to approximate (1 ± x)ⁿ.

Read the full lesson

Lesson 5

Sums of binomial coefficients and divisibility

nC0 + nC1 + ... + nCn = 2ⁿ; nC0 − nC1 + nC2 − ... = 0; nC0 + nC2 + nC4 + ... = nC1 + nC3 + ... = 2ⁿ⁻¹.

— Sums of binomial coefficients

Proving divisibility with the binomial theorem

  1. Write the base as 1 + m For 7ⁿ use 7 = 1 + 6.
  2. Expand (1 + m)ⁿ 1 + nm + nC2 m² + nC3 m³ + ...
  3. Move the first terms Subtract the terms named in the question.
  4. Factor out m² What is left is m² × (a whole number).

Key takeaways: put x = 1 and x = −1 in (1 + x)ⁿ to get 2ⁿ and 0 as sums of binomial coefficients; put each variable equal to 1 to add the coefficients of any expansion. For divisibility and remainders, write the base as 1 plus a multiple (or a multiple plus 1), expand, and factor out what is common.

Read the full lesson

Privacy · Terms · Refunds · Delivery