RankRizz
JEE MAIN 2019 · 11 JAN S2+4 / −1MEDIUMTRANSCRIBED

JEE Main 2019 Mathematics question — One-one, onto functions and counting functions

The number of functions f from {1,2,3,…,20}\{1, 2, 3, \ldots, 20\} onto {1,2,3,…,20}\{1, 2, 3, \ldots, 20\} such that f(k)f(k) is a multiple of 3, whenever k is a multiple of 4 is:

SOLUTION

We have the domain D={1,2,3,…,20}D=\{1,2,3,\ldots ,20\} and the codomain S={1,2,3,…,20}.S=\{1,2,3,\ldots ,20\}.

The condition “f(k)f(k) is a multiple of 33 whenever kk is a multiple of 44” affects exactly the five domain points

A={4,8,12,16,20}A=\{4,8,12,16,20\}

and forces their images to lie in the six-element set

B={3,6,9,12,15,18}.B=\{3,6,9,12,15,18\}.

The remaining fifteen domain points

C=D∖A,∣C∣=15C=D\setminus A,\qquad |C|=15

are free to go anywhere in S,S, but the whole function must be onto, i.e. every element of SS must appear at least once as a value.

Because the points of AA never hit the 1414 elements

B′=S∖B={1,2,4,5,7,8,10,11,13,14,16,17,19,20},B' = S\setminus B=\{1,2,4,5,7,8,10,11,13,14,16,17,19,20\},

those 1414 elements must be hit by the points of C.C. Hence the 1515 images of the set CC have to cover all the 1414 elements of B′B', leaving at most one point of CC that may go to B.B.

Therefore two distinct cases are possible:

• Case 1 : exactly one element of CC goes to BB.
• Case 2 : no element of CC goes to BB.

Case 2 is impossible, because then the five images of AA could cover at most five elements of BB, leaving one element of BB unmapped and destroying surjectivity. So only Case 1 survives.

Proceeding with Case 1 step by step:

1. Choose the single element of CC that will go to BB: (151)=15\binom{15}{1}=15 possibilities.

2. Choose its image inside BB: 66 possibilities.

3. The remaining 1414 elements of CC must now hit the 1414 elements of B′B' bijectively (no element of B′B' may be missed): that gives 14!14! different mappings.

4. At this stage exactly one element of BB is already hit (the one chosen in step 2), so the five images of AA must cover the other five elements of B.B. They must therefore form a bijection between the set AA and B∖{chosen element},B\setminus\{\text{chosen element}\}, giving 5!5! possibilities.

5. The choices in steps 1-4 are independent, so we multiply:

15×6×14!×5!  =  (15×14!)×(6×5!)  =  15!×6!.15 \times 6 \times 14! \times 5! \;=\; (15 \times 14!) \times (6 \times 5!) \;=\; 15! \times 6!.

Thus the required number of onto functions is 15!×6!.15! \times 6!. 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.

ChapterFunctions
TopicOne-one, onto functions and counting functions
TypeMultiple choice