Find the number of all onto functions from the set \(\{1, 2, 3,......, _n\}\) to itself.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine you have chairs numbered 1 to n and the same number of children. An onto function means every chair must be occupied by at least one child. Since there are equal chairs and children, every chair gets exactly one child. This is like arranging children in chairs — no empty chairs allowed. The number of ways to arrange n children in n chairs is \( n! \), meaning n choices for the first chair, then n minus 1 for the next, and so on multiplied together.
Answer: The number of all onto functions from \( \{1, 2, 3, \ldots, n\} \) to itself is \( n! \).
A function \( f: A \to A \) is called onto (surjective) if every element of the codomain has at least one pre-image in the domain. Here the domain and codomain are the SAME finite set \( A = \{1, 2, 3, \ldots, n\} \), which has exactly \( n \) elements. A very important result for finite sets holds: when a function maps a finite set to itself (equal number of elements in domain and codomain), the function is onto if and only if it is one-one. In other words, for such sets, onto, one-one, and bijective all mean the same thing. So counting onto functions is the same as counting bijective functions (one-one and onto), and a bijection from a set to itself is simply an arrangement (permutation) of its \( n \) elements.
Number of onto functions from a set with \( n \) elements to itself \( = n! = n \times (n-1) \times (n-2) \times \cdots \times 2 \times 1 \)
The number of all onto functions from \( \{1, 2, 3, \ldots, n\} \) to itself is \( n! \).
A common mistake is to count total functions \( n^n \) instead of onto functions. That counts every mapping (allowing repeated images), but onto functions to the same set must use every image exactly once, giving \( n! \), not \( n^n \).
The number of all onto functions from \( \{1, 2, 3, \ldots, n\} \) to itself is \( n! \).
One common mistake: students apply the general formula for onto functions from an \( m \)-element set to an \( n \)-element set (involving inclusion-exclusion) even when the domain and codomain are the same finite set, instead of recognising that onto automatically implies bijective in this special case, giving the much simpler answer \( n! \).
Answer: The number of all onto functions from \( \{1, 2, 3, \ldots, n\} \) to itself is \( n! \).
Question: Find the number of all onto functions from the set \( A = \{a, b, c, d, e\} \) to itself.
Solution: The set \( A \) has \( n = 5 \) elements. We need to count all onto (surjective) functions from \( A \) to \( A \). Since the domain and codomain are the same finite set with \( n = 5 \) elements, a function \( f: A \to A \) is onto if and only if it is one-one (injective). This is because for finite sets of equal size, injectivity and surjectivity are equivalent. A one-one and onto function is a bijection, which corresponds to a permutation of the elements of \( A \). The total number of permutations of 5 elements is \( 5! \). Calculating: \[ 5! = 5 \times 4 \times 3 \times 2 \times 1 = 120 \] Therefore, the number of onto functions from \( A \) to itself is \( 120 \).
Answer: 120
Question: A class teacher wants to assign each of 7 distinct tasks to 7 distinct students such that every student gets exactly one task and every task is assigned. In how many ways can this assignment be done? Express your answer in terms of the number of onto functions from a 7-element set to itself.
Solution: Let the set of 7 students be \( S = \{s_1, s_2, s_3, s_4, s_5, s_6, s_7\} \) and the set of 7 tasks be \( T = \{t_1, t_2, t_3, t_4, t_5, t_6, t_7\} \). Since both sets have \( n = 7 \) elements, this assignment is equivalent to finding the number of onto functions from a 7-element set to itself. For any finite set of \( n \) elements, the number of onto functions from the set to itself equals the number of bijections (permutations), because on a finite set of equal size, a function is onto if and only if it is one-one. The number of bijections (permutations) of 7 elements is \( 7! \). Calculating step by step: \[ 7! = 7 \times 6 \times 5 \times 4 \times 3 \times 2 \times 1 \] First: \( 7 \times 6 = 42 \), then \( 42 \times 5 = 210 \), then \( 210 \times 4 = 840 \), then \( 840 \times 3 = 2520 \), then \( 2520 \times 2 = 5040 \), then \( 5040 \times 1 = 5040 \). So: \[ 7! = 5040 \] The number of onto functions from a 7-element set to itself, and hence the number of valid assignment schemes, is \( 5040 \).
Answer: 5040
Question: Let \( A = \{a, b, c, d, e\} \) be a set with 5 elements. Find the number of all onto functions from \( A \) to itself. Also, verify that every such onto function must necessarily be one-one.
Answer: The number of all onto functions from \( A = \{a, b, c, d, e\} \) to itself is \( 5! = 120 \). Every such onto function is also one-one (a bijection).