Home › JEE Main › 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
The graph of $f(x) = 1/x$ in $\mathbb{R} - \{0\}$ is:The function $f: \mathbb{R} \to \mathbb{R}, f(x) = x^2$ is:A relation $R$ from $A$ to $B$ qualifies as a function when:If $|A| = 3$ and $|B| = 4$, the number of elements in $A \times B$ is:On the set $\{1,2,3\}$, the relation $R = \{(1,1),(2,2),(3,3)\}$ is:A function is invertible if and only if it is:If $f(x) = 2x$ and $g(x) = x + 1$, then $(g\circ f)(x)$ equals:For functions $f$ and $g$, the composition $(g\circ f)(x)$ means: