Three children, each accompanied by a guardian,seek admission in a school. The principal wants to interview all the 6 one after the other subject to the condition that no child is interviewed before its guardian. In how many ways can this be done? (please give a detailed answer)
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Your problem is the same of anagramming the letters AABBCC:
2!2!2!6!
Take a children and his guardian as equal things. Once they are ordered, the guardian is always the first occurrence of the couple.