Home › JEE Advanced › Mathematics › Relations and Functions › The number of bijective functions from a set wit…
The number of bijective functions from a set with $n$ elements onto itself is:
A$n^2$
B$n$
C$n!$
D$2^n$
Answer & Solution
Correct answer: C. $n!$
Bijections of an n-element set onto itself are its permutations: n! of them.
Related questions
Domain, co-domain and range were first introduced in:If a function f is invertible, then f must be:Applying f first and then g gives the composition written:Mapping students to roll numbers is one-one because:For f(x) = 2x from R to R, the function is:For f(x) = 2x from N to N, the function is:A function is invertible exactly when it is:A function that is both one-one and onto is called: