Processing math: 100%

Wednesday, June 17, 2015

Indian Statistical Institute B.Math & B.Stat : Combinatorics

Indian Statistical Institute B.Math & B.Stat Solved Problems, Vinod Singh ~ Kolkata Let A={1,2,3,4,5,6}. Find the number of functions f from A to A such that range of f contains exactly 5 elements.
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 |T1T2T5|. Using the principle of ExclusionInclusion we have
|T1T2T5|=5i=1|Ti|1i<j<≤5|TiTj|++|T1T2T5|
=(51)46(52)36+(53)26(54)16+(55)06=13825
Total number of functions = 56=15625
Therefore number of functions with required condition =(1562513825)×(65)=10800

No comments:

Post a Comment