Let n be the number of ways in which 5 boys a | vedclass

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

Question

(A) For $n$: Treat the $5$ girls as a single block. We have $5$ boys and $1$ block of girls,totaling $6$ entities. These can be arranged in $6!$ ways.

Vedclass · Accepted Answer

$5$

Vedclass · Answer

(A) For $n$: Treat the $5$ girls as a single block. We have $5$ boys and $1$ block of girls,totaling $6$ entities. These can be arranged in $6!$ ways. The $5$ girls can be arranged among themselves in $5!$ ways. Thus,$n = 6! 	imes 5!$.For $m$: We want exactly $4$ girls to stand consecutively. First,choose $4$ girls out of $5$ in $^5C_4 = 5$ ways.Treat these $4$ girls as a single block. We now have $5$ boys and $1$ block of $4$ girls,and $1$ remaining girl,totaling $7$ entities.To ensure exactly $4$ girls are together,we arrange these $7$ entities in $7!$ ways,then subtract cases where the $5$th girl is adjacent to the block of $4$ (which would make $5$ girls together). The number of ways to arrange $7$ entities such that the $5$th girl is not adjacent to the block is $(7! - 2 	imes 6!)$.Finally,multiply by the internal arrangements of the $4$ girls $(4!)$ and the $5$ ways to choose them: $m = 5 	imes (7! - 2 	imes 6!) 	imes 4! = 5 	imes (7 	imes 6! - 2 	imes 6!) 	imes 4! = 5 	imes 5 	imes 6! 	imes 4!$.Calculating $\frac{m}{n} = \frac{25 	imes 6! 	imes 4!}{6! 	imes 5!} = \frac{25 	imes 24}{120} = \frac{600}{120} = 5$.

Let $n$ be the number of ways in which $5$ boys and $5$ girls can stand in a queue such that all the girls stand consecutively. Let $m$ be the number of ways in which $5$ boys and $5$ girls can stand in a queue such that exactly four girls stand consecutively. Then the value of $\frac{m}{n}$ is

Similar Questions

The remainder obtained when $1! + 2! + 3! + \dots + 11!$ is divided by $12$ is

The number of $6$-letter words,with or without meaning,that can be formed using the letters of the word $\text{MATHS}$ such that any letter that appears in the word must appear at least twice,is $...$

Let $m$ (respectively,$n$) be the number of $5$-digit integers obtained by using the digits $1, 2, 3, 4, 5$ with repetitions (respectively,without repetitions) such that the sum of any two adjacent digits is odd. Then $\frac{m}{n}$ is equal to

The numbers $1, 2, 3, \ldots, n$ are arranged in a random order. The probability that the digits $1, 2, 3, \ldots, k$ appear as a block in that order is:

The number of integers lying between $1000$ and $10000$ such that every number contains the digits $3$ and $7$ exactly once without repetition is:

Vedclass Test Series

Exam Paper Generator

Online Exam Module