In an examination, a question paper consists of $12$ questions divided into two parts i.e., Part $\mathrm{I}$ and Part $\mathrm{II}$, containing $5$ and $7$ questions, respectively. A student is required to attempt $8$ questions in all, selecting at least $3$ from each part. In how many ways can a student select the questions?
It is given that the question paper consists of $12$ questions divided into two parts - Part $I$ and Part $II$, containing $5$ and $7$ questions, respectively.
A student has to attempt $8$ questions, selecting at least $3$ from each part. This can be done as follows.
$(a)$ $3$ questions from part $I$ and $5$ questions from part $II$
$(b)$ $4$ questions from part $I$ and $4$ questions from part $II$
$(c)$ $5$ questions from part $I$ and $3$ questions from part $II$
$3$ questions from part $I$ and $5$ questions from part $II$ can be selected in $^{5} C _{3} \times^{7} C _{5}$ ways.
$4$ questions from part $I$ and $4$ questions from part $II$ can be selected in $^{5} C _{4} \times^{7} C _{4}$. Ways.
$5$ questions from part $I$ and $3 $ questions from part $II$ can be selected in $^{5} C_{5} \times^{7} C_{3}$ ways.
Thus, required number of ways of selecting questions
$=^{5} C_{3} \times^{7} C_{5}+^{5} C_{4} \times^{7} C_{4}+^{5} C_{5} \times^{7} C_{3}$
$=\frac{5 !}{2 ! 3 !} \times \frac{7 !}{2 ! 5 !}+\frac{5 !}{4 ! 1 !} \times \frac{7 !}{4 ! 3 !}+\frac{5 !}{5 ! 0 !} \times \frac{7 !}{3 ! 4 !}$
$=210+175+35=420$
$10$ different letters of English alphabet are given. Out of these letters, words of $5$ letters are formed. How many words are formed when at least one letter is repeated
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=$
The value of $r$ for which $^{20}{C_r}^{20}{C_0}{ + ^{20}}{C_{r - 1}}^{20}{C_1}{ + ^{20}}{C_{r - 2}}^{20}{C_2} + ...{ + ^{20}}{C_0}^{20}{C_r}$ is maximum is
In how many ways can $5$ girls and $3$ boys be seated in a row so that no two boys are together?
Determine $n$ if
$^{2 n} C_{3}:^{n} C_{3}=11: 1$