Firstly, observe that we have "n" couples, so "2n" people to choose from; and we need to for a committee of "n" people
No married couples:The first person can be chosen in 2n ways
The next person can be chosen in 2n-2 ways (1 person has already been selected and his/her spouse cannot be selected)
The next person, similarly, can be chosen in 2n-4 ways
The total number of ways are: (2n)(2n-2)(2n-4)...
But we need to account for repetition as well, since we are choosing from the same pool of "2n" people. Since we are selecting n people out of them, we divide this by n!
So we get: \(\frac{(2n)(2n-2)(2n-4)...}{n!}\)
Taking 2 common from the numerator of each term, we get:
\(\frac{2^n(n-1)(n-2).....}{n!}\)
Notice how the expression after \(2^n\), is nothing but n!; so that cancels out giving us:
Total number of ways for selecting no married couples as \(2^n\)
Married couples only:We know that \(n\) couples have \(2n\) people
So, \(\frac{n}{2}\) couples will have \(n\) people
Since, we need to select\(n\) people for the final arrangement and all of them have to be married, we can just select \(\frac{n}{2}\) couples from the \(n\) couples that we have and that will give us \(n\) people who are married to each other
We can do that by:\( C^n_\frac{n}{2}\)
which is nothing but: \(\frac{n!}{(n/2)! (n/2)!}\)
Answer:
No married couples: \(2^n\)
Only married couples: \(\frac{n!}{(n/2)! (n/2)!}\)