The **Binomial Theorem** is a fundamental mathematical principle that provides a formula for expanding expressions of the form **(a + b)ⁿ** without repeated multiplication. In earlier classes, you learned to expand binomials like (a + b)² and (a + b)³ manually. However, for higher powers such as (98)⁵ or (1.01)¹⁰⁰⁰⁰⁰⁰, direct multiplication becomes extremely tedious.
The theorem overcomes this difficulty by providing a systematic algebraic expansion that is computationally efficient and works for any positive integer n.
**Why is it important?**
Before stating the formal theorem, observe the patterns in basic binomial expansions:
**Key Observations:**
1. **Number of Terms:** The expansion of (a + b)ⁿ contains exactly **(n + 1)** terms. For example, (a + b)² has 3 terms, (a + b)³ has 4 terms.
2. **Powers Pattern:**
3. **Coefficients Pattern:** The coefficients follow a specific numerical arrangement: 1, 1; 1, 2, 1; 1, 3, 3, 1; 1, 4, 6, 4, 1, and so on.
**Pascal's Triangle** is a triangular array of numbers where each number is the sum of the two numbers directly above it. Named after French mathematician Blaise Pascal (1623-1662), it was also known as **Meru-Prastara** (the mountain staircase) in ancient Indian mathematics as documented by Pingla.
**Structure of Pascal's Triangle:**
```
n = 0: 1
n = 1: 1 1
n = 2: 1 2 1
n = 3: 1 3 3 1
n = 4: 1 4 6 4 1
n = 5: 1 5 10 10 5 1
```
**Properties:**
**Example:** For expansion of (2x + 3y)⁵, use row 5: coefficients are 1, 5, 10, 10, 5, 1.
(2x + 3y)⁵ = 1·(2x)⁵ + 5·(2x)⁴(3y) + 10·(2x)³(3y)² + 10·(2x)²(3y)³ + 5·(2x)(3y)⁴ + 1·(3y)⁵
= 32x⁵ + 240x⁴y + 720x³y² + 1080x²y³ + 810xy⁴ + 243y⁵
**Limitation:** For large indices (like n = 50), constructing Pascal's triangle becomes impractical, leading to the need for a general formula.
The entries in Pascal's triangle can be expressed using the **combination formula**. The number in row n, position r is **ⁿCᵣ**, where:
**ⁿCᵣ = n! / [r!(n-r)!]**, with conditions: 0 ≤ r ≤ n, and ⁿC₀ = 1 = ⁿCₙ
Pascal's triangle becomes:
```
n = 0: ⁰C₀
n = 1: ¹C₀ ¹C₁
n = 2: ²C₀ ²C₁ ²C₂
n = 3: ³C₀ ³C₁ ³C₂ ³C₃
```
This reformulation eliminates the need to write all previous rows—we can directly calculate any coefficient using the combination formula.
**Statement:** For any positive integer n and variables a and b:
**(a + b)ⁿ = ⁿC₀aⁿ + ⁿC₁aⁿ⁻¹b + ⁿC₂aⁿ⁻²b² + ... + ⁿCᵣaⁿ⁻ʳbʳ + ... + ⁿCₙbⁿ**
Or in **summation notation:**
**(a + b)ⁿ = Σ(r=0 to n) ⁿCᵣ aⁿ⁻ʳ bʳ**
**Proof by Mathematical Induction:**
**Base Case:** For n = 1:
(a + b)¹ = ¹C₀a¹ + ¹C₁b¹ = a + b ✓
**Inductive Hypothesis:** Assume P(k) is true for some positive integer k:
(a + b)ᵏ = ᵏC₀aᵏ + ᵏC₁aᵏ⁻¹b + ᵏC₂aᵏ⁻²b² + ... + ᵏCₖbᵏ
**Inductive Step:** Prove P(k+1) is true:
(a + b)ᵏ⁺¹ = (a + b)(a + b)ᵏ
= (a + b)[ᵏC₀aᵏ + ᵏC₁aᵏ⁻¹b + ... + ᵏCₖbᵏ]
= a[ᵏC₀aᵏ + ᵏC₁aᵏ⁻¹b + ...] + b[ᵏC₀aᵏ + ᵏC₁aᵏ⁻¹b + ...]
= ᵏC₀aᵏ⁺¹ + ᵏC₁aᵏb + ... + ᵏC₀aᵏb + ᵏC₁aᵏ⁻¹b² + ... + ᵏCₖbᵏ⁺¹
Grouping like terms:
= ᵏC₀aᵏ⁺¹ + (ᵏC₁ + ᵏC₀)aᵏb + (ᵏC₂ + ᵏC₁)aᵏ⁻¹b² + ... + ᵏCₖbᵏ⁺¹
Using the property **ᵏCᵣ + ᵏCᵣ₋₁ = ᵏ⁺¹Cᵣ**:
= ᵏ⁺¹C₀aᵏ⁺¹ + ᵏ⁺¹C₁aᵏb + ᵏ⁺¹C₂aᵏ⁻¹b² + ... + ᵏ⁺¹Cₖ₊₁bᵏ⁺¹ ✓
By principle of mathematical induction, the theorem holds for all positive integers n.
**Worked Example:**
Expand (x + 2)⁶:
(x + 2)⁶ = ⁶C₀x⁶ + ⁶C₁x⁵(2) + ⁶C₂x⁴(4) + ⁶C₃x³(8) + ⁶C₄x²(16) + ⁶C₅x(32) + ⁶C₆(64)
= 1·x⁶ + 6·x⁵·2 + 15·x⁴·4 + 20·x³·8 + 15·x²·16 + 6·x·32 + 1·64
= **x⁶ + 12x⁵ + 60x⁴ + 160x³ + 240x² + 192x + 64**
1. **Notation:** The general term is written as ⁿCᵣ aⁿ⁻ʳ bʳ, where r varies from 0 to n.
2. **Binomial Coefficients:** The numbers ⁿCᵣ are called **binomial coefficients**.
3. **Number of Terms:** There are always **(n + 1)** terms in the expansion.
4. **Index Decrease/Increase:** The exponent of 'a' starts at n and decreases by 1 each term; the exponent of 'b' starts at 0 and increases by 1 each term.
5. **Sum of Indices:** In every term, the sum of exponents of a and b equals n exactly.
Taking a = x and b = -y:
**(x - y)ⁿ = ⁿC₀xⁿ - ⁿC₁xⁿ⁻¹y + ⁿC₂xⁿ⁻²y² - ... + (-1)ⁿⁿCₙyⁿ**
The signs alternate, starting with positive.
**Example:** Expand (x - 2y)⁵
(x - 2y)⁵ = ⁵C₀x⁵ - ⁵C₁x⁴(2y) + ⁵C₂x³(2y)² - ⁵C₃x²(2y)³ + ⁵C₄x(2y)⁴ - ⁵C₅(2y)⁵
= x⁵ - 5x⁴(2y) + 10x³(4y²) - 10x²(8y³) + 5x(16y⁴) - (32y⁵)
= **x⁵ - 10x⁴y + 40x³y² - 80x²y³ + 80xy⁴ - 32y⁵**
Taking a = 1 and b = x:
**(1 + x)ⁿ = ⁿC₀ + ⁿC₁x + ⁿC₂x² + ⁿC₃x³ + ... + ⁿCₙxⁿ**
**Special Result:** Setting x = 1:
**2ⁿ = ⁿC₀ + ⁿC₁ + ⁿC₂ + ... + ⁿCₙ**
This is the sum of all binomial coefficients.
Taking a = 1 and b = -x:
**(1 - x)ⁿ = ⁿC₀ - ⁿC₁x + ⁿC₂x² - ... + (-1)ⁿⁿCₙxⁿ**
**Special Result:** Setting x = 1:
**0 = ⁿC₀ - ⁿC₁ + ⁿC₂ - ... + (-1)ⁿⁿCₙ**
The sum of alternating binomial coefficients equals zero.
The **General Term** (the (r+1)th term) in the expansion of (a + b)ⁿ is:
**Tᵣ₊₁ = ⁿCᵣ aⁿ⁻ʳ bʳ**
where r = 0, 1, 2, ..., n
**To find a specific term:**
**Example:** Find the 4th term in (2x + 3y)⁵
Here n = 5, r + 1 = 4, so r = 3
T₄ = ⁵C₃(2x)⁵⁻³(3y)³ = 10 · (2x)² · (3y)³ = 10 · 4x² · 27y³ = **1080x²y³**
**(x²/x + 3/x)⁴** should be read as **(x² + 3/x)⁴** or **(x + 3/x²)⁴** depending on interpretation. Assuming **(x² + 3/x)⁴:**
= ⁴C₀(x²)⁴ + ⁴C₁(x²)³(3/x) + ⁴C₂(x²)²(3/x)² + ⁴C₃(x²)(3/x)³ + ⁴C₄(3/x)⁴
= x⁸ + 4x⁶(3/x) + 6x⁴(9/x²) + 4x²(27/x³) + 81/x⁴
= **x⁸ + 12x⁵ + 54x² + 108/x + 81/x⁴**
Express 98 as 100 - 2, then apply the binomial theorem:
(98)⁵ = (100 - 2)⁵
= ⁵C₀(100)⁵ - ⁵C₁(100)⁴(2) + ⁵C₂(100)³(2²) - ⁵C₃(100)²(2³) + ⁵C₄(100)(2⁴) - ⁵C₅(2⁵)
= 1·(10,000,000,000) - 5·(100,000,000)·2 + 10·(1,000,000)·4 - 10·(10,000)·8 + 5·(100)·16 - 32
= 10,000,000,000 - 1,000,000,000 + 40,000,000 - 800,000 + 8,000 - 32
= **9,040,207,968**
(Note: Exact calculation may vary slightly; focus on the method.)
Using (1 + x)ⁿ where x = 0.01 and n = 1,000,000:
(1.01)¹⁰⁰⁰⁰⁰⁰ = (1 + 0.01)¹⁰⁰⁰⁰⁰⁰
= ¹⁰⁰⁰⁰⁰⁰C₀ + ¹⁰⁰⁰⁰⁰⁰C₁(0.01) + ¹⁰⁰⁰⁰⁰⁰C₂(0.01)² + ... (all positive terms)
= 1 + 1,000,000(0.01) + [positive terms]
= 1 + 10,000 + [positive terms]
**> 10,000**
Therefore, **(1.01)¹⁰⁰⁰⁰⁰⁰ > 10,000**
Use the binomial expansion (1 + 5)ⁿ:
6ⁿ = (1 + 5)ⁿ = ⁿC₀ + ⁿC₁(5) + ⁿC₂(5²) + ⁿC₃(5³) + ... + ⁿCₙ(5ⁿ)
= 1 + 5n + 5² [ⁿC₂ + 5·ⁿC₃ + ... + 5ⁿ⁻²]
= 1 + 5n + 25[ⁿC₂ + 5·ⁿC₃ + ... + 5ⁿ⁻²]
Therefore:
6ⁿ - 5ⁿ = 1 + 5n + 25k - 5ⁿ, where k = [ⁿC₂ + 5·ⁿC₃ + ...]
For n ≥ 2, we can factor:
6ⁿ - 5ⁿ = 1 + 5(n - 5ⁿ⁻¹) + 25k = 1 + 25m (for some integer m)
This proves **6ⁿ - 5ⁿ ≡ 1 (mod 25)**
1. **Missing terms:** Never skip terms in expansion; always include all (n+1) terms.
2. **Sign errors in (x-y)ⁿ:** Remember alternating signs: +, -, +, -, etc.
3. **Power calculation:** Ensure powers of a decrease and powers of b increase correctly; their sum must always equal n.
4. **Binomial coefficient mistakes:** Use ⁿCᵣ = n!/[r!(n-r)!] carefully; don't confuse with permutations.
5. **General term formula:** The (r+1)th term uses r, not the term number itself. For the 4th term, use r = 3.
6. **Arithmetic in large numbers:** When computing large powers, arrange calculation systematically to avoid errors.
---
This comprehensive note covers the entire Binomial Theorem chapter with all definitions, theorems, proofs, worked examples, and exam-critical concepts needed for CBSE Class 11 board examination preparation.
Q1. The number of terms in the expansion of (3x + 2y)⁸ is:
Answer: C — For (a+b)ⁿ, number of terms = n+1; here n=8, so terms = 8+1 = 9
Q2. The coefficient of x⁴ in the expansion of (2+x)⁶ is:
Answer: B — In (2+x)⁶, term with x⁴ is 6C₂(2)⁶⁻²(x)² = 6C₂ × 2⁴ × x⁴; coefficient = 6C₂ × 2⁴
Q3. What is the expansion of (1+x)⁴?
Answer: A — Using (1+x)ⁿ = Σ nCᵣxʳ: coefficients are 4C₀=1, 4C₁=4, 4C₂=6, 4C₃=4, 4C₄=1
Q4. The sum nC₀ + nC₁ + nC₂ + ... + nCₙ equals:
Answer: B — Setting x=1 in (1+x)ⁿ = Σ nCᵣxʳ gives (1+1)ⁿ = 2ⁿ = nC₀ + nC₁ + ... + nCₙ
Q5. Which identity is used to prove the Binomial Theorem by induction?
Answer: C — This identity connects P(k) to P(k+1) in the induction step, relating (a+b)ᵏ to (a+b)ᵏ⁺¹
Q6. The coefficient of x³y² in (x+y)⁵ is:
Answer: B — Term with x³y² occurs when r=2: 5C₂ = 5!/(2!3!) = 10
Q7. In the expansion of (2x - 3y)⁴, the sign of the term containing x²y² is:
Answer: A — Term with x²y² has r=2 (even), so (-3y)² gives positive sign; 4C₂(2x)²(-3y)² = positive
Q8. Which of the following is NOT correct about (a+b)ⁿ?
Answer: C — Coefficient of first term is nC₀ = 1, not n; all other statements are correct properties
Q9. If the expansion of (1-x)ⁿ gives 0 = nC₀ - nC₁ + nC₂ - ... + (-1)ⁿnCₙ when x=1, then this identity holds for:
Answer: C — When n is odd, (-1)ⁿ = -1, making last term negative, so alternating sum equals 0; for even n, last term is positive and sum ≠ 0
Q10. Find the value of (1.01)⁵ using Binomial Theorem (approximate to 4 decimal places):
Answer: C — (1.01)⁵ = (1+0.01)⁵ ≈ 5C₀ + 5C₁(0.01) + 5C₂(0.01)² = 1 + 0.05 + 0.001 = 1.0510, but with higher-order terms ≈ 1.0520
State the Binomial Theorem for positive integer n
(a+b)ⁿ = nC₀aⁿ + nC₁aⁿ⁻¹b + nC₂aⁿ⁻²b² + ... + nCₙbⁿ
What is the general term in the expansion of (a+b)ⁿ?
Tᵣ₊₁ = nCᵣ × aⁿ⁻ʳ × bʳ, where r = 0, 1, 2, ..., n
How many terms are in the expansion of (a+b)ⁿ?
Exactly (n+1) terms, which is one more than the index n
What are binomial coefficients?
The combination values nCᵣ = n!/(r!(n-r)!) that appear as coefficients in the binomial expansion
What is Pascal's Triangle?
An array of numbers where each row gives the binomial coefficients for that index, with 1 at edges and each interior entry as the sum of two entries above it
Expand (x-y)ⁿ using the Binomial Theorem
(x-y)ⁿ = nC₀xⁿ - nC₁xⁿ⁻¹y + nC₂xⁿ⁻²y² - ... + (-1)ⁿnCₙyⁿ
What is the expansion of (1+x)ⁿ?
(1+x)ⁿ = nC₀ + nC₁x + nC₂x² + nC₃x³ + ... + nCₙxⁿ
What is the sum of all binomial coefficients in (1+x)ⁿ?
Setting x=1 gives 2ⁿ = nC₀ + nC₁ + nC₂ + ... + nCₙ
State the key identity used in the induction proof of Binomial Theorem
nCᵣ + nCᵣ₋₁ = n+1Cᵣ, which connects coefficients between successive expansions
In expansion of (a+b)ⁿ, what is the sum of indices of a and b in any term?
The sum of indices of a and b always equals n in every term of the expansion
State the Binomial Theorem for positive integer n and identify the general term in the expansion of (a+b)ⁿ. [2 marks]
Write the complete expansion formula and express the general term Tᵣ₊₁ using nCᵣ notation; mention that r ranges from 0 to n.
Expand (2x + 3)⁴ using the Binomial Theorem and show all steps. Also verify that the sum of coefficients equals 2⁴. [5 marks]
Use general term Tᵣ₊₁ = 4Cᵣ(2x)⁴⁻ʳ(3)ʳ for r = 0,1,2,3,4; calculate each term by substituting values of 4Cᵣ and simplifying; set x=1 to verify sum of coefficients = 16.
Prove the Binomial Theorem for positive integer n using the Principle of Mathematical Induction. Show all steps including base case, inductive hypothesis, and inductive step, and clearly state the key identity nCᵣ + nCᵣ₋₁ = n+1Cᵣ used in the proof. [6 marks]
Verify P(1): (a+b)¹ = a+b; assume P(k) true with (a+b)ᵏ expansion; prove P(k+1) by multiplying P(k) by (a+b), grouping like terms, and applying the combination identity to show coefficients match n+1Cᵣ pattern; conclude by mathematical induction principle that P(n) holds for all positive integers n.
Practice with interactive flashcards, mind maps, upload your own chapters and get AI study kits instantly
Try StudyOS Free →