JEE MATHEMATICS MCQ: BINOMIAL THEOREM

1 Easy

1 of 1

Application +4 | -1

The number of ways to distribute 30 identical candies among four children

{C_1},{C_2},{C_3}

and

{C_4}

so that

{C_2}

receives atleast 4 and atmost 7 candies,

{C_3}

receives atleast 2 and atmost 6 candies, is equal to:

View answer and explanation

Correct option: D

430

Option D (430) is correct because it represents the number of ways to distribute the candies, calculated using the multinomial theorem and considering the given constraints on the number of candies each child can receive.

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

equals If

a

and

d

are two complex numbers, then the sum to

\left( {n + 1} \right)

terms of the following series

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

is The number of different terms in the expansion of

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

is The sum of the coefficient of the binomial expansion of

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

is equal to 6561 . The constant term in the expansion is The coefficient of

{x^5}

in the expansion of

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

is If

\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

, then

n

equals