Let f:N->N be defined as f(n)= (n+1)/2 i...

Let `f:N->N` be defined as `f(n)= (n+1)/2` if n is odd and `f(n)=n/2` if n is even for all n`in`N State whether the function f is bijective. Justify your answer

A

onto but not one-one

B

one-one and onto

C

neither one-one nor onto

D

one-one but not onto

Verified by Experts

The correct Answer is:

A

Similar Questions

Explore conceptually related problems

Let f:N->N be defined by f(x)=x^2+x+1,x in N . Then is f is

Find n if: (n + 2)! = 56(n)!

If X={4^(n)-3n-1 : n in N} and Y={9(n-1) : n in N} , then

If X = {4 ^(n)-2n-1: n in N} and Y={9(n -1) : n in N}, then Xnn Y=

By method of induction, prove that 2^n > n , for all n in N .

If (1-i)^n = 2^n , then n=

if X={8^(n)-7n-1:n in N) and Y={49(n-1): n in N}, then

Let f,g: RvecR be a two function defined as f(x)=|x|+xa n dg(x)=|x|-x for all x in Rdot Then, find foga n dgofdot

Prove by method of induction: 5^(2n)-2^(2n) is divisible by 3, for all n in N .