CUET Preparation Today
Let A be a set containing m distinct elements, then the total number of distinct functions from A to itself is |
$m^m$ $m^2$ $m!$ $2^m-1$ |
$m^m$ |
Each element in set A has m options in it’s images, so number of mappings = $m × m × …× m = m^m$ times |
