Answer :

Onto function from the set {1, 2, 3, ..., n} to itself is simply a permutation on n symbols 1, 2, 3, …, n.

Therefore, the total number of onto maps from {1, 2, 3, …, n} to itself is the same as the total number of permutations on n symbols 1, 2, 3, …, n, which is n!

Rate this question :

How useful is this solution?
We strive to provide quality solutions. Please rate us to serve you better.
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

| Let * be a binaMathematics - Board Papers

Find the idMathematics - Board Papers

Let f : A Mathematics - Exemplar

Show that the binMathematics - Board Papers

Determine whetherRD Sharma - Volume 1

Fill in theMathematics - Exemplar