Let f : N → N be defined by f (n) = n +1 by 2 if n is odd and n by 2 if is even for all n ∈ N. State whether the function f is bijective. Justify your answer.

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

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

Let f: NvecN be defined by f(n)={(n+1)/2,\ "if"\ n\ "i s\ o d d"n/2,\ \ "if\ "n\ "i s\ e v e n"\ \ for\ a l l\ n\ \ N} Find whether the function f is bijective.

Let f: N->N be defined0 by: f(n)={(n+1)/2, if n is odd (n-1)/2, if n is even Show that f is a bijection.

Let f : N rarr N be defined as f(x) = 2x for all x in N , then f is

Let f:N to N be defined by f(n)={{:((n+1)/2, " if n is odd"),(n/2, "if n is even"):} for all n in N . Prove that f is many-one, onto function.

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

Let f: W ->W be defined as f(n) = n - 1 , if n is odd and f(n) = n + 1 , if n is even. Show that f is invertible. Find the inverse of f . Here, W is the set of all whole numbers.

If f: N to N defined as f(x)=x^(2)AA x in N, then f is :

check that f : N- N defined by f(n)={(n+1)/2,(if n is odd)),(n/2,(if n is even)) is one -one onto function ?