The number of functions f from onto such that is a multiple of 3, whenever k is a multiple of 4 is:
We have the domain and the codomain
The condition “ is a multiple of whenever is a multiple of ” affects exactly the five domain points
and forces their images to lie in the six-element set
The remaining fifteen domain points
are free to go anywhere in but the whole function must be onto, i.e. every element of must appear at least once as a value.
Because the points of never hit the elements
those elements must be hit by the points of Hence the images of the set have to cover all the elements of , leaving at most one point of that may go to
Therefore two distinct cases are possible:
• Case 1 : exactly one element of goes to .
• Case 2 : no element of goes to .
Case 2 is impossible, because then the five images of could cover at most five elements of , leaving one element of unmapped and destroying surjectivity. So only Case 1 survives.
Proceeding with Case 1 step by step:
1. Choose the single element of that will go to : possibilities.
2. Choose its image inside : possibilities.
3. The remaining elements of must now hit the elements of bijectively (no element of may be missed): that gives different mappings.
4. At this stage exactly one element of is already hit (the one chosen in step 2), so the five images of must cover the other five elements of They must therefore form a bijection between the set and giving possibilities.
5. The choices in steps 1-4 are independent, so we multiply:
Thus the required number of onto functions is This matches Option C.
Hence, the correct answer is Option C.
Tagged One-one, onto functions and counting functions. Machine-assigned, so read it as a strong shortlist rather than a verdict.