RankRizz
JEE MAIN 2020 · 05 SEP S2+4MEDIUMTRANSCRIBED

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

Let A={a,b,c}A = \{a, b, c\} and B={1,2,3,4}B = \{1, 2, 3, 4\}. Then the number of elements in the set C={f:A→B∣2∈f(A)C = \{f : A \to B \mid 2 \in f(A) and ff is not one-one}\} is...

SOLUTION

We have A={a,  b,  c}A = \{a,\; b,\; c\} so ∣A∣=3|A| = 3, and B={1,  2,  3,  4}B = \{1,\; 2,\; 3,\; 4\} so ∣B∣=4|B| = 4. A function f:A→Bf : A \to B assigns to every element of AA exactly one element of BB.

First, recall that the total number of all possible functions from a set with mm elements to a set with nn elements is n mn^{\,m} because each element of the domain has nn independent choices. Here, m=3m = 3 and n=4n = 4, so the total number of functions is

4 3=64.4^{\,3} = 64.

We are interested only in those functions which satisfy two simultaneous conditions:

(i) 2∈f(A)  ,2 \in f(A)\;, meaning that at least one element of AA is mapped to 22.

(ii) ff is not one-one (not injective), i.e. at least two elements of AA share the same image.

We shall count functions satisfying (i) first, then remove those that violate (ii). Let us denote by N1N_1 the number of functions satisfying (i) and by N1, injN_{1,\,\text{inj}} the number of those functions which are also injective. The desired count will therefore be

N=N1  −  N1, inj.N = N_1 \;-\; N_{1,\,\text{inj}}.

Counting N1N_1 - functions with 22 in the image.

Consider the complementary set of functions where 22 never appears. For every element of AA we then have only {1,3,4}\{1,3,4\} available, that is 33 choices per element. Hence the number of such functions is

3 3=27.3^{\,3} = 27.

By subtraction, the number of functions that do include 22 is

N1=64  −  27=37.N_1 = 64 \;-\; 27 = 37.

Counting N1, injN_{1,\,\text{inj}} - injective functions with 22 in the image.

A function from a set of 33 elements to a set of 44 elements is injective exactly when it assigns three distinct images. The total number of injective functions is therefore the number of permutations of any 33 distinct elements chosen from 44, which is the permutation number

P(4,3)=4×3×2=24.P(4,3) = 4 \times 3 \times 2 = 24.

Among these, let us identify how many avoid the value 22 entirely; such functions must use the three values 1,3,41,3,4. There is only one way to choose these three values, and they can be arranged in P(3,3)=3×2×1=6P(3,3) = 3 \times 2 \times 1 = 6 ways. Hence

Injective functions without 2=6.\text{Injective functions without }2 = 6.

Consequently, the injective functions that do contain 22 are

N1, inj=24  −  6=18.N_{1,\,\text{inj}} = 24 \;-\; 6 = 18.

Final subtraction.

We now exclude these 1818 injective functions from the 3737 functions that contain 22:

N=37  −  18=19.N = 37 \;-\; 18 = 19.

So, the answer is 1919.

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
TypeNumerical answer