Binomial Theorem
The Binomial Theorem provides a formula for expanding (a + b)ⁿ without multiplying it out manually.
Start with the simplest version: this lesson is about Binomial Theorem. If you can explain the core idea to a friend using everyday language, examples, and one clear reason why it matters, you have moved from memorising to understanding.
The Binomial Theorem provides a formula for expanding (a + b)ⁿ without multiplying it out manually. Instead of multiplying (a + b) by itself n times—tediously for large n—the theorem reveals the expansion's pattern through a beautiful combination of chapter-06-permutations-and-combinations and algebra. This chapter shows how the coefficients in the expansion are binomial coefficients, discovered in Pascal's triangle. The theorem is essential for approximations in calculus, probability distributions in statistics, and numerous applications in physics and engineering where powers of binomials arise naturally.
The Pattern: From Small Powers to General Case
Start with small examples and observe the pattern:
(a + b)¹ = a + b
(a + b)² = a² + 2ab + b²
(a + b)³ = a³ + 3a²b + 3ab² + b³
(a + b)⁴ = a⁴ + 4a³b + 6a²b² + 4ab³ + b⁴
Look at the coefficients: 1; 1, 2, 1; 1, 3, 3, 1; 1, 4, 6, 4, 1
These are binomial coefficients! Each row matches C(n,r) values for different r. In (a + b)⁴, the coefficient of a²b² is C(4,2) = 6.
The Binomial Theorem Statement
For any positive integer n:
(a + b)ⁿ = Σ C(n,r) × aⁿ⁻ʳ × bʳ (r from 0 to n)
The Σ notation means "sum all terms." Each term is C(n,r) × aⁿ⁻ʳ × bʳ for r = 0, 1, 2, ..., n.
Breaking this down:
- We have n+1 terms total
- The first term is C(n,0) × aⁿ × b⁰ = aⁿ
- The last term is C(n,n) × a⁰ × bⁿ = bⁿ
- In each term, the exponents of a and b sum to n
For (a + b)⁴ with r = 2: Term = C(4,2) × a⁴⁻² × b² = 6 × a² × b² = 6a²b²
Why the Binomial Coefficients?
The theorem's elegance lies in why binomial coefficients appear. When we expand (a + b)ⁿ, we're choosing n factors and deciding from each whether to take the a or the b.
For (a + b)³ = (a + b)(a + b)(a + b), to get a²b, we must choose a from two factors and b from one. There are C(3,1) = 3 ways to choose which factor contributes b. Each gives the term a²b, and we collect them: 3a²b.
Generally, to get aⁿ⁻ʳbʳ, we choose r factors to contribute b and (n-r) to contribute a. There are C(n,r) ways to make this choice.
General Term and Specific Terms
The general term (or (r+1)th term) in the expansion of (a + b)ⁿ is:
Tᵣ₊₁ = C(n,r) × aⁿ⁻ʳ × bʳ
If you need a specific term, like the 5th term, use r = 4.
Example: Find the 4th term in (2x - 3y)⁶. Here n = 6, a = 2x, b = -3y, and for the 4th term, r = 3.
T₄ = C(6,3) × (2x)⁶⁻³ × (-3y)³ = 20 × (2x)³ × (-3y)³ = 20 × 8x³ × (-27y³) = -4320x³y³
Pascal's Triangle
Pascal's Triangle elegantly displays binomial coefficients:
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
Each entry is the sum of the two above it. The nth row contains coefficients for (a + b)ⁿ.
Binomial Theorem for Negative and Fractional Exponents
The theorem extends beyond positive integer exponents. For negative or fractional n:
(1 + x)ⁿ = 1 + nx + [n(n-1)/2!]x² + [n(n-1)(n-2)/3!]x³ + ...
This infinite series converges for |x| < 1. It's useful for approximations. For example:
(1 + 0.01)⁵ ≈ 1 + 5(0.01) + 10(0.01)² + ... ≈ 1.051 (much easier than calculating directly)
Applications and Numerical Approximations
The Binomial Theorem simplifies evaluations. To calculate (1.02)¹⁰:
Let x = 0.02, so (1 + x)¹⁰ = 1 + 10(0.02) + 45(0.02)² + ... ≈ 1.22 (keeping first few terms)
In probability, the binomial distribution uses binomial coefficients: The probability of exactly r successes in n trials with success probability p is C(n,r) × pʳ × (1-p)ⁿ⁻ʳ.
Key Formulas
- Binomial Theorem: (a + b)ⁿ = Σ C(n,r) × aⁿ⁻ʳ × bʳ
- General Term: Tᵣ₊₁ = C(n,r) × aⁿ⁻ʳ × bʳ
- Middle term (if n is even): T(n/2)+1 with coefficient C(n, n/2)
- Extended form: (1 + x)ⁿ = 1 + nx + [n(n-1)/2!]x² + ...
Socratic Questions
- When you expand (a + b)ⁿ, why does the binomial coefficient C(n,r) appear as the coefficient of aⁿ⁻ʳbʳ? What counting principle connects permutations/combinations to algebra?
- In Pascal's Triangle, each entry equals the sum of two entries above it. What algebraic property of binomial coefficients does this visual pattern represent? Can you prove this relationship algebraically?
- The Binomial Theorem extends to negative exponents, producing infinite series. Why does it only converge for |x| < 1? What breaks down as |x| approaches or exceeds 1?
- To approximate (1.03)⁸ using the Binomial Theorem, you might keep only the first few terms. How can you estimate the error from truncating the series? When is this approximation good enough?
- How is the Binomial Theorem related to the distribution of probabilities in repeated experiments? If you flip a fair coin 10 times, how many ways can you get exactly 3 heads?
