Everything you need to ace this chapter, in one place.
Notes · Mind Map · Quiz · Assertion-Reason · Case Studies · Question Bank · Past Papers
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.
Q1. Assertion (A):
The total number of terms in the expansion of (a + b)n is n + 1.
Reason (R):
Each term in the binomial expansion corresponds to a unique combination nCr where r ranges from 0 to n.
Answer: A — Both A and R are true, and R is the correct explanation of A — The assertion is true—there are exactly n+1 terms. The reason is also true and correctly explains why: since r can take values 0, 1, 2, ..., n (that's n+1 different values), we get n+1 terms. The reason directly justifies the assertion.
Q2. Assertion (A):
In the expansion of (1 - x)n, the sum of all coefficients when x = 1 is zero.
Reason (R):
Substituting x = 1 in (1 - x)n gives (1 - 1)n = 0.
Answer: A — Both A and R are true, and R is the correct explanation of A — The assertion is true: (1 - 1)n = 0n = 0 (for n > 0). The reason is also true and provides the exact method to verify this. This shows why nC0 - nC1 + nC2 - ... + (-1)n nCn = 0.
Q3. Assertion (A):
The binomial coefficients in (a + b)n can be found using Pascal's triangle.
Reason (R):
Pascal's triangle is constructed where each element equals the sum of the two elements above it, and the nth row gives exactly the coefficients for (a + b)n.
Answer: B — Both A and R are true, but R is NOT the correct explanation of A — Both statements are true. The assertion correctly states that Pascal's triangle gives binomial coefficients. The reason is also true—Pascal's triangle is indeed constructed with that property. However, the reason doesn't explain WHY Pascal's triangle gives the correct binomial coefficients; it only describes how Pascal's triangle is constructed. A true explanation would link the construction property to the recurrence relation nCr + nC(r-1) = (n+1)Cr.
Unlock more Assertion-Reason questions in Premium — unlock →
Case Study:
A construction company is designing a modular building system. Each unit can be expanded by adding either a wall module (w) or a floor module (f). To calculate the total number of distinct structural configurations possible when building a 4-unit expansion, engineers use the binomial expansion formula. The total configurations follow the pattern of (w + f)^4, where each term represents a different structural arrangement. The company needs to identify how many ways they can have exactly 2 wall modules and 2 floor modules in their 4-unit structure.
Q1. What is the coefficient that represents the number of ways to arrange 2 wall modules and 2 floor modules?
Answer: B
Q2. If the company wants configurations with more wall modules than floor modules, which terms from (w + f)^4 would they consider?
Answer: D
Q3. What is the total number of distinct configurations if each configuration is equally weighted?
Answer: B
Q4. If w = 1 unit of cost and f = 1 unit of cost, and the company wants to find the total cost across all possible configurations, what expression would represent this?
Answer: D
Unlock more case studies in Premium — unlock →
Every formula from all 14 chapters on one page, checked against the NCERT textbook and the CBSE 2026-27 syllabus. Free PDF download.
You've seen the free preview. Open the full interactive study kit — mind map, instant-graded quiz, progress tracking — free, no sign-in required.
Open Full Study Kit — Free →Premium unlocks the full Question Bank, Daily Practice Papers, Chapter Quiz and Full Mock Papers for every chapter.