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
$\sum \limits_{ k =0}^6{ }^{51- k } C _3$ is equal to
$\sum \limits_{ k =0}^6{ }^{51- k } C _3$ is equal to
- [JEE MAIN 2023]
$\sum\limits_{r = 0}^m {^{n + r}{C_n} = } $
$\sum\limits_{r = 0}^m {^{n + r}{C_n} = } $
Number of different words that can be formed from all letters of word $APPLICATION$ such that two vowels never come together is -
Number of different words that can be formed from all letters of word $APPLICATION$ such that two vowels never come together is -
A committee of $11$ members is to be formed from $8$ males and $5$ females. If $m$ is the number of ways the committee is formed with at least $6$ males and $n$ is the number of ways the committee is formed with at least $3$ females, then
A committee of $11$ members is to be formed from $8$ males and $5$ females. If $m$ is the number of ways the committee is formed with at least $6$ males and $n$ is the number of ways the committee is formed with at least $3$ females, then
- [JEE MAIN 2019]
How many different words can be formed by jumbling the letters in the word $MISSISSIPPI$ in which no two $S$ are adjacent $?$
How many different words can be formed by jumbling the letters in the word $MISSISSIPPI$ in which no two $S$ are adjacent $?$
- [AIEEE 2008]