If `f:N uu {0} -> Nuu {0}` are defined as follows: `f(x)={n+1`, When n even , `n-1`, When n odd then prove that `f` is a inverse function.

Let f: N uu {0} rarr N uu {0} be defined by : f(n)= {(n+1, if n is even),(n-1, if n is odd):} .Show that f is invertible and f =f^-1 .

let NN be the set of natural numbers and f: NN uu {0} rarr NN uu [0] be definedby : f(n)={(n+1 " when n is even" ),(n-1" when n is odd " ):} Show that ,f is a bijective mapping . Also that f^(-1)=f

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)={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 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: 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: 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: 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.

If f:{1,2,3....}->{0,+-1,+-2...} is defined by f(n)={n/2, if n is even , -((n-1)/2) if n is odd } then f^(-1)(-100) is