Statement$-1:$ The number of ways of distributing $10$ identical balls in $4$ distinct boxes such that no box is empty is $^9C_3 .$
Statement$-2:$ The number of ways of choosing any $3$ places from $9$ different places is $^9C_3 $.
Statement $-1$ is false, Statement $-2$ is true.
Statement $- 1$ is true, Statement $-2$ is false.
Statement$-1$ is true, Statement $-2$ is true; Statement $-2$ is a not correct explanation for Statement $-1$
Statement$-1$ is true, Statement $-2$ is true; Statement $-2$ is a correct explanation for Statement $-1$
The number of ways of choosing $10$ objects out of $31$ objects of which $10$ are identical and the remaining $21$ are distinct, is
A group of students comprises of $5$ boys and $n$ girls. If the number of ways, in which a team of $3$ students can randomly be selected from this group such that there is at least one boy and at least one girl in each team, is $1750$, then $n$ is equal to
The number of ways in which $21$ identical apples can be distributed among three children such that each child gets at least $2$ apples, is
There are $5$ students in class $10,6$ students in class $11$ and $8$ students in class $12.$ If the number of ways, in which $10$ students can be selected from them so as to include at least $2$ students from each class and at most $5$ students from the total $11$ students of class $10$ and $11$ is $100 \mathrm{k}$, then $\mathrm{k}$ is equal to $......$
For non-negative integers $s$ and $r$, let
$\binom{s}{r}=\left\{\begin{array}{ll}\frac{s!}{r!(s-r)!} & \text { if } r \leq s \\ 0 & \text { if } r>s\end{array}\right.$
For positive integers $m$ and $n$, let
$(m, n) \sum_{ p =0}^{ m + n } \frac{ f ( m , n , p )}{\binom{ n + p }{ p }}$
where for any nonnegative integer $p$,
$f(m, n, p)=\sum_{i=0}^{ p }\binom{m}{i}\binom{n+i}{p}\binom{p+n}{p-i}$
Then which of the following statements is/are $TRUE$?
$(A)$ $(m, n)=g(n, m)$ for all positive integers $m, n$
$(B)$ $(m, n+1)=g(m+1, n)$ for all positive integers $m, n$
$(C)$ $(2 m, 2 n)=2 g(m, n)$ for all positive integers $m, n$
$(D)$ $(2 m, 2 n)=(g(m, n))^2$ for all positive integers $m, n$