Official Textbook Solutions: Class 11 Mathematics Chapter 06 Binomial Theorem
Explore reliable textbook solutions for Chapter 06 Binomial Theorem tailored for Class 11 learners using methodologies. Utilizing these Mathematics answers ensures thorough preparation and strengthens foundational knowledge before final school evaluations.
Chapter-wise Solutions for Mathematics: Chapter 06 Binomial Theorem
Navigate directly to the solved Mathematics textbook exercises using the digital viewer below. Each solution includes detailed step-by-step explanations, allowing students to instantly cross-check their work and identify areas requiring further revision.
Matrix Match Type
Question 1. Match the statements in Column I (a, b, c, d) with the statements in Column II (p, q, r, s).
| Column I | Column II |
|---|---|
| a. If \({}^{(n+1)}C_4+{}^{(n+1)}C_3+{}^{(n+2)}C_3>{}^{(n+3)}C_3\), then possible value/values of \(n\) is/are | p. 4 |
| b. The remainder when \((3053)^{456}-(2417)^{333}\) is divided by 9 is less than | q. 5 |
| c. The digit in the unit place of the number \(183!+3^{183}\) is greater than | r. 6 |
| d. If sum of the coefficients of the first, second and third terms of the expansion of \(\left(x^2+\dfrac1x\right)^m\) is 46, then the index of the term that does not contain \(x\) is greater than | s. 7 |
Solution.
Answer: a \(\to\) q, r, s; b \(\to\) p, q, r, s; c \(\to\) p, q, r; d \(\to\) p, q.
a. \({}^{(n+1)}C_4+{}^{(n+1)}C_3+{}^{(n+2)}C_3={}^{(n+3)}C_4\) (Pascal's rule) \(\Rightarrow{}^{(n+3)}C_4>{}^{(n+3)}C_3\Rightarrow\dfrac{{}^{n+3}C_4}{{}^{n+3}C_3}>1\Rightarrow n>4\) or \(n\ge5\).
b. \((3053)^{456}-(2417)^{333}=(339\times9+2)^{456}-(269\times9-4)^{333}\). Remainder of given number is same as remainder of \(2^{456}+4^{333}\) and \(2^{456}+4^{333}=(64)^{76}+(64)^{111}=(1+63)^{76}+(1+63)^{111}=(1+9\times7)^{76}+(1+9\times7)^{111}\). Hence, the remainder is 2.
c. We know that \(n!\) terminates in 0 for \(n\ge5\) and \(3^{4n}\) terminates in 1 (\(\because3^4=81\)). Therefore, \(3^{180}=(3^4)^{45}\) terminates in 1. Also, \(3^3=27\) terminates in 7. Hence, \(183!+3^{183}\) terminates in 7. That is, the digit in the unit place is 7.
d. We are given \({}^mC_0+{}^mC_1+{}^mC_2=46\Rightarrow2m+m(m-1)=90\Rightarrow m^2+m-90=0\Rightarrow m=9\) as \(m>0\). Now, \((r+1)^{th}\) term of \(\left(x^2+\dfrac1x\right)^m\) is \({}^mC_r(x^2)^{m-r}\left(\dfrac1x\right)^r={}^mC_rx^{2m-3r}\). For this to be independent of \(x\), \(2m-3r=0\Rightarrow r=6\).
Teacher's Note: Reduce each part: Pascal's rule, remainders mod 9, last digits, and the term free of x.
Exam Note: Four independent computations; compare each result with 4-7.
Question 2. Match the statements in Column I (a, b, c, d) with the statements in Column II (p, q, r, s).
| Column I | Column II |
|---|---|
| a. \({}^{32}C_0^2-{}^{32}C_1^2+{}^{32}C_2^2-\cdots+{}^{32}C_{32}^2=\) | p. \({}^{63}C_{32}\) |
| b. \({}^{32}C_0^2+{}^{32}C_1^2+{}^{32}C_2^2-\cdots+{}^{32}C_{32}^2=\) | q. \({}^{32}C_{16}\) |
| c. \(\dfrac1{32}(1\times{}^{32}C_1^2+2\times{}^{32}C_2^2+\cdots+32\times{}^{32}C_{32}^2)=\) | r. 0 |
| d. \({}^{31}C_0^2-{}^{31}C_1^2+{}^{31}C_2^2-\cdots-{}^{31}C_{31}^2=\) | s. \({}^{64}C_{32}\) |
Solution.
Answer: a \(\to\) q; b \(\to\) s; c \(\to\) p; d \(\to\) r.
We know that \({}^nC_0^2+{}^nC_1^2+\cdots+{}^nC_n^2={}^{2n}C_n\) and \({}^nC_0^2-{}^nC_1^2+\cdots+(-1)^n{}^nC_n^2=0\) if \(n\) is odd, \({}^nC_{n/2}(-1)^{n/2}\) if \(n\) is even.
From this, \({}^{31}C_0^2-{}^{31}C_1^2+{}^{31}C_2^2-\cdots-{}^{31}C_{31}^2=0\); \({}^{32}C_0^2-{}^{32}C_1^2+{}^{32}C_2^2-\cdots+{}^{32}C_{32}^2={}^{32}C_{16}\); \({}^{32}C_0^2+{}^{32}C_1^2+{}^{32}C_2^2-\cdots+{}^{32}C_{32}^2={}^{64}C_{32}\)
Also, \((1/32)(1\times{}^{32}C_1^2+2\times{}^{32}C_2^2-\cdots+32\times{}^{32}C_{32}^2)=\dfrac1{32}\displaystyle\sum_{r=1}^{32}r({}^{32}C_r)^2=\dfrac1{32}\sum_{r=1}^{32}r\,{}^{32}C_r\,{}^{32}C_{32-r}=\dfrac1{32}\sum_{r=1}^{32}32\,{}^{31}C_{r-1}\,{}^{32}C_{32-r}={}^{63}C_{31}={}^{63}C_{32}\)
Teacher's Note: Use the standard sums of squares of binomial coefficients and Vandermonde's identity.
Exam Note: Plain sum of squares is 2nCn; alternating sum uses parity of n.
Question 3. Match the statements in Column I (a, b, c, d) with the statements in Column II (p, q, r, s).
| Column I | Column II |
|---|---|
| a. \(\displaystyle\sum\sum_{i\ne j}{}^{10}C_i{}^{10}C_j\) | p. \(\dfrac{2^{20}-{}^{20}C_{10}}2\) |
| b. \(\displaystyle\sum\sum_{0\le i\le j\le10}{}^{10}C_i{}^{10}C_j\) | q. \(2^{20}-{}^{20}C_{10}\) |
c. \(\displaystyle\sum\sum_{0\le i| r. \(2^{20}\) | |
| d. \(\displaystyle\sum_{i=0}^{10}\sum_{j=0}^{10}{}^{10}C_i{}^{10}C_j\) | s. \(\dfrac{2^{20}+{}^{20}C_{10}}2\) |
Solution.
Answer: a \(\to\) q; b \(\to\) s; c \(\to\) p; d \(\to\) r.
In the sum of series \(\displaystyle\sum_{i=1}^n\sum_{j=1}^nf(i)\times f(j)=\sum_{i=1}^n\left(f(i)\left(\sum_{j=1}^nf(j)\right)\right)\), \(i\) and \(j\) are independent. In this summation, three types of terms occur, for which \(i<j\), \(i>j\) and \(i=j\). Also, the sum of terms when \(i<j\) is equal to the sum of the terms when \(i>j\) if \(f(i)\) and \(f(j)\) are symmetrical. So, in that case \(\displaystyle\sum_{i=0}^n\sum_{j=0}^nf(i)f(j)=2\sum\sum_{0\le i<j\le n}f(i)f(j)+\sum_{i=j}f(i)f(j)\Rightarrow\sum\sum_{0\le i<j\le n}f(i)f(j)=\dfrac{\sum_{i=0}^n\sum_{j=0}^nf(i)f(j)-\sum_{i=j}f(i)f(j)}2\)
a. \(\displaystyle\sum\sum_{i\ne j}{}^{10}C_i{}^{10}C_j=\sum_{i=0}^{10}\sum_{j=0}^{10}{}^{10}C_i{}^{10}C_j-\sum_{i=0}^{10}{}^{10}C_i^2=2^{20}-{}^{20}C_{10}\)
b. \(\displaystyle\sum\sum_{0\le i\le j\le10}{}^{10}C_i{}^{10}C_j=\dfrac{\sum_{i=0}^{10}\sum_{j=0}^{10}{}^{10}C_i{}^{10}C_j+\sum_{i=0}^{10}{}^{10}C_i^2}2=\dfrac{2^{20}+{}^{20}C_{10}}2\)
c. \(\displaystyle\sum\sum_{0\le i<j\le10}{}^{10}C_i{}^{10}C_j=\dfrac{\sum\sum{}^{10}C_i{}^{10}C_j-\sum{}^{10}C_i^2}2=\dfrac{2^{20}-{}^{20}C_{10}}2\)
d. \(\displaystyle\sum_{i=0}^{10}\sum_{j=0}^{10}{}^{10}C_i{}^{10}C_j=\sum_{i=0}^{10}{}^{10}C_i\sum_{j=0}^{10}{}^{10}C_j=2^{20}\)
Teacher's Note: Full double sum is 2^20; the diagonal is the sum of squares 20C10; split into i<j, i>j, i=j.
Exam Note: Off-diagonal sum is half of full minus diagonal.
Question 4. Match the statements in Column I (a, b, c, d) with the statements in Column II (p, q, r, s).
| Column I | Column II |
|---|---|
| a. The sum of binomial coefficients of terms containing power of \(x\) more than \(x^{20}\) in \((1+x)^{41}\) is divisible by | p. \(2^{39}\) |
| b. The sum of binomial coefficients of rational terms in the expansion of \((1+\sqrt2)^{42}\) is divisible by | q. \(2^{40}\) |
| c. If \(\left(x+\dfrac1x+x^2+\dfrac1{x^2}\right)^{21}=a_0x^{-42}+a_1x^{-41}+a_2x^{-40}+\cdots+a_{84}x^{42}\), then \(a_0+a_2+\cdots+a_{84}\) is divisible by | r. \(2^{41}\) |
| d. The sum of binomial coefficients of positive real terms in the expansion of \((1+ix)^{42}\) (\(x>0\)) is divisible by | s. \(2^{38}\) |
Solution.
Answer: a \(\to\) p, q, s; b \(\to\) p, q, r, s; c \(\to\) p, q, r, s; d \(\to\) p, q, s.
a. In \((1+x)^{41}={}^{41}C_0+{}^{41}C_1x+\cdots+{}^{41}C_{20}x^{20}+{}^{41}C_{21}x^{21}+\cdots+{}^{41}C_{41}x^{41}\), \({}^{41}C_{21}+{}^{41}C_{22}+\cdots+{}^{41}C_{41}=2^{40}\).
b. \((1+\sqrt2)^{42}={}^{42}C_0+{}^{42}C_1\sqrt2+{}^{42}C_2(\sqrt2)^2+\cdots+{}^{42}C_{42}(\sqrt2)^{42}\). Sum of binomial coefficients of rational terms is \({}^{42}C_0+{}^{42}C_2+{}^{42}C_4+\cdots+{}^{42}C_{42}=2^{41}\).
c. \(\left(x+\dfrac1x+x^2+\dfrac1{x^2}\right)^{21}=\left(\dfrac{x^3+x+x^4+1}{x^2}\right)^{21}=\dfrac{a_0+a_1x+a_2x^2+\cdots+a_{82}x^{82}}{x^{42}}\). Putting \(x=1\), \(4^{21}=a_0+a_1+\cdots+a_{82}\); putting \(x=-1\), \(0=a_0-a_1+a_2-a_3+\cdots+a_{82}\). Adding, \(4^{21}=2(a_0+a_2+\cdots+a_{82})\Rightarrow a_0+a_2+\cdots+a_{82}=2^{41}\).
d. We know that \({}^nC_0-{}^nC_2+{}^nC_4-{}^nC_6+\cdots=2^{n/2}\cos\dfrac{n\pi}4\) (1) and \({}^nC_0+{}^nC_2+{}^nC_4+{}^nC_6+\cdots=2^{n-1}\) (2) \(\Rightarrow{}^nC_0+{}^nC_4+{}^nC_8+\cdots=\dfrac12\left(2^{n/2}\times\cos\dfrac{n\pi}4+2^{n-1}\right)\). For \(n=42\), \({}^{42}C_0+{}^{42}C_4+{}^{42}C_8+\cdots=\dfrac12\left(2^{21}\times\cos\dfrac{21\pi}2+2^{41}\right)=2^{40}\).
Teacher's Note: Compute each sum as a power of 2, then test divisibility by 2^38 to 2^41.
Exam Note: Value 2^40 is divisible by 2^38, 2^39, 2^40 only.
Question 5. Match the statements in Column I (a, b, c, d) with the statements in Column II (p, q, r, s).
| Column I | Column II |
|---|---|
| a. The coefficient of two consecutive terms in the expansion of \((1+x)^n\) will be equal, then \(n\) can be | p. 9 |
| b. If \(15^n+23^n\) is divided by 19, then \(n\) can be | q. 10 |
| c. \({}^{10}C_0\,{}^{20}C_{10}-{}^{10}C_1\,{}^{18}C_{10}+{}^{10}C_2\,{}^{16}C_{10}-\cdots\) is divisible by \(2^n\), then \(n\) can be | r. 11 |
| d. If the coefficients of \(T_r\), \(T_{r+1}\), \(T_{r+2}\) terms of \((1+x)^{14}\) are in A.P., then \(r\) is less than | s. 12 |
Solution.
Answer: a \(\to\) p, r; b \(\to\) p, r; c \(\to\) p, q; d \(\to\) q, r, s.
a. Let consecutive coefficients be \({}^nC_r\) and \({}^nC_{r+1}\). Then \(\dfrac{n!}{(n-r)!r!}=\dfrac{n!}{(n-r-1)!(r+1)!}\Rightarrow r+1=n-r\Rightarrow n=2r+1\). Hence, \(n\) is odd.
b. \(E=(19-4)^n+(19+4)^n=2[{}^nC_019^n+{}^nC_219^{n-2}4^2+\cdots+{}^nC_n4^n]\) when \(n\) is even, or \(2[{}^nC_019^n+{}^nC_2\cdot19^{n-2}\cdot4^2+\cdots+{}^nC_{n-1}19\cdot4^{n-1}]\) when \(n\) is odd \(\Rightarrow E\) is divisible by 19 when \(n\) is odd.
c. \({}^{10}C_0\,{}^{20}C_{10}-{}^{10}C_1\,{}^{18}C_{10}+{}^{10}C_2\,{}^{16}C_{10}-\cdots=\) Coefficient of \(x^{10}\) in \([{}^{10}C_0(1+x)^{20}-{}^{10}C_1(1+x)^{18}+{}^{10}C_2(1+x)^{16}-\cdots]=\) Coefficient of \(x^{10}\) in \([(1+x)^2-1]^{10}=\) Coefficient of \(x^{10}\) in \([2x+x^2]^{10}=2^{10}\).
d. \(T_r={}^{14}C_{r-1}x^{r-1}\), \(T_{r+1}={}^{14}C_rx^r\), \(T_{r+2}={}^{14}C_{r+1}x^{r+1}\). By the given condition, \(2\,{}^{14}C_r={}^{14}C_{r-1}+{}^{14}C_{r+1}\Rightarrow2=\dfrac{{}^{14}C_{r-1}}{{}^{14}C_r}+\dfrac{{}^{14}C_{r+1}}{{}^{14}C_r}\Rightarrow2=\dfrac r{14-r+1}+\dfrac{14-(r+1)+1}{r+1}\Rightarrow2=\dfrac r{15-r}+\dfrac{14-r}{r+1}\Rightarrow r=9\) (the other root is \(r=5\)).
Teacher's Note: Each part reduces to a parity, divisibility or A.P. condition on binomial coefficients.
Exam Note: Odd n, 2^10, and r = 5 or 9.
Free study material for Mathematics
Cengage G Tewani Solutions for Class 11 Mathematics: Cengage G Tewani Solutions Algebra Chapter 6 Binomial Theorem Matrix Match Type
Download Cengage G Tewani Solutions for Class 11
Access the complete chapter-wise PDF for Cengage G Tewani Solutions Algebra Chapter 6 Binomial Theorem Matrix Match Type. These structured Cengage G Tewani Solutions solutions for Class 11 Mathematics help students build foundational accuracy and prepare effectively for upcoming school evaluations.
Detailed Calculation Guides for Class 11
Each problem includes a step-by-step breakdown to clarify complex mathematical formulas and theorems. Utilizing these verified answers ensures students learn the proper problem-solving techniques expected in standard academic assessments.
Additional Study Materials for 2026
Maximize your academic readiness by pairing these solutions with our official sample papers and interactive practice tests. All supplementary study materials for the 2026 session are available across our platform free of charge.
FAQs
They are chapter-wise solved questions from the book for Class 11 Mathematics. Each answer is explained step by step so you can check your work and revise.
Yes. All chapters can be read online for free on a phone, tablet or computer, and no sign-up is needed.
Try each question on your own first, then read the solution. Use it to check your steps, correct mistakes and learn how a full answer is written.
Regular practice improves accuracy and speed and shows which topics need more revision. It works best alongside your textbook and class notes.
Yes. The chapter list on this page links to every chapter’s solved questions, so you can open the topic you are studying.
They are listed for the 2026-27 session. Check that the questions match the textbook edition you use.