In how many ways can $5$ girls and $3$ boys be seated in a row so that no two boys are together?
In how many ways can $5$ girls and $3$ boys be seated in a row so that no two boys are together?
Let us first seat the $5$ girls. This can be done in $5 !$ ways. For each such arrangement, the three boys can be seated only at the cross marked places.
$\times G \times G \times G \times G \times G \times$
There are $6$ cross marked places and the three boys can be seated in $^{6} P _{3}$ ways. Hence, by multiplication principle, the total number of ways
${ = 5!{ \times ^6}{P_3} = 5! \times \frac{{6!}}{{3!}}}$
${ = 4 \times 5 \times 2 \times 3 \times 4 \times 5 \times 6 = 14400}$
Similar Questions
There are $m$ books in black cover and $n$ books in blue cover, and all books are different. The number of ways these $(m+n)$ books can be arranged on a shelf so that all the books in black cover are put side by side is
There are $m$ books in black cover and $n$ books in blue cover, and all books are different. The number of ways these $(m+n)$ books can be arranged on a shelf so that all the books in black cover are put side by side is
- [KVPY 2020]
If $n$ is even and the value of $^n{C_r}$ is maximum, then $r = $
If $n$ is even and the value of $^n{C_r}$ is maximum, then $r = $
A person wants to climb a $n-$ step staircase using one step or two steps. Let $C_n$ denotes the number of ways of climbing the $n-$ step staircase. Then $C_{18} + C_{19}$ equals
A person wants to climb a $n-$ step staircase using one step or two steps. Let $C_n$ denotes the number of ways of climbing the $n-$ step staircase. Then $C_{18} + C_{19}$ equals
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 ?$
If $^{n} C_{8}=\,^{n} C_{2},$ find $^{n} C_{2}.$
If $^{n} C_{8}=\,^{n} C_{2},$ find $^{n} C_{2}.$