The number of all onto functions from the set \(\{1, 2, \ldots, n\}\) to itself is
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → n!
For a function from a finite set to itself, onto and one-one go together: if all n elements are images, the n elements of the domain must go to n different images. So an onto function here is a one-one correspondence (a bijection).
Counting the bijections:
1 can go to any of n elements
2 can go to any of the remaining n − 1 elements
and so on, down to 1 choice for n
\(\text{Number} = n(n-1)(n-2)\cdots 1 = n!\)
NCERT (2026-27 edition):
Relations and Functions
