Let $S=\{1,2,3, \ldots ., 9\}$. For $k=1,2, \ldots \ldots, 5$, let $N_K$ be the number of subsets of $S$, each containing five elements out of which exactly $k$ are odd. Then $N_1+N_2+N_3+N_4+N_5=$
Let $S=\{1,2,3, \ldots ., 9\}$. For $k=1,2, \ldots \ldots, 5$, let $N_K$ be the number of subsets of $S$, each containing five elements out of which exactly $k$ are odd. Then $N_1+N_2+N_3+N_4+N_5=$
- [IIT 2017]
- A
$210$
- B
$252$
- C
$125$
- D
$126$
Similar Questions
If $^{n}{P_4} = 24.{\,^n}{C_5},$ then the value of $n$ is
If $^{n}{P_4} = 24.{\,^n}{C_5},$ then the value of $n$ is
In how many ways can one select a cricket team of eleven from $17$ players in which only $5$ players can bowl if each cricket team of $11$ must include exactly $4$ bowlers?
In how many ways can one select a cricket team of eleven from $17$ players in which only $5$ players can bowl if each cricket team of $11$ must include exactly $4$ bowlers?
The number of ways to give away $25$ apples to $4$ boys, each boy receiving at least $4$ apples, are
The number of ways to give away $25$ apples to $4$ boys, each boy receiving at least $4$ apples, are
The total number of natural numbers of six digits that can be made with digits $1, 2, 3, 4$, if all digits are to appear in the same number at least once, is
The total number of natural numbers of six digits that can be made with digits $1, 2, 3, 4$, if all digits are to appear in the same number at least once, is
In how many ways can a committee consisting of one or more members be formed out of $12$ members of the Municipal Corporation
In how many ways can a committee consisting of one or more members be formed out of $12$ members of the Municipal Corporation