RankRizz
JEE MAIN 2017 · 02 APR OFFLINE+4 / −1MEDIUMTRANSCRIBED

JEE Main 2017 Mathematics question — Combinations and selections with conditions

A man XX has 7 friends, 4 of them are ladies and 3 are men. His wife YY also has 7 friends, 3 of them are ladies and 4 are men. Assume XX and YY have no common friends. Then the total number of ways in which XX and YY together can throw a party inviting 3 ladies and 3 men, so that 3 friends of each of XX and YY are in this party is:

SOLUTION

We begin by noting the exact data given in the statement. Man XX has 77 friends, split as 44 ladies and 33 men. His wife YY also has 77 friends, split as 33 ladies and 44 men. It is clearly stated that there is no common friend between the two sets, so a person cannot be a friend of both XX and YY.

For the party we must invite exactly 66 people in all - specifically 33 ladies and 33 men - and, in addition, exactly 33 of the six must be friends of XX while the remaining 33 must be friends of YY. 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

LX=number of ladies chosen from X’s friends,L_X=\text{number of ladies chosen from }X\text{'s friends}, LY=number of ladies chosen from Y’s friends.L_Y=\text{number of ladies chosen from }Y\text{'s friends}.

Because each of them contributes exactly three friends, the number of men chosen from XX’s friends is 3−LX3-L_X and the number of men chosen from YY’s friends is 3−LY3-L_Y.

Since the total number of ladies invited must be 33, we have the key equation

LX+LY=3.L_X+L_Y=3.

Each of LXL_X and LYL_Y can range from 00 to 33, subject to the supplies of ladies each one actually has (remember XX has 44 available ladies, YY has 33). The admissible ordered pairs (LX,LY)\bigl(L_X,L_Y\bigr) satisfying the equation are therefore:

(0,3),(1,2),(2,1),(3,0).\begin{aligned} &(0,3),\\ &(1,2),\\ &(2,1),\\ &(3,0). \end{aligned}

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:

(nr)=n!r!(n−r)!,\binom{n}{r}=\dfrac{n!}{r!(n-r)!},

which counts the number of ways to choose rr objects from nn distinct objects without regard to order.

We evaluate case by case.

Case (LX,LY)=(0,3)(L_X,L_Y)=(0,3)

X:(40)×(33)=1×1=1,X: \binom{4}{0}\times\binom{3}{3}=1\times1=1, Y:(33)×(40)=1×1=1,Y: \binom{3}{3}\times\binom{4}{0}=1\times1=1, so the total for this case is 1×1=1.1\times1=1.

Case (LX,LY)=(1,2)(L_X,L_Y)=(1,2)

X:(41)×(32)=4×3=12,X: \binom{4}{1}\times\binom{3}{2}=4\times3=12, Y:(32)×(41)=3×4=12,Y: \binom{3}{2}\times\binom{4}{1}=3\times4=12, and therefore the total here is 12×12=144.12\times12=144.

Case (LX,LY)=(2,1)(L_X,L_Y)=(2,1)

X:(42)×(31)=6×3=18,X: \binom{4}{2}\times\binom{3}{1}=6\times3=18, Y:(31)×(42)=3×6=18,Y: \binom{3}{1}\times\binom{4}{2}=3\times6=18, giving 18×18=32418\times18=324 ways for this pattern.

Case (LX,LY)=(3,0)(L_X,L_Y)=(3,0)

X:(43)×(30)=4×1=4,X: \binom{4}{3}\times\binom{3}{0}=4\times1=4, Y:(30)×(43)=1×4=4,Y: \binom{3}{0}\times\binom{4}{3}=1\times4=4, so the count for this case is 4×4=16.4\times4=16.

Finally, we add all the mutually exclusive cases:

1+144+324+16=485.1+144+324+16 = 485.

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.

TopicCombinations and selections with conditions
TypeMultiple choice