Answer:
Step-by-step explanation:
a) To provide an example of a function N → N that is one-to-one but not onto.
Suppose
to be 
Then; 

Now, assuming 
Then 

The above function is said to be one-to-one
e.g
2 is not a perfect square, hence, it is not regarded as the image of any natural no.
As such, f is not onto.
We can thereby conclude that the function
is one-to-one but not onto
b)
be
![f(n) = [n/2] \\ \\ For \ n =1, f(1) = [1/2] = [0.5] = 1 \\ \\ For \ n=2 , f(2) = [2/2] = [1] = 1](https://tex.z-dn.net/?f=f%28n%29%20%3D%20%5Bn%2F2%5D%20%5C%5C%20%5C%5C%20%20For%20%5C%20n%20%3D1%2C%20f%281%29%20%3D%20%5B1%2F2%5D%20%3D%20%5B0.5%5D%20%3D%201%20%5C%5C%20%5C%5C%20For%20%5C%20n%3D2%20%2C%20f%282%29%20%3D%20%5B2%2F2%5D%20%3D%20%5B1%5D%20%3D%201)
It implies that the function is not one-to-one since there exist different natural no. having the same image.
So, for
, there exists an image of 2n in N
i.e.
![f(2n) = [2n/2] = [n] = n](https://tex.z-dn.net/?f=f%282n%29%20%3D%20%5B2n%2F2%5D%20%3D%20%5Bn%5D%20%3D%20n)
Hence, the function is onto
We thereby conclude that the function ![f(n) = [n/2] \text{ is onto but not one-to-one}](https://tex.z-dn.net/?f=f%28n%29%20%3D%20%5Bn%2F2%5D%20%5Ctext%7B%20is%20onto%20but%20not%20one-to-one%7D)
c)
be 
So, if n, m is odd:
Then:

Likewise, if n, m is even:
Then;

The function is then said to be one-to-one.
However, For
and is odd, there exists an image of
that is even;

For
and is even, there exists an image of
that is odd;

where(; implies such that)
Hence, this function is said to be onto.
We can therefore conclude that the function
is both onto and one-to-one.
d)
Here, to provide an example where the
is neither one-to-one nor onto.
SO;
Let
is defined to be 
Then, since every integer has the same image as zero(0), the function is not one-to-one.
Similarly, the function is not onto since every positive integer is not an image of any natural number.
We, therefore conclude that, the function
is neither one-to-one nor onto.