If a set $A$ has $n$ elements,then the number of functions defined from $A$ to $A$ that are not one-one is

  • A
    $(n)^{n^2}$
  • B
    $n! - \sum_{k=0}^{n} {}^{n}C_{k}$
  • C
    $n^{n} - n!$
  • D
    $n^{n}$

Explore More

Similar Questions

Show that the function $f: N \rightarrow N$,given by $f(1)=f(2)=1$ and $f(x)=x-1$ for every $x>2$,is onto but not one-one.

If $A = \{x \mid x \in N, x \leq 5\}$ and $B = \{x \mid x \in Z, x^{2} - 5x + 6 = 0\}$,then the number of onto functions from $A$ to $B$ is:

The function $f:[0,3] \rightarrow [1,29]$,defined by $f(x)=2x^3-15x^2+36x+1$,is

Check the injectivity and surjectivity of the following function $f : N \rightarrow N$ given by $f(x) = x^{3}$.

The function $f: R \rightarrow R$ defined by $f(x)=\frac{x}{\sqrt{1+x^2}}$ 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