RankRizz
JEE MAIN 2015 · 11 APR ONLINE+4 / −1MEDIUMTRANSCRIBED

JEE Main 2015 Mathematics question — Distribution and grouping of distinct objects

Let A={x1,x2,…,x7}A = \{x_1, x_2, \ldots, x_7\} and B={y1,y2,y3}B = \{y_1, y_2, y_3\} be two sets containing seven and three distinct elements respectively. Then the total number of functions f:A→Bf : A \rightarrow B that are onto, if there exist exactly three elements xx in AA such that f(x)=y2f(x) = y_2, is equal to:

SOLUTION

We are asked to count all onto (surjective) functions f:A→Bf : A \rightarrow B under the extra condition that exactly three elements of AA go to the element y2∈By_2 \in B. We begin by recalling what an onto function means. A function ff is onto when every element of the codomain BB has at least one pre-image in the domain AA, i.e. for each y∈By \in B there exists at least one x∈Ax \in A with f(x)=yf(x) = y.

First we handle the condition about y2y_2. We are told that there are exactly three elements xx in AA such that f(x)=y2f(x) = y_2. To choose which elements of AA they are, we compute

7C3^7C_3

because AA contains seven distinct elements and we must select three of them. After this choice is made, these three elements are permanently assigned the image y2y_2.

We now investigate what happens to the remaining elements of AA. Once three elements are fixed for y2y_2, there are 7−3=47 - 3 = 4 elements of AA left. Call this leftover set A′A'. These four elements must be mapped into the remaining two elements of BB, namely y1y_1 and y3y_3.

Because the overall function is required to be onto, each of y1y_1 and y3y_3 must appear at least once as a value of ff. So, when distributing the four elements of A′A', neither y1y_1 nor y3y_3 can be missed. We count these distributions carefully.

For each of the four elements in A′A' we have two immediate choices: send it to y1y_1 or send it to y3y_3. Ignoring the “at least once” restriction for the moment, this yields 242^4 possibilities. Now we subtract the two unacceptable allocations—either “all go to y1y_1” or “all go to y3y_3”. Hence the number of admissible ways is

24−2  =  16−2  =  14.2^4 - 2 \;=\; 16 - 2 \;=\; 14.

Putting the two independent selections together—first the choice of which three elements map to y2y_2, and then the admissible distribution of the remaining four elements between y1y_1 and y3y_3—we multiply the counts:

Total onto functions  =  7C3×14.\text{Total onto functions} \;=\; {^7C_3} \times 14.

Thus the required number is 14⋅7C314 \cdot {^7C_3}.

Hence, the correct answer is Option C.

Tagged Distribution and grouping of distinct objects. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicDistribution and grouping of distinct objects
TypeMultiple choice