RankRizz
JEE MAIN 2021 · 22 JUL S1+4MEDIUMTRANSCRIBED

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

Let A={0,1,2,3,4,5,6,7}A = \{0, 1, 2, 3, 4, 5, 6, 7\}. Then the number of bijective functions f:A→Af : A \to A such that f(1)+f(2)=3−f(3)f(1) + f(2) = 3 - f(3) is equal to ___.

SOLUTION

We need bijective functions f:A→Af : A \to A where A={0,1,2,3,4,5,6,7}A = \{0, 1, 2, 3, 4, 5, 6, 7\} satisfying f(1)+f(2)=3−f(3)f(1) + f(2) = 3 - f(3), i.e., f(1)+f(2)+f(3)=3f(1) + f(2) + f(3) = 3.

Since ff is a bijection (permutation of AA), the values f(1),f(2),f(3)f(1), f(2), f(3) must be three distinct elements of AA that sum to 3.

We need to find all sets of three distinct non-negative integers from {0,1,2,3,4,5,6,7}\{0, 1, 2, 3, 4, 5, 6, 7\} that sum to 3. The possible unordered sets are:

{0,1,2}\{0, 1, 2\}: sum =0+1+2=3= 0 + 1 + 2 = 3. This works.

No other triple of distinct non-negative integers from AA sums to 3, since the next smallest sum of three distinct elements would be 0+1+3=40 + 1 + 3 = 4.

So {f(1),f(2),f(3)}={0,1,2}\{f(1), f(2), f(3)\} = \{0, 1, 2\}. The three values can be assigned to f(1),f(2),f(3)f(1), f(2), f(3) in 3!=63! = 6 ways.

The remaining 5 inputs {0,4,5,6,7}\{0, 4, 5, 6, 7\} must map to the remaining 5 outputs {3,4,5,6,7}\{3, 4, 5, 6, 7\}, and these can be assigned in 5!=1205! = 120 ways.

The total number of bijective functions is 6×120=7206 \times 120 = 720.

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