The number of ways of selecting 15 teams from | vedclass

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

Question

(B) To form $15$ teams,each consisting of one man and one woman from $15$ men and $15$ women,we proceed as follows:$1$. For the first team,we can sele

Vedclass · Accepted Answer

$(15!)^2$

Vedclass · Answer

(B) To form $15$ teams,each consisting of one man and one woman from $15$ men and $15$ women,we proceed as follows:$1$. For the first team,we can select $1$ man out of $15$ in $15$ ways and $1$ woman out of $15$ in $15$ ways. Total ways = $15 	imes 15$.$2$. For the second team,we select $1$ man out of the remaining $14$ and $1$ woman out of the remaining $14$. Total ways = $14 	imes 14$.$3$. Continuing this process,the total number of ways to form the teams is the product of the number of ways to form each team:Total ways = $(15 	imes 15) 	imes (14 	imes 14) 	imes \dots 	imes (1 	imes 1)$Total ways = $(15 	imes 14 	imes \dots 	imes 1) 	imes (15 	imes 14 	imes \dots 	imes 1)$Total ways = $(15!)^2$.

The number of ways of selecting $15$ teams from $15$ men and $15$ women,such that each team consists of one man and one woman,is

Similar Questions

There are three sections in a question paper,each containing $4$ questions. If a candidate has to answer only $5$ questions from this paper without leaving any section,then the number of ways the candidate can make the choice of questions is:

If $_n{P_4} = 24 \times \binom{n}{5}$,then $n = \dots$

The tens digit of the sum $1! + 4! + 7! + 10! + 12! + 13! + 16! + 17!$ is divisible by which of the following?

The number of $5$-digit numbers that are not divisible by $5$ and consist of different odd digits is:

If $\frac{{}^{n + 2}C_6}{{}^{n - 2}P_2} = 11$,then $n$ satisfies the equation

Vedclass Test Series

Exam Paper Generator

Online Exam Module