JEE Main 21 January 2026 Shift 1: Mathematics Question 8
The number of strictly increasing functions from the set , , , , , to the set , , , , such that for , is equal to:
Show answer and solution
Correct answer: Option 4
A strictly increasing integer-valued function satisfies . If , the condition fails at . Thus an admissible function must have .
Conversely, if , strict increase gives for every , so none of the values equals its input. Therefore the required functions are precisely those whose six distinct output values are chosen from , , , .
Any six-element subset of these eight numbers determines exactly one increasing function, by assigning the selected numbers in ascending order. The count is , .
