Q. 103.8( 17 Votes )
Find the number of all onto functions from the set A = {1, 2, 3, …., n} to itself.
Answer :
TIP: –
Onto Function: – A function is said to be a onto function or surjection if every element of A i.e, if f(A) = B or range of f is the co – domain of f.
So, is Surjection iff for each
, there exists
such that f(a) = b
Now, f : A → A where A = {1, 2, 3,….,n}
All onto function
It’s a permutation of n symbols 1,2,3,….n
Thus,
Total number of Onto maps from A = {1, 2, 3, …., n} to itself =
Total number of permutations of n symbols 1,2,3,….n.
Rate this question :






















Fill in the blanks in each of the
Let f :R → R be defined by. Then (f o f o f) (x) = _______
Let f : [2, ∞) → R be the function defined by f (x) = x2–4x+5, then the range of f is
Mathematics - ExemplarLet f : N → R be the function defined byand g : Q → R be another function defined by g (x) = x + 2. Then (g o f)3/2 is
Fill in the blanks in each of the
Let f = {(1, 2), (3, 5), (4, 1) and g = {(2, 3), (5, 1), (1, 3)}. Then g o f = ______and f o g = ______.
Mathematics - ExemplarLet f :R → R be defined by
Then f (– 1) + f (2) + f (4) is
Mathematics - ExemplarLet f : [0, 1] → [0, 1] be defined by
Then (f o f) x is
Mathematics - ExemplarWhich of the following functions from Z into Z are bijections?
Mathematics - Exemplar