The number of ways to distribute 30 identical candies among four children C1, C2, C3 and C4 so that C2 receives atleast 4 and atmost 7 candies, C3 receives atleast 2 and atmost 6 candies, is equal to:
The correct answer is (D) : 430
By multinomial theorem, no. of ways to distribute 30 identical candies among four children C1, C2 and C3, C4
= Coefficient of x30 in (x4 + x5 + … + x7) (x2 + x3 +…+ x6) (1 + x + x2…)2
=Coefficient of x24 in \(\frac{(1−x^4)(1−x^5)(1−x^{31})^2}{(1−x)(1-x)(1-x)^2}\)
= Coefficient of x24 in (1 – x4 – x5 + x9) (1 – x)–4
= 27C24 – 23C20 – 22C19 + 18C15 = 430
The number of strictly increasing functions \(f\) from the set \(\{1, 2, 3, 4, 5, 6\}\) to the set \(\{1, 2, 3, ...., 9\}\) such that \(f(i)>i\) for \(1 \le i \le 6\), is equal to:
In the given figure, the blocks $A$, $B$ and $C$ weigh $4\,\text{kg}$, $6\,\text{kg}$ and $8\,\text{kg}$ respectively. The coefficient of sliding friction between any two surfaces is $0.5$. The force $\vec{F}$ required to slide the block $C$ with constant speed is ___ N.
(Given: $g = 10\,\text{m s}^{-2}$) 
Method used for separation of mixture of products (B and C) obtained in the following reaction is: 
Permutation is the method or the act of arranging members of a set into an order or a sequence.
Combination is the method of forming subsets by selecting data from a larger set in a way that the selection order does not matter.