# Thread: Dividing 3n couples into triplets

1. ## Dividing 3n couples into triplets

There are $\displaystyle 3n$ married couples. In how many ways can they be arranged into triplets, if in each triplet, there must not be a married couple ?

I should solve this using the Principle of Inclusion-Exclusion, but don't really know where to start and how to solve this problem. I'd be very grateful for any help!

2. Let $\displaystyle a_n$ be the desired number and $\displaystyle b_n$ be the number of arrangements into triplets in which, in at least one triplet, there's a married couple. Then $\displaystyle a_n+b_n$ is the total number of arrangements of our 6n persons into triplets. That number is: $\displaystyle C=\binom{ 6n}{3 }\cdot \binom{ 6n-3}{3 }...\binom{ 3}{3 }$

We have: $\displaystyle C =\frac{ (6n)!}{3!\cdot (6n-3)! }\frac{ (6n-3)!}{3!\cdot (6n-6)! }...=\frac{(6n)! }{ 6^{2n} }$

Let's name the married couples as $\displaystyle C_1$ ... $\displaystyle C_{3n}$ each couple is a set of 2 persons. ( they are disjoint)

Consider now $\displaystyle P_k$ to be the set of all arrangements of the 3n couples into triplets such that $\displaystyle C_k$ is included in one triplet. Then the union of $\displaystyle P_1$ ... $\displaystyle P_{3n}$ is $\displaystyle b_n$. Do that by using Inclusion-Exclusion and then remember that $\displaystyle a_n=C-b_n$

3. Originally Posted by PaulRS
Then $\displaystyle a_n+b_n$ is the total number of arrangements of our 6n persons into triplets. That number is: $\displaystyle C=\binom{ 6n}{3 }\cdot \binom{ 6n-3}{3 }...\binom{ 3}{3 }$
Paul, your $\displaystyle C$ counts labeled partitions.
Whereas, groups of three are not labeled. Therefore divide by $\displaystyle (2n)!$.