Case I
Total one-one function
Case II
Total one-one function
Case I
Total one-one function
Case II
Total one-one function
Any function where and is defined by choosing one of the four elements of for each element of .
Thus, the total number of functions is
To count those functions where appears at least once in the set , we can use the complementary counting method: subtract the functions that never use .
If is excluded, each element of has only 3 choices (namely, ), so the number of such functions is
Thus, the number of functions such that is
In this context, "many-one functions" are understood to be non-injective functions.
Since an injective (one-to-one) function from to must be a permutation (because both sets have 4 elements), the number of one-to-one functions is
It is important to note that every injective function has (a full permutation) which automatically means .
Thus, the number of many-one (non-injective) functions with is found by subtracting the one-to-one functions from the total functions that include :
This detailed explanation shows that the number of many-one functions such that is indeed .
as is onto hence is range of
hence range also for range of
For
Clearly $\mathrm{x}
So,
Ans. 118
so is function
so function is one-one but not onto
In (1) Put So,
So
Now,
Case I : If (Accepted)
Case II : If
From Case I and Case II