In how many ways can juniors and seniors form disjoint teams of people so that each team has juniors and seniors?
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
Split the juniors into three unordered pairs (15 ways), the seniors likewise (15 ways), then match junior pairs with senior pairs (3! ways): 15·15·6 = 1350.
Solution
First pair up the juniors. Choosing pairs in order gives , but the three pairs are not ordered, so divide by : there are ways to split the juniors into three pairs. By the same count there are ways to split the seniors into three pairs.
Now each junior pair must be joined with one senior pair. Matching three junior pairs to three senior pairs is a permutation: ways.
Total: .
The answer is .
Why this works
Teams are unordered, so whenever you pick them one at a time you must divide by the number of orders. Building the answer as "pair the juniors, pair the seniors, then match" makes every factor a small familiar count and forces you to notice that the matching step is a bijection between two sets of three pairs.
Alternative approach
Count with labeled teams, then unlabel: Team 1 takes choices, Team 2 takes , Team 3 takes the rest; that is labeled outcomes, and dividing by gives .
The trap
Treating the three teams as labeled, which overcounts by 3! and gives 8100; or omitting the 3! matching factor and getting 225.
Common mistakes
- Treating the three teams as labeled, which overcounts by 3! and gives 8100; or omitting the 3! matching factor and getting 225.
- Dividing by twice (once for juniors and once for seniors) after already matching the pairs.
Techniques
Set up the equation/formula and compute; no special trick needed · Exploit symmetry to reduce work or pair up objects