RankRizz
JEE MAIN 2026 · 05 APR S1+4 / −1MEDIUMTRANSCRIBED

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

Let A={1,2,3,4,5,6}A = \{1, 2, 3, 4, 5, 6\}. The number of one-one functions f:A→Af: A \to A such that f(1)≥3f(1) \geq 3, f(3)≤4f(3) \leq 4, and f(2)+f(3)=5f(2) + f(3) = 5 is :

SOLUTION

To solve for the number of one-one functions f:A→Af: A \rightarrow A, we need to satisfy three specific conditions while ensuring no two elements in A={1,2,3,4,5,6}A = \{1, 2, 3, 4, 5, 6\} map to the same image.

Since f:A→Af: A \rightarrow A, the values for f(2)f(2) and f(3)f(3) must be distinct elements from the set {1,2,3,4,5,6}\{1, 2, 3, 4, 5, 6\}. The pairs (f(2),f(3))(f(2), f(3)) that sum to 5 are:

  • Case 1: f(2)=1,f(3)=4f(2) = 1, f(3) = 4
  • Case 2: f(2)=4,f(3)=1f(2) = 4, f(3) = 1
  • Case 3: f(2)=2,f(3)=3f(2) = 2, f(3) = 3
  • Case 4: f(2)=3,f(3)=2f(2) = 3, f(3) = 2

All four cases above satisfy f(3)≤4f(3) \le 4. Now we calculate the number of choices for f(1)f(1) for each case, keeping in mind that ff is a one-one function (so f(1)f(1) cannot equal f(2)f(2) or f(3)f(3)).

Case

f(2)

f(3)

Possible values for f(1)∈{3,4,5,6}

No. of choices for f(1)

1

1

4

{3,5,6}\{3, 5, 6\} (excluding 4)

3

2

4

1

{3,5,6}\{3, 5, 6\} (excluding 4)

3

3

2

3

{4,5,6}\{4, 5, 6\} (excluding 3)

3

4

3

2

{4,5,6}\{4, 5, 6\} (excluding 3)

3

Total ways to assign f(1),f(2), and f(3)f(1), f(2), \text{ and } f(3):

3+3+3+3=123 + 3 + 3 + 3 = 12 ways.

For each of the 12 ways identified above, we have 3 elements left in the domain {4,5,6}\{4, 5, 6\} and 3 elements remaining in the codomain. Since the function is one-one, these 3 elements can be mapped in 3!3! ways.

3!=3×2×1=6 ways3! = 3 \times 2 \times 1 = 6 \text{ ways}

Total number of one-one functions = (Ways to pick f(1),f(2),f(3)f(1), f(2), f(3)) ×\times (Ways to arrange remaining elements)

Total=12×6=72\text{Total} = 12 \times 6 = 72

Final Answer: 72

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