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

To find the number of onto functions (also known as surjective functions) from the set A = {1, 2, 3, ..., n} to itself, we can use a combinatorial approach. An onto function maps every element in the domain to an element in the codomain such that every element in the codomain is covered at least once.

Understanding Onto Functions

An onto function from a set of size n to itself must use all n elements in the codomain. The number of onto functions can be calculated using the principle of inclusion-exclusion.

Formula for Onto Functions

The number of onto functions from a set of size n to itself is given by:

• n! (n factorial)

This is because each element in the domain must map to a unique element in the codomain, ensuring that all elements are used.

Example Calculation

For instance, if n = 3, the number of onto functions from the set {1, 2, 3} to itself is:

• 3! = 3 × 2 × 1 = 6

Thus, there are 6 onto functions for n = 3.

General Case

In general, for any positive integer n, the number of onto functions from the set A to itself is simply:

• n!

This result highlights the importance of permutations in defining onto functions.