RankRizz
JEE MAIN 2019 · 12 JAN S1+4 / −1MEDIUMTRANSCRIBED

JEE Main 2019 Mathematics question — Combinations and selections with conditions

Consider three boxes, each containing 10 balls labelled 1, 2, ..., 10. Suppose one ball is randomly drawn from each of the boxes. Denote by nin_i, the label of the ball drawn from the ithi^{th} box, (i=1,2,3)(i = 1, 2, 3). Then, the number of ways in which the balls can be chosen such that n1<n2<n3n_1 < n_2 < n_3 is:

SOLUTION

We have three separate boxes, and each box contains the ten balls whose labels are the integers 1,2,3,…,101,2,3,\ldots ,10. From every box exactly one ball is drawn, so we obtain an ordered triple of labels (n1,n2,n3)(n_1,n_2,n_3) where n1n_1 comes from the first box, n2n_2 from the second, and n3n_3 from the third.

The condition given in the question is n1<n2<n3n_1 \lt n_2 \lt n_3. Because of the two “<” symbols, the three numbers must be pairwise distinct; no two of them can be equal.

Since each box possesses every label from 1 to 10, once we decide which number is to be n1n_1, which is to be n2n_2, and which is to be n3n_3, there is exactly one way to realise that decision: we simply pick the ball carrying that label from the corresponding box. Thus the whole counting problem reduces to selecting the three distinct labels themselves.

So we only have to count the number of different subsets of three distinct numbers that can be taken from the set {1,2,3,…,10}\{1,2,3,\ldots ,10\}. After choosing the three numbers, we automatically arrange them in increasing order to become n1,n2,n3n_1,n_2,n_3, so no further permutations are possible or needed.

To count such subsets we use the combination formula. The number of ways of choosing rr objects out of nn distinct objects is given by (nr)=n!r! (n−r)!.\binom{n}{r}=\frac{n!}{r!\,(n-r)!}. Here n=10n=10 and r=3r=3, hence (103)=10!3! (10−3)!=10×9×8×7!3×2×1×7!=7206=120.\binom{10}{3}= \frac{10!}{3!\,(10-3)!}= \frac{10\times9\times8\times7!}{3\times2\times1\times7!}= \frac{720}{6}=120.

Therefore there are 120120 favourable triples (n1,n2,n3)(n_1,n_2,n_3) satisfying n1<n2<n3n_1 \lt n_2 \lt n_3.

Hence, the correct answer is Option C.

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