Proof : One-to-one and Onto Functions
Response to the following :
1. Consider f:A->A a one-to-one function. Prove that f is also onto.
2. Consider f:A->A an onto function. Prove that f is also one-to-one.
A is a finite set. Hint: whenever we have a finite set it is often useful to actually enumerate its elements, i.e. A={a1,a2,....,an}