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

0 votes
27 views
asked Jan 13, 2018 in Mathematics by sforrest072 (157,439 points) 63 448 1284

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

1 Answer

0 votes
answered Jan 13, 2018 by mdsamim (213,225 points) 5 10 22
selected Jan 13, 2018 by sforrest072
 
Best answer

Onto functions from the set {1, 2, 3, … , n} to itself is simply a permutation on n symbols 1, 2, …, n.
Thus, the total number of onto maps from {1, 2, … , n} to itself is the same as the total number of permutations on n symbols 1, 2, …, n, which is n.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

One Thought Forever

“There is a close connection between getting up in the world and getting up in the morning.“
– Anon
~~~*****~~~

...