A group of 9 students, , is to be divided to form three teams , and of sizes 2, 3, and 4, respectively. Suppose that cannot be selected for the team , and cannot be selected for the team . Then the number of ways to form such teams is ________.
First, treat the three teams (size ), (size ) and (size ) as labelled; changing a student from one team to another gives a different arrangement.
Total arrangements without any restriction
Choose the two members of , then the three members of ; the remaining four automatically form :
Introduce two “bad” events:
: student is placed in team (not allowed).
: student is placed in team (not allowed).
We need the count of arrangements that avoid both and . Use the inclusion-exclusion principle:
Number of valid arrangements
Count |A| (arrangements with in )
Fix in , pick one more member for from the remaining students, then form from the remaining students:
Count |B| (arrangements with in )
Fix in , pick two more members for from the remaining students, then form from the remaining students:
Count |A ∩ B| (both in and in )
Place in and choose one more member for from the students other than : .
Now is in ; pick the remaining two members of from the students still free: .
Apply inclusion-exclusion
Hence, the required number of ways to form the teams is 665.
Tagged Combinations and selections with conditions. Machine-assigned, so read it as a strong shortlist rather than a verdict.