- #1
supasupa
- 24
- 0
There are 2 parts to this question:
How many functions are there from a set S with n elements to a set T with m elements? Assume n<=m, how many one-to-one functions are there from S to T?
I am pretty sure that the answer to the first part is mn. So if there are 3 elements in the first set and 4 elements in the 2nd set, then there are a total of 3 X 4 functions.
But for 1 to 1, it would be (for the same set example used above), 4+3+2 = 9 functions.
I am unsure on how to come up with the general formula for the mapping of one-to-one functions.
Any help is appreciated...
How many functions are there from a set S with n elements to a set T with m elements? Assume n<=m, how many one-to-one functions are there from S to T?
I am pretty sure that the answer to the first part is mn. So if there are 3 elements in the first set and 4 elements in the 2nd set, then there are a total of 3 X 4 functions.
But for 1 to 1, it would be (for the same set example used above), 4+3+2 = 9 functions.
I am unsure on how to come up with the general formula for the mapping of one-to-one functions.
Any help is appreciated...