Let `f: N->N` be defined by: `f(n)={n+1,\ if\ n\ i s\ od d n-1,\ if\ n\ i s\ e v e n` Show that `f` is a bijection.

Let f: Nuu{0}->Nuu{0} be defined by f(n)={n+1,\ if\ n\ i s\ e v e nn-1,\ if\ n\ i s\ od d Show that f is a bijection.

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: Nuu{0}->Nuu{0} be defined by f(n)={n+1,\ if\ n\ i s\ even\,\ \ \n-1,\ if\ n\ i s\ od d Show that f is invertible and f=f^(-1) .

Let f: Nuu{0}->Nuu{0} be defined by f(n)={n+1,\ if\ n\ i s\ even\,\ \ \n-1,\ if\ n\ i s\ od d Show that f is invertible and f=f^(-1) .

Let f:N rarr N be defined by: f(n)={n+1,quad if n is oddn -1,quad if n is even Show that f is a bijection.

Let f: N rarr N be defined by : f(n)= {(n+1, if n is odd),(n-1, if n is even):} .Show that f is a bijective function.

Let f: Nuu{0}->Nuu{0} be defined by f={(n+1 ,, ifn \ i s \ e v e n),(n-1 ,, ifn \ i s \ od d):} Show that f is a bijection.

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 uu{0}rarr N uu{0} be defined by f(n)={n+1, if n is eve nn-1,quad if quad n is odd Show that f is a bijection.

Let f : WrarrW , 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.