01 · Explore
Introduction to Binomial Expansions
A binomial is an algebraic expression containing two terms, such as (a + b). While squares and cubes are simple to calculate, higher powers require a systematic approach.
In earlier classes, we learned identities like (a + b)² = a² + 2ab + b² and (a + b)³ = a³ + 3a²b + 3ab² + b³. These allow us to calculate values like 98² by writing it as (100 - 2)². However, for very high powers like (101)⁶ or (98)⁵, repeated multiplication becomes tedious and prone to error.
The Binomial Theorem provides a general formula to expand (a + b)ⁿ for any positive integer n. By observing the expansions of (a + b) for n = 0, 1, 2, 3, and 4, we notice three key patterns: the number of terms is always (n + 1), the power of the first term 'a' decreases from n to 0, and the power of the second term 'b' increases from 0 to n.
Crucially, in every term of the expansion, the sum of the indices of 'a' and 'b' is always equal to n. For example, in the expansion of (a + b)³, the term 3a²b has indices 2 and 1, which sum to 3.
| Index (n) | Expansion | Number of Terms |
|---|---|---|
| 0 | (a + b)⁰ = 1 | 1 |
| 1 | (a + b)¹ = a + b | 2 |
| 2 | (a + b)² = a² + 2ab + b² | 3 |
| 3 | (a + b)³ = a³ + 3a²b + 3ab² + b³ | 4 |
| 4 | (a + b)⁴ = a⁴ + 4a³b + 6a²b² + 4ab³ + b⁴ | 5 |
Pause & Try
Think it through first. Writing and checking your answer is free with an account.
Question
How many terms are present in the expansion of (x + y)¹⁰?
Sign in to see the answer
Write your own answer and compare it with ours. It’s free.
Sign inNew here? Sign up freeNCERT reference: chapter PDF page 1.
02 · Explore
Pascal's Triangle and Coefficients
The numerical coefficients of binomial expansions follow a unique triangular pattern known as Pascal's Triangle, or Meru Prastara.
When we arrange only the coefficients of the expansions for n = 0, 1, 2, 3, etc., they form a triangle. Each row starts and ends with 1. Every other number in a row is the sum of the two numbers directly above it in the preceding row.
For example, to find the coefficients for n = 2, we look at the row for n = 1 (which is 1, 1). Adding them gives 2, so the row for n = 2 is 1, 2, 1. For n = 3, we add (1+2) and (2+1) to get 1, 3, 3, 1. This continues indefinitely.
While Pascal's triangle is useful for small powers, it becomes cumbersome for large indices like n = 12, as it requires writing all previous rows. To solve this, we use the concept of Combinations (nCr) to calculate any coefficient directly.
Generating Pascal's Triangle Rows
- 1
Index 0
The vertex of the triangle is 1.
- 2
Index 1
Coefficients are 1 and 1.
- 3
Index 2
Middle term is 1+1=2. Row: 1, 2, 1.
- 4
Index 3
Middle terms are 1+2=3 and 2+1=3. Row: 1, 3, 3, 1.
This sequence shows how each row is derived from the sum of adjacent coefficients in the row above.
Pause & Try
Think it through first. Writing and checking your answer is free with an account.
Question
What are the coefficients for the expansion of (a + b)⁵ using Pascal's triangle?
Sign in to see the answer
Write your own answer and compare it with ours. It’s free.
Sign inNew here? Sign up freeNCERT reference: chapter PDF pages 2, 3.
03 · Explore
The Binomial Theorem Formula
The Binomial Theorem for any positive integer n provides a definitive algebraic formula for expansion using combinations.
The theorem states that (a + b)ⁿ = nC₀ aⁿ + nC₁ aⁿ⁻¹b + nC₂ aⁿ⁻²b² + ... + nCₙ₋₁ abⁿ⁻¹ + nCₙ bⁿ. Here, nCr represents the number of ways to choose r items from n, calculated as n! / [r!(n-r)!].
The coefficients nC₀, nC₁, nC₂, ..., nCₙ are called Binomial Coefficients. Note that nC₀ = 1 and nCₙ = 1, which matches the 1s at the start and end of every row in Pascal's triangle.
The theorem can be written concisely using Sigma (Σ) notation: (a + b)ⁿ = Σ (k=0 to n) nCk aⁿ⁻ᵏ bᵏ. This summation captures all (n+1) terms of the expansion.
Expanding with the Formula
(x + 2)⁶
Using n=6, a=x, b=2: Step 1: 6C₀ x⁶ (2)⁰ = 1 . x⁶ . 1 = x⁶ Step 2: 6C₁ x⁵ (2)¹ = 6 . x⁵ . 2 = 12x⁵ Step 3: 6C₂ x⁴ (2)² = 15 . x⁴ . 4 = 60x⁴ Step 4: 6C₃ x³ (2)³ = 20 . x³ . 8 = 160x³ Step 5: 6C₄ x² (2)⁴ = 15 . x² . 16 = 240x² Step 6: 6C₅ x¹ (2)⁵ = 6 . x . 32 = 192x Step 7: 6C₆ x⁰ (2)⁶ = 1 . 1 . 64 = 64 Result: x⁶ + 12x⁵ + 60x⁴ + 160x³ + 240x² + 192x + 64
Pause & Try
Think it through first. Writing and checking your answer is free with an account.
Question
What is the value of the binomial coefficient nCr when r = 0?
Sign in to see the answer
Write your own answer and compare it with ours. It’s free.
Sign inNew here? Sign up freeNCERT reference: chapter PDF pages 4, 5.
04 · Explore
Special Cases and Substitutions
By substituting specific values for 'a' and 'b', we can derive useful variations of the binomial formula.
If we replace 'b' with '-y', the terms in the expansion alternate in sign: (x - y)ⁿ = nC₀ xⁿ - nC₁ xⁿ⁻¹y + nC₂ xⁿ⁻²y² - nC₃ xⁿ⁻³y³ + ... + (-1)ⁿ nCₙ yⁿ. The sign of a term depends on whether the power of 'y' is even or odd.
Another common case is (1 + x)ⁿ. Substituting a = 1 and b = x, we get: (1 + x)ⁿ = nC₀ + nC₁x + nC₂x² + ... + nCₙxⁿ. This is particularly useful for approximations and proving properties of coefficients.
If we set x = 1 in the expansion of (1 + x)ⁿ, we find that 2ⁿ = nC₀ + nC₁ + nC₂ + ... + nCₙ. This proves that the sum of all binomial coefficients for a given n is equal to 2 raised to the power n.
Pause & Try
Think it through first. Writing and checking your answer is free with an account.
Question
What is the sum of the binomial coefficients for n = 4?
Sign in to see the answer
Write your own answer and compare it with ours. It’s free.
Sign inNew here? Sign up freeNCERT reference: chapter PDF pages 5, 6.
05 · Explore
Numerical Applications
The Binomial Theorem is a powerful tool for calculating large powers of numbers and comparing magnitudes without full multiplication.
To compute a number like (98)⁵, we rewrite it as (100 - 2)⁵ and apply the theorem. This breaks a difficult multiplication into a series of simpler additions and subtractions of powers of 100.
The theorem also helps in comparing very large numbers. For instance, to see if (1.01)¹⁰⁰⁰⁰⁰⁰ is larger than 10,000, we expand (1 + 0.01)ⁿ. Even just the first two terms (1 + n . 0.01) give 1 + 10,000 = 10,001, which is already greater than 10,000.
This method is frequently used in finance and physics to estimate values when the second term in the binomial is very small compared to the first.
Computing (98)⁵
(100 - 2)⁵
n=5, a=100, b=2: Term 1: 5C₀(100)⁵ = 10,000,000,000 Term 2: -5C₁(100)⁴(2) = -5(100,000,000)(2) = -1,000,000,000 Term 3: 5C₂(100)³(2)² = 10(1,000,000)(4) = 40,000,000 Term 4: -5C₃(100)²(2)³ = -10(10,000)(8) = -800,000 Term 5: 5C₄(100)(2)⁴ = 5(100)(16) = 8,000 Term 6: -5C₅(2)⁵ = -32 Calculation: 10,000,000,000 - 1,000,000,000 + 40,000,000 - 800,000 + 8,000 - 32 = 9,039,207,968.
Pause & Try
Think it through first. Writing and checking your answer is free with an account.
Question
Which is larger: (1.1)¹⁰⁰⁰⁰ or 1000?
Sign in to see the answer
Write your own answer and compare it with ours. It’s free.
Sign inNew here? Sign up freeNCERT reference: chapter PDF pages 6, 7.
06 · Explore
Divisibility and Remainders
Binomial expansion can prove that certain algebraic expressions are always divisible by specific integers.
To prove that an expression like 6ⁿ - 5n leaves a remainder of 1 when divided by 25, we can write 6ⁿ as (1 + 5)ⁿ. Expanding this gives: (1 + 5)ⁿ = 1 + n(5) + nC₂(5)² + nC₃(5)³ + ...
Subtracting 5n from both sides, we get: 6ⁿ - 5n = 1 + 25(nC₂ + 5 . nC₃ + ...). Since the term in the bracket is an integer, the expression is of the form 25k + 1.
Similarly, to show 9ⁿ⁺¹ – 8n – 9 is divisible by 64, we expand 9ⁿ⁺¹ as (1 + 8)ⁿ⁺¹. This results in 1 + (n+1)8 + (n+1)C₂ 8² + ... which simplifies to 1 + 8n + 8 + 64k. Subtracting 8n and 9 leaves 64k, proving divisibility.
Proving Divisibility by 64
9ⁿ⁺¹ – 8n – 9 = 64k
Step 1: Write 9ⁿ⁺¹ as (1 + 8)ⁿ⁺¹. Step 2: Expand: (n+1)C₀ + (n+1)C₁(8) + (n+1)C₂(8)² + ... Step 3: Simplify: 1 + (n+1)8 + 64[(n+1)C₂ + (n+1)C₃(8) + ...] Step 4: 1 + 8n + 8 + 64k = 9 + 8n + 64k. Step 5: Subtracting 8n and 9 from the expression leaves 64k, which is divisible by 64.
Pause & Try
Think it through first. Writing and checking your answer is free with an account.
Question
If an expression is written as 64k + 1, what is the remainder when divided by 64?
Sign in to see the answer
Write your own answer and compare it with ours. It’s free.
Sign inNew here? Sign up freeNCERT reference: chapter PDF pages 7, 8.
07 · Explore
Proof by Mathematical Induction
The validity of the Binomial Theorem for all positive integers n is established using the Principle of Mathematical Induction.
First, we test the base case n = 1. The formula gives (a + b)¹ = 1C₀ a¹ + 1C₁ b¹ = a + b, which is true. Next, we assume the theorem holds for a positive integer k, such that (a + b)ᵏ = Σ (r=0 to k) kCr aᵏ⁻ʳ bʳ.
To prove it for n = k + 1, we multiply the expansion of (a + b)ᵏ by (a + b). This involves distributing 'a' and 'b' across all terms and then grouping like terms (terms with the same powers of a and b).
The proof relies on the identity kCr + kCr₋₁ = k+1Cr. By applying this identity to the grouped coefficients, we arrive at the expansion for (a + b)ᵏ⁺¹, completing the inductive step. Thus, the theorem is true for all natural numbers n.
| Step | Action | Purpose |
|---|---|---|
| Base Case | Verify for n = 1 | Shows the formula works for the simplest case. |
| Assumption | Assume true for n = k | Sets the hypothesis for the inductive step. |
| Inductive Step | Multiply by (a + b) | Derives the formula for the next integer. |
| Identity | Use kCr + kCr-1 = k+1Cr | Combines terms to match the binomial form. |
| Conclusion | Apply Induction Principle | Confirms truth for all positive integers n. |
Pause & Try
Think it through first. Writing and checking your answer is free with an account.
Question
Which combination identity is crucial for the inductive proof of the Binomial Theorem?
Sign in to see the answer
Write your own answer and compare it with ours. It’s free.
Sign inNew here? Sign up freeNCERT reference: chapter PDF page 4.