I'm not sure if I can do this without knowing what f actually is?
Let $X$ be a finite set with $n$ elements and $f: X \rightarrow X$ a one-to-one function. Prove by induction that $f$ is an onto function.
Any pointers? I don't even know how to make a base case for this.