Let's break down each scenario:
Scenario 1: No married couples
We need to choose a committee of n people from n married couples (so 2n individuals in total), with the condition that no two people who are married to each other are allowed to serve on the committee.
This means that from each of the n couples, we can choose at most one person. Since the committee must have n people, we must choose exactly one person from each of the n couples.
For each couple, there are 2 choices (either the husband or the wife). Since there are n couples, and the choices for each couple are independent, the total number of ways to form the committee is 2×2×⋯×2 (n times).
So, the number of different committees that can be formed is (2^n).
Scenario 2: Only married couples
The committee must consist only of married couples, and the committee size is n people.
If the committee consists only of married couples, and each couple has 2 people, then the number of couples on the committee must be n/2.
We need to choose n/2 couples from the n available couples. The order in which we choose the couples does not matter. This is a combination problem.
The number of ways to choose n/2 couples from n couples is given by the binomial coefficient:
[n , n/2] = n!/ {(n/2)!(n−n/2)!}
= n!/{(n/2)!(n/2)!} = n!/{(n/2)!^2}
However, looking at the options, we need to find the one that matches this form. Let's re-examine the options presented to see which one corresponds to this result.
The given options are a mix of formulas. Let's carefully match our derivations to the provided format.
For "No married couples", we derived 2^n.
For "Only married couples", we derived n!/ (n/2)!^2