Use app×
QUIZARD
QUIZARD
JEE MAIN 2026 Crash Course
NEET 2026 Crash Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
108 views
in Binomial Theorem by (105k points)
closed by
For every integer n > 2 the sum of the expansions \(1 - {}^n{C_1} + {}^n{C_2} + - - - {( - 1)^n}{}.^n{C_n}\) is______
1. n(n - 1)2n - 2
2. 0
3. n 2m - 1
4. \((2n_{c_n})^2\)

1 Answer

0 votes
by (111k points)
selected by
 
Best answer
Correct Answer - Option 2 : 0

Concept:

As we know, the formula for combinations is

\(^n{C_r} = \frac{{n!}}{{r!\left( {n - r} \right)!}}\)

Note:

 \(^n{C_n}=1\)

\(^n{C_r} = {}^n{C_{n - r}}\)

Calculation:

Given, 

n > 2

Let's take n = 3 and put in the series,

⇒ \(1 - {}^n{C_1} + {}^n{C_2} + - - - {( - 1)^n}{}.^n{C_n}\) 

⇒ \(1 - {}^3{C_1} + {}^3{C_2} + - - - {( - 1)^3}.{}^3{C_3}\)

Now Expanding and solving, we get

\(\begin{array}{l} \Rightarrow 1 - \frac{{3!}}{{1!\left( {3 - 1} \right)!}} + \frac{{3!}}{{2!\left( {3 - 2} \right)!}} - 1\\ \Rightarrow 1 - \frac{{3!}}{{1!2!}} + \frac{{3!}}{{2!1!}} - 1 = 0 \end{array}\)

Similarly, we can check for other n values, the sum of the expansions \( - {}^n{C_1} + {}^n{C_2} + - - - {( - 1)^n}{}^n{C_n}\) will come zero for all n > 2.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

...