Consider the two sets Let be a surjective function from to such that for any two elements and of if then What is the minimum possible value of ?
A function maps the elements of to elements of How many of the possible maps are not injective?
Details and assumptions
A function is injective if each element in the codomain is mapped onto by at most one element in the domain.
For two sets is an injective function from to . If and , what is the sum of all the elements of that can possibly be the value of ?
For function is surjective from to where What is the sum of all the elements of
For two sets how many injective functions exist?