JEE MATHEMATICS MCQ: BINOMIAL THEOREM

1 Easy

1 of 1

Application +4 | -1

If for

1 \leq \mathrm{m} \leq \mathrm{n}, \mathrm{f}(\mathrm{m}, \mathrm{n})={ }^{\mathrm{n}} \mathrm{C}_{\mathrm{0}}-{ }^{\mathrm{n}} \mathrm{C}_1+{ }^{\mathrm{n}} \mathrm{C}_2-\ldots . .+(-1)^{\mathrm{m}-1} \cdot{ }^{\mathrm{n}} \mathrm{C}_{\mathrm{m}-1}

, find

\mathrm{f}(7, 8)

View answer and explanation

Correct option: A

Option A (7) is correct because by simplifying the expression and using combinatorial identities, f(7, 8) is found to be 7.

More Questions from BINOMIAL THEOREM

Practice All Chapter MCQs →

\left({ }^{10} C_0\right)^2-\left({ }^{10} C_1\right)^2+\ldots-\left({ }^{10} C_9\right)^2+\left({ }^{10} C_{10}\right)^2

a

d

\left( {n + 1} \right)

a{C_0} - \left( {a + d} \right){C_1} + \left( {a + 2d} \right){C_2} - ... + ...

(1-x)^{201}\left(1+x+x^2\right)^{200}

\left(\frac{1}{x}+2 x\right)^n

{x^5}

\frac{{1 + {x^2}}}{{1 + x}},\left| x \right| < 1,

\left(\begin{array}{c}2 n+1 \\ 0\end{array}\right)+\left(\begin{array}{c}2 n+1 \\ 3\end{array}\right)+\left(\begin{array}{c}2 n+1 \\ 6\end{array}\right)+\ldots=170

n