5 elements of the range can be selected in (65)=6 ways. Now we will find the number of onto functions (since the range of f contains exactly 5 elements) for each such case.
Thus the problem reduces to finding the number of onto functions from a set containing 6 elements to a set containing 5 ({2,3,4,5,6}say) elements.
Let T1 be the set of all functions with the property that the element 2 is not in the range of the function.
Let T2 be the set of all functions with the property that the element 3 is not in the range of the function.
…
Let T5 be the set of all functions with the property that the element 6 is not in the range of the function.
Now the function will be onto ( i.e., the range of f will contain exactly 5 elements ) iff none of the above properties hold. Number of such functions is |T1∪T2∪⋯∪T5|. Using the principle of Exclusion−Inclusion we have
|T1∪T2∪⋯∪T5|=∑5i=1|Ti|−∑1≤i<j<≤5|Ti∩Tj|+⋯+|T1∩T2∩⋯∩T5|
=(51)46−(52)36+(53)26−(54)16+(55)06=13825
Total number of functions = 56=15625
Therefore number of functions with required condition =(15625−13825)×(65)=10800
No comments:
Post a Comment