Q. 164.7( 3 Votes )

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

Answer :

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 - 01Functions - 01Functions - 0152 mins
Functions - 10Functions - 10Functions - 1047 mins
Functions - 05Functions - 05Functions - 0558 mins
Functions - 07Functions - 07Functions - 0748 mins
Functions - 02Functions - 02Functions - 0253 mins
Functions - 03Functions - 03Functions - 0361 mins
Functions - 08Functions - 08Functions - 0840 mins
Functions - 12Functions - 12Functions - 1252 mins
Functions - 04Functions - 04Functions - 0460 mins
Inverse Trigonometric Functions - 01Inverse Trigonometric Functions - 01Inverse 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
caricature
view all courses