# Let f : N → N be defined byState whether the function f is bijective. Justify your answer.

It is given that

f : N N be defined by

We can observed that:

(by using the definition of f)

Thus, f(1) = f(2), where 1 ≠ 2.

Therefore, f is not one-one.

Now, let us consider a natural number (n) in co domain N.

Case I: When n is odd.

Then, n = 2r +1 for some r ϵ N.

there exist 4r + 1 ϵ N such that f(4r+1) =

Case II: When n is even.

Then, n = 2r for some r ϵ N.

there exist 4r ϵ N such that f(4r) =

Therefore, f is onto.

Function f is not one-one but it is onto.

Thus, Function f is not bijective function.

Rate this question :

How useful is this solution?
We strive to provide quality solutions. Please rate us to serve you better.
Related Videos
Functions - 0152 mins
Different kind of mappings58 mins
Range of Functions58 mins
Quick Revision of Types of Relations59 mins
Some standard real functions61 mins
Functions - 0947 mins
Quick Recap lecture of important graphs & functions58 mins