279 views
0 votes
0 votes
Show that if f is a function from S to T , where S and T are finite sets with |S| > |T |, then there are elements s1 and s2 in S such that f (s1) = f (s2), or in other words, f is not one-to-one.

How can I prove it by using “proof by contradiction”?

Is it possible to prove the same by using “proof by contraposition”? If yes, how?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
admin asked Apr 29, 2020
320 views
An alternative proof of Theorem $3$ based on the generalized pigeonhole principle is outlined in this exercise. The notation used is the same as that used in the proof in...
0 votes
0 votes
0 answers
3
0 votes
0 votes
1 answer
4