A student council must select a two-person welcoming committee and a three-person planning committee from among its members. There are exactly 10 ways to select a two-person team for the welcoming committee. It is possible for students to serve on both committees. In how many different ways can a three-person planning committee be selected?
- A)
- B)
- C)
- D)
- E)
Answer
A
Key insight
C(n,2) = 10 forces n = 5 council members, and C(5,3) = C(5,2) = 10 by the symmetry of binomial coefficients.
Solution
Let the council have members. The number of two-person teams is , and we are told this equals , so . Since , the council has members.
Because overlap between the committees is allowed, the planning committee is simply any of the members:
The answer is .
Why this works
The problem hides the group size behind a count; recovering from is the only real step. After that, because choosing the people who serve is the same as choosing the who do not, which is why the two counts coincide.
The trap
Assuming the two committees must be disjoint and computing C(3,3) or similar, when the problem says members may serve on both.
Common mistakes
- Assuming the two committees must be disjoint and computing C(3,3) or similar, when the problem says members may serve on both.
- Using as the council size and answering (not even a choice, but it wastes time).
Techniques
Set up the equation/formula and compute; no special trick needed · Test small/specific values or special cases to find or verify the answer