A man has 7 friends, 4 of them are ladies and 3 are men. His wife also has 7 friends, 3 of them are ladies and 4 are men. Assume and have no common friends. Then the total number of ways in which and together can throw a party inviting 3 ladies and 3 men, so that 3 friends of each of and are in this party is:
We begin by noting the exact data given in the statement. Man has friends, split as ladies and men. His wife also has friends, split as ladies and men. It is clearly stated that there is no common friend between the two sets, so a person cannot be a friend of both and .
For the party we must invite exactly people in all - specifically ladies and men - and, in addition, exactly of the six must be friends of while the remaining must be friends of . Thus each of the couple contributes precisely three of his / her own friends to the guest list.
Let us describe the composition of the three friends chosen from each side. Put
Because each of them contributes exactly three friends, the number of men chosen from ’s friends is and the number of men chosen from ’s friends is .
Since the total number of ladies invited must be , we have the key equation
Each of and can range from to , subject to the supplies of ladies each one actually has (remember has available ladies, has ). The admissible ordered pairs satisfying the equation are therefore:
For every such pair we now compute how many ways the selections can be made. Throughout, we use the standard combination formula, stated here for clarity:
which counts the number of ways to choose objects from distinct objects without regard to order.
We evaluate case by case.
Case
so the total for this case is
Case
and therefore the total here is
Case
giving ways for this pattern.
Case
so the count for this case is
Finally, we add all the mutually exclusive cases:
Hence, the correct answer is Option A.
Tagged Combinations and selections with conditions. Machine-assigned, so read it as a strong shortlist rather than a verdict.