[Math] In how many ways can $5$ people be selected from $10$ married couples so that no $2$ of the selected people are married

binomial-coefficientscombinationscombinatorics

I ran into a problem in a textbook and though the solution in the book makes sense, I don’t know why my solution of it wouldn’t work.

So the question is about how there are 20 people, which are 10 groups of married people. The question asks how do we determine the number of ways that we can select 5 people out of the twenty, making sure no 2 people in that group of 5 are married.

The answer was to first select five groups of the ten married groups, then pick 1 person of the five married groups to achieve the result:
$$\binom{10}{5}\binom{2}{1}^5$$

I just don’t understand how they can use the binomial coefficient $\binom{10}{5}$ to pick the group of married couples.

How come we can’t split the $20$ people into two groups: the husbands and the wives? Then we choose one group of those two, then choose five of the ten people left. That would result to:
$$\binom{2}{1}\binom{10}{5}$$
which is incorrect. What am I failing to understand with my answer?

Best Answer

By choosing five of the ten married couples, we ensure that no two people we select are from the same couple. For each such selected couple, we have the option of selecting either the husband or the wife, which is why the number of permissible selections is $$\binom{10}{5}\binom{2}{1}^5$$

Where did you go wrong in your attempt?

For simplicity, let's assume that there are $10$ opposite sex couples. By selecting the husbands or the wives, then selecting five people from the selected group, you only permit selections of five people of the same sex. However, the way the problem is stated we may select both men and women provided that our selection does not include both members of a married couple.

Related Question