There are ten boys B_{1}, B_{2}, ldots, B_{10 | vedclass

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

Question

(B) Total number of boys $n(B) = 10$ and total number of girls $n(G) = 5$. The total number of ways to form a group of $3$ boys and $3$ girls without

Vedclass · Accepted Answer

$1120$

Vedclass · Answer

(B) Total number of boys $n(B) = 10$ and total number of girls $n(G) = 5$. The total number of ways to form a group of $3$ boys and $3$ girls without any restrictions is: $= {}^{10}C_{3} 	imes {}^{5}C_{3} = \frac{10 	imes 9 	imes 8}{3 	imes 2 	imes 1} 	imes \frac{5 	imes 4 	imes 3}{3 	imes 2 	imes 1} = 120 	imes 10 = 1200$. Now,calculate the number of ways where both $B_{1}$ and $B_{2}$ are members of the group. If $B_{1}$ and $B_{2}$ are already selected,we need to choose $1$ more boy from the remaining $8$ boys and $3$ girls from the $5$ girls: $= {}^{8}C_{1} 	imes {}^{5}C_{3} = 8 	imes 10 = 80$. The number of ways where $B_{1}$ and $B_{2}$ are not both in the same group is the total ways minus the restricted ways: $= 1200 - 80 = 1120$.

There are ten boys $B_{1}, B_{2}, \ldots, B_{10}$ and five girls $G_{1}, G_{2}, \ldots, G_{5}$ in a class. The number of ways of forming a group consisting of three boys and three girls,such that $B_{1}$ and $B_{2}$ are not both members of the same group,is

Similar Questions

The number of ways in which any four letters can be selected from the word '$CORGOO$' is

There are $5$ apples,$4$ mangoes,$3$ oranges,and $1$ each of $2$ other varieties of fruits. The number of ways of selecting at least one fruit of each kind is

$A$ set contains $(2n + 1)$ elements. The number of subsets of the set which contain at most $n$ elements is:

The number of ways $16$ identical cubes,of which $11$ are blue and the rest are red,can be placed in a row so that between any two red cubes there should be at least $2$ blue cubes,is

If the total number of $m$-element subsets of the set $A = \{a_{1}, a_{2}, \ldots, a_{n}\}$ is $k$ times the number of $m$-element subsets containing $a_{4}$, then $n$ is

Vedclass Test Series

Exam Paper Generator

Online Exam Module