# Find the number of all onto functions from the set A = {1, 2, 3, …., n} to itself.

TIP:

Onto Function: – A function is said to be a onto function or surjection if every element of A i.e, if f(A) = B or range of f is the co – domain of f.

So, is Surjection iff for each , there exists such that f(a) = b

Now, f : A A where A = {1, 2, 3,….,n}

All onto function

It’s a permutation of n symbols 1,2,3,….n

Thus,

Total number of Onto maps from A = {1, 2, 3, …., n} to itself =

Total number of permutations of n symbols 1,2,3,….n.

Rate this question :

How useful is this solution?
We strive to provide quality solutions. Please rate us to serve you better.
Related Videos
Functions - 0152 mins
Functions - 1047 mins
Functions - 0558 mins
Functions - 0748 mins
Functions - 0253 mins
Functions - 0361 mins
Functions - 0840 mins
Functions - 1252 mins
Functions - 0460 mins
Inverse Trigonometric Functions - 0161 mins
Try our Mini CourseMaster Important Topics in 7 DaysLearn from IITians, NITians, Doctors & Academic Experts
Dedicated counsellor for each student
24X7 Doubt Resolution
Daily Report Card
Detailed Performance Evaluation
view all courses