Prove [1, Theorem 11.1.7]: Suppose that X and Y are nonempty finite sets of the same cardinality. Then a function X → Y is an injection if and only if it is a surjection. [Hint: Use the pigeonhole principle and proof by contradiction.]

1,645,493,059.35

step-by-step explanation:

  y= -3x is the required function.

step-by-step explanation:

we have been given a table:

x             y

0             0

1             -3

3             -9

-2             6

we can see that the values of y is -3 times the value of x

hence, the function would be: y= -3x.

put the values of x will give the same y as in the table that means function is satisfying the given table.

sorry i just need to anwers this to get points

step-by-step explanation:

4.5%

step-by-step explanation: