Let and be two sets containing seven and three distinct elements respectively. Then the total number of functions that are onto, if there exist exactly three elements in such that , is equal to:
We are asked to count all onto (surjective) functions under the extra condition that exactly three elements of go to the element . We begin by recalling what an onto function means. A function is onto when every element of the codomain has at least one pre-image in the domain , i.e. for each there exists at least one with .
First we handle the condition about . We are told that there are exactly three elements in such that . To choose which elements of they are, we compute
because contains seven distinct elements and we must select three of them. After this choice is made, these three elements are permanently assigned the image .
We now investigate what happens to the remaining elements of . Once three elements are fixed for , there are elements of left. Call this leftover set . These four elements must be mapped into the remaining two elements of , namely and .
Because the overall function is required to be onto, each of and must appear at least once as a value of . So, when distributing the four elements of , neither nor can be missed. We count these distributions carefully.
For each of the four elements in we have two immediate choices: send it to or send it to . Ignoring the “at least once” restriction for the moment, this yields possibilities. Now we subtract the two unacceptable allocations—either “all go to ” or “all go to ”. Hence the number of admissible ways is
Putting the two independent selections together—first the choice of which three elements map to , and then the admissible distribution of the remaining four elements between and —we multiply the counts:
Thus the required number is .
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.