Let A = {1, 2, 3, 4} and B = {1, 4, 9, 16}. Then the number of many-one functions such that is equal to :
We are given sets and and asked to determine the number of many-one functions such that . By definition, a many-one function is not injective, which means at least two elements of are mapped to the same element of .
First, the total number of functions from to is found by noting that each of the four elements of can map to any of the four elements of , yielding total functions. The number of injective functions from to is the number of one-to-one correspondences between two 4-element sets, namely . Therefore, the number of many-one functions from to is .
Next, we exclude those many-one functions for which . In that case, the function’s image must lie entirely in the set , which has three elements. Hence there are such functions. Since , none of these functions can be injective, so all 81 are many-one. Subtracting this quantity from gives the number of many-one functions for which , namely .
Therefore, the required number of many-one functions satisfying the condition is .
Tagged One-one, onto functions and counting functions. Machine-assigned, so read it as a strong shortlist rather than a verdict.