Find the number of all onto functions from the set $\{1, 2, 3, \ldots, n\}$ to itself.

  • A
    $n!$
  • B
    $n^n$
  • C
    $2^n$
  • D
    $n$

Explore More

Similar Questions

If $f: R \to R$ is a continuous function such that $|f(x) - f(y)| \geqslant |e^x - e^y|$ for all $x, y \in R$,then $f(x)$ is:

The real-valued function $f: R \rightarrow [ \frac{5}{2}, \infty )$ defined by $f(x) = | 2x + 1 | + | x - 2 |$ is

If $f: N \rightarrow Z$ is defined by $f(n)=\begin{cases} 2 & \text{if } n=3k, k \in Z \\ 10 & \text{if } n=3k+1, k \in Z \\ 0 & \text{if } n=3k+2, k \in Z \end{cases}$, then $\{n \in N: f(n)>2\}$ is equal to

The number of strictly increasing functions $f$ from the set $A = \{1, 2, 3, 4, 5, 6\}$ to the set $B = \{1, 2, 3, \dots, 9\}$ such that $f(i) \neq i$ for all $1 \le i \le 6$ is equal to:

Let $A=\{1,3,7,9,11\}$ and $B=\{2,4,5,7,8,10,12\}$. Then the total number of one-one maps $f: A \rightarrow B$,such that $f(1)+f(3)=14$,is:

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo