Let $$S$$ be the set of all functions from the set $$A$$ to the set $$A.$$ If $$n\left( A \right) = k$$ then $$n\left( S \right)$$ is
A.
$$k!$$
B.
$${k^k}$$
C.
$${2^k} - 1$$
D.
$${2^k}$$
Answer :
$${k^k}$$
Solution :
Each element of the set $$A$$ can be given the image in the set $$A$$ in $$k$$ ways.
∴ the required number of functions, i.e., $$n\left( S \right) = k \times k \times .....\left( {k\,{\text{times}}} \right) = {k^k}.$$
Releted MCQ Question on Algebra >> Permutation and Combination
Releted Question 1
$$^n{C_{r - 1}} = 36,{\,^n}{C_r} = 84$$ and $$^n{C_{r + 1}} = 126,$$ then $$r$$ is:
Ten different letters of an alphabet are given. Words with five letters are formed from these given letters. Then the number of words which have at least one letter repeated are
Eight chairs are numbered 1 to 8. Two women and three men wish to occupy one chair each. First the women choose the chairs from amongst the chairs marked 1 to 4 ; and then the men select the chairs from amongst the remaining. The number of possible arrangements is