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?