Question: 3. (25 points) Let S be a set with cardinality |S| = m and T be a set with cardinality |T| = n. Write a
3. (25 points) Let S be a set with cardinality |S| = m and T be a set with cardinality |T| = n. Write a formula for each of the following (assume that all functions mentioned are total functions): (a) The number of subsets of S with cardinality k.
(b) The number of functions from S to T.
(c) The number of 1-1 (injective) functions from S to T. (You may assume that m n.)
(d) The number of onto (surjective) functions from S to T. (You may assume that m n.)
(e) The number of binary relations from S to T.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
