Bunuel
A woman has 11 close friends. What is the number of ways she can invite 5 of them to dinner if two of the friends are not speaking with each other and will not attend together?
A. 84
B. 126
C. 210
D. 252
E. 378
A woman has 11 close friends. Find the number of ways she can invite 5 of them to dinner where: Two of the friends are not speaking with each other and will not attend together
There are some great answers posted above! I just wanted to point out that we can likely save some time if we are comfortable with ballparking and deploying a little logic. There are 11C5 ways to choose the invitees with no restrictions. That's 11*10*9*8*7/5*4*3*2 = 77*2*3 = a little less than 6*80, or 480.
There are four possible scenarios:
both enemies are invited,
enemy A is invited but B is not,
enemy B is invited but A is not, or
neither enemy is invited.
We need to exclude "both enemies are invited." Is that going to be more than half or less than half of the total possibilities? Less than half. A, B, and C are wrong. D and E are pretty far apart. D would require us to exclude almost half. Is "both enemies are invited" in almost half of the arrangements or far fewer than that? Well, there are 6 people not invited to dinner, so it's more likely to have "neither enemy is invited" than it is to have "both enemies are invited." D is wrong.
Answer choice E.