Given f: N → N, defined by f(x) =
Now we have to prove that given function is one-one
Injectivity:
Let x and y be any two elements in the domain (N), such that f(x) = f(y).
⇒
⇒
`
⇒
⇒
⇒
[
cannot be zero because x and y are natural numbers
⇒
So, f is one-one.
Surjectivity:
When
⇒
, for every x in N.
⇒ f(x) will not assume the values
and
.
So, f is not onto.