Bunuel
Andrew, a math teacher, needs to choose a team to send to a math competition. \ Two of his best students, Maria and Nathan, refuse to work together. If Andrew has twelve students to choose from, and he must choose either Maria or Nathan so that he sends a strong team, how many possible five-person teams can he send?
A. 120
B. 252
C. 420
D. 792
E. 1320
We need to determine the number of ways Andrew can select a team with either Maria or Nathan.
If Maria is selected for the team but Nathan is not, the team can be selected in 10C4 ways (since Maria definitely makes the team and Nathan does not):
10C4 = (10 x 9 x 8 x 7)/4! = (10 x 9 x 8 x 7)/(4 x 3 x 2 x 1) = 10 x 3 x 7 = 210 ways
Since there are an additional 210 ways in which the team could be created (with Nathan and without Maria), Andrew can select the team in 210 + 210 = 420 ways.
Answer: C
Favorable outcomes=Total outcomes-Unfavorable outcomes (when Maria and Nathan are together in the team)
Favorable outcomes=12!/7!5!-10!/3!7! (we have placed Maria and Nathan to the team of five and need to add other 3 people from the rest of 10 students) = 672
Thanks.