Let = {1, 2, 3, 4} and = {1, 2}. Then the number of onto functions from to is [2001]
(1)
E = {1, 2, 3, 4} and F = {1, 2}
From E to F we can define, in all, 2 × 2 × 2 × 2 = 16 functions (2 options for each element of E), out of which 2 are into, when all the elements of E either map to 1 or to 2.
Number of onto functions = 16 − 2 = 14