3 boys B_1, B_2, B_3 and 6 girls G_1, G_2, . | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(B) Total number of people $= 3 + 6 = 9$.Let $S$ be the set of all arrangements where $B_1, B_2$ are separated.Let $A$ be the condition that $B_1, B_2

Vedclass · Accepted Answer

$44 	imes 7!$

Vedclass · Answer

(B) Total number of people $= 3 + 6 = 9$.Let $S$ be the set of all arrangements where $B_1, B_2$ are separated.Let $A$ be the condition that $B_1, B_2$ are together.Let $B$ be the condition that $G_1, G_2$ are together.We want to find the number of arrangements where $B_1, B_2$ are separated $AND$ $G_1, G_2$ are separated.This is given by: (Total arrangements where $B_1, B_2$ are separated) - (Arrangements where $B_1, B_2$ are separated $AND$ $G_1, G_2$ are together).$1$. Total arrangements where $B_1, B_2$ are separated: Total arrangements - Arrangements where $B_1, B_2$ are together $= 9! - (8! 	imes 2!) = 9 	imes 8! - 2 	imes 8! = 7 	imes 8!$.$2$. Arrangements where $B_1, B_2$ are separated $AND$ $G_1, G_2$ are together: (Arrangements where $G_1, G_2$ are together) - (Arrangements where $G_1, G_2$ are together $AND$ $B_1, B_2$ are together).Arrangements where $G_1, G_2$ are together $= 8! 	imes 2!$.Arrangements where $G_1, G_2$ are together $AND$ $B_1, B_2$ are together $= 7! 	imes 2! 	imes 2!$.So,(Arrangements where $B_1, B_2$ are separated $AND$ $G_1, G_2$ are together) $= (8! 	imes 2!) - (7! 	imes 4) = (16 	imes 7!) - (4 	imes 7!) = 12 	imes 7!$.Required ways $= (7 	imes 8!) - (12 	imes 7!) = (56 	imes 7!) - (12 	imes 7!) = 44 	imes 7!$.

$3$ boys $B_1, B_2, B_3$ and $6$ girls $G_1, G_2, . . . , G_6$ are to be seated in a row. The number of ways they can be seated such that $B_1, B_2$ are separated and $G_1, G_2$ are also separated is equal to:

Similar Questions

There are $6$ multiple choice questions in an examination. How many sequences of answers are possible,if the first $2$ questions have $3$ choices each,the next $2$ have $4$ choices each,and the last $2$ have $5$ choices each?

If $(n+2)! = 2550(n!)$,find $n$.

$^nC_r + ^{n-1}C_r + ...... + ^rC_r$ =

In a club election,the number of contestants is one more than the number of maximum candidates for which a voter can vote. If the total number of ways in which a voter can vote is $62$,then the number of candidates is:

In how many ways can a team of $10$ players be selected from $22$ players if $6$ particular players are always to be included and $4$ particular players are always excluded?

Vedclass Test Series

Exam Paper Generator

Online Exam Module