Find the number of all onto functions from the set {1,2,3,… ,n) to itself.
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.
Let \( A = \{0,1,2,\ldots,9\} \). Let \( R \) be a relation on \( A \) defined by \((x,y) \in R\) if and only if \( |x - y| \) is a multiple of \(3\). Given below are two statements:
Statement I: \( n(R) = 36 \).
Statement II: \( R \) is an equivalence relation.
In the light of the above statements, choose the correct answer from the options given below.