RankRizz
JEE MAIN 2026 · 21 JAN S1+4 / −1MEDIUMTRANSCRIBED

JEE Main 2026 Mathematics question — Combinations and selections with conditions

The number of strictly increasing functions f from the set {1, 2, 3, 4, 5, 6} to the set {1, 2, 3, ... , 9} such that f(i)≠i for 1≤i≤6f(i)\neq i \text{ for }1\leq i\leq 6, is equal to:

SOLUTION

For a strictly increasing function on integers, , so for every .

If , the condition fails. If , then , so holds for every .

So the required functions are exactly the strictly increasing functions whose values all lie in .

A strictly increasing function is fixed by its set of 6 values, assigned to in increasing order, so the count equals the number of 6-element subsets of the 8-element set :

Hence, the correct option is (D).

Tagged Combinations and selections with conditions. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicCombinations and selections with conditions
TypeMultiple choice