Let `f : W to 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.

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.

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 Y = {n^2 : n in N} sub N Consider f : N rarr Y as f (n) = n^2 Show that f is invertible. Find the inverse of f.

Let f: N rarr N be defined by : f(n) = {:{((n+1)/2, if n is odd),(n/2, if n is even):} then f is

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 f : R rarr R be defined by f(X) = 10 x + 7. Show that f is invertible. Find f^-1

Let f:NrarrY, be a function defined as f(x) = 4x+3 , where, Y = {y in N: y = 4x + 3 for some x in N }. Show that f is invertible. Find the inverse.

Let f: Nrar R be a function defined as : f(x) = 4x^2 + 12 x + 15 . Show that f: N rarr S where S is Range f is invertible. Find the invere of 'f'.

Let f: Rrarr R 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 . State whether the function f is bijective.