If $^n{C_3} + {\,^n}{C_4} > {\,^{n + 1}}{C_3},$ then
If $^n{C_3} + {\,^n}{C_4} > {\,^{n + 1}}{C_3},$ then
- A
$n > 6$
- B
$n > 7$
- C
$n < 6$
- D
None of these
Similar Questions
If $'n'$ objects are arranged in a row then the number of ways of selecting three of these objects so that no two of them are next to each othe
If $'n'$ objects are arranged in a row then the number of ways of selecting three of these objects so that no two of them are next to each othe
If $2 \times {}^n{C_5} = 9\,\, \times \,\,{}^{n - 2}{C_5}$, then the value of $n$ will be
If $2 \times {}^n{C_5} = 9\,\, \times \,\,{}^{n - 2}{C_5}$, then the value of $n$ will be
The value of $\sum\limits_{r = 1}^{15} {{r^2}\,\left( {\frac{{^{15}{C_r}}}{{^{15}{C_{r - 1}}}}} \right)} $ is equal to
The value of $\sum\limits_{r = 1}^{15} {{r^2}\,\left( {\frac{{^{15}{C_r}}}{{^{15}{C_{r - 1}}}}} \right)} $ is equal to
- [JEE MAIN 2016]
How many numbers greater than $1000000$ can be formed by using the digits $1,2,0,2,4,2,4 ?$
How many numbers greater than $1000000$ can be formed by using the digits $1,2,0,2,4,2,4 ?$
A total number of words which can be formed out of the letters $a,\;b,\;c,\;d,\;e,\;f$ taken $3$ together such that each word contains at least one vowel, is
A total number of words which can be formed out of the letters $a,\;b,\;c,\;d,\;e,\;f$ taken $3$ together such that each word contains at least one vowel, is