Three children,each accompanied by a guardian | vedclass

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

Question

(B) Let the children be $C_1, C_2, C_3$ and their respective guardians be $G_1, G_2, G_3$.There are $6$ persons in total.The condition is that for eac

Vedclass · Accepted Answer

$90$

Vedclass · Answer

(B) Let the children be $C_1, C_2, C_3$ and their respective guardians be $G_1, G_2, G_3$.There are $6$ persons in total.The condition is that for each pair $(G_i, C_i)$,the guardian $G_i$ must be interviewed before the child $C_i$.In any arrangement of $6$ persons,there are $2!$ ways to arrange the pair $(G_i, C_i)$ such that $G_i$ comes before $C_i$ or $C_i$ comes before $G_i$.Since there are $3$ such pairs,the total number of unrestricted arrangements is $6!$.For each pair,only $1$ out of $2!$ arrangements is valid (i.e.,$G_i$ before $C_i$).Thus,the number of valid ways is $\frac{6!}{2! 	imes 2! 	imes 2!} = \frac{720}{8} = 90$.

Three children,each accompanied by a guardian,seek admission in a school. The principal wants to interview all the $6$ persons one after the other subject to the condition that no child is interviewed before its guardian. In how many ways can this be done?

Similar Questions

Given $5$ flags of different colours,how many different signals can be generated if each signal requires the use of $2$ flags,one below the other?

If four-digit numbers are formed by using the digits $1, 2, 3, 4, 5, 6, 7$ without repetition,then how many of these numbers are exactly divisible by $25$?

If the letters of the word $COCHIN$ are rearranged and all permutations are arranged in alphabetical order as in an English dictionary,how many words appear before the word $COCHIN$?

How many ways are there to arrange the letters of the word $EDUCATION$ so that all the following three conditions hold?
- The vowels occur in the same order $(E, U, A, I, O)$.
- The consonants occur in the same order $(D, C, T, N)$.
- No two consonants are next to each other.

In how many ways can the letters of the word $ASSASSINATION$ be arranged so that all the $S$'s are together?

Vedclass Test Series

Exam Paper Generator

Online Exam Module