Home
Class 12
MATHS
Let f: W ->Wbe defined as f(n) = n - 1,...

Let `f: W ->W`be defined as `f(n) = n - 1`, if 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.

Text Solution

Verified by Experts

In `f: W rarr W`
`{:{(n-1 ", If n is odd. "),(n+1 ", If n is even. "):}`
Let f(n) = f(m) (if n is odd and m is even )
`rArr n-1 =m-1 `
`rArr n=m `
and if n and m both are even then
f(n) = f(m)
`rArr n+1 =m+1`
`rArr n+m therefore` is one- one
Now ,each even number 2r in co-domain W is the image of odd number 2r+1 in co- domain W is the image of even number 2r in the domain W.
`therefore` is onto
`therefore` f is one- one onto
`therefore` is invertible
`therefore` g, the inverse of f is defined as :
` g: W rarr W`
`g(m)= {{:("m+1, if m is even "),("m-1 , if m is odd "):}`
Promotional Banner

Topper's Solved these Questions

  • RELATIONS AND FUNCTIONS

    NAGEEN PRAKASHAN|Exercise Exercise 1.4|13 Videos
  • PROBABIILITY

    NAGEEN PRAKASHAN|Exercise Miscellaneous Exercise|19 Videos
  • THREE-DIMENSIONAL GEOMETRY

    NAGEEN PRAKASHAN|Exercise Miscellaneous Exercise|23 Videos

Similar Questions

Explore conceptually related problems

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

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.

Y={n^(2):n in N}in N Consider f:N rarr Y as Show that f is invertible.Find the inverse of f.

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->N be defined as f(n)= (n+1)/2 if n is odd and f(n)=n/2 if n is even for all ninN State whether the function f is bijective. Justify your answer

Let f" ":" "N ->R be a function defined as f(x)=4x^2+12 x+15 . Show that f" ":" "N-> S , where, S is the range of f, is invertible. Find the inverse of f.

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.

If f(1) = 1 and f(n + 1) = 2 f(n) + 1, if n ge 1, then f(n) is.

NAGEEN PRAKASHAN-RELATIONS AND FUNCTIONS -Miscellaneous Exercise
  1. Let f: R ->Rbe defined as f(x) = 10 x + 7. Find the function g: R ->R...

    Text Solution

    |

  2. Let f: W ->Wbe defined as f(n) = n - 1, if is odd and f(n) = n + 1, i...

    Text Solution

    |

  3. If f: R ->Ris defined by f(x) = x^2- 3x + 2, find f(f(x)).

    Text Solution

    |

  4. Show that the function f: R rarr { x in R: -1 lt x lt 1 } defined by ...

    Text Solution

    |

  5. Show that the function f: R->Rgiven by f(x)=x^3is injective.

    Text Solution

    |

  6. Give examples of two functions f:" "N->Z" "a n dg:" "Z->Z such that o...

    Text Solution

    |

  7. Given examples of two functions f:" "N ->N" "a n d""""""g:" "N->N such...

    Text Solution

    |

  8. Given a non-empty set X, consider P(X) which is the set of all subs...

    Text Solution

    |

  9. Given a non-empty set X, consider the binary operation *: P(X)xx P(X)...

    Text Solution

    |

  10. Find the number of all onto functions from the set {1, 2, 3, , n)to ...

    Text Solution

    |

  11. Let S = {a , b , c} a n d T = {1, 2, 3}. Find F^(-1)of the following ...

    Text Solution

    |

  12. Consider the binary operations*: RxxR->R and o: RxxR->R defined as ...

    Text Solution

    |

  13. Given a non -empty set X, let *:" "P(X)" "xx" "P(X) ->P(X) be defined ...

    Text Solution

    |

  14. Define a binary operation * on the set A={0,1,2,3,4,5} as a*b=a+b (mod...

    Text Solution

    |

  15. Let A" "=" "{-1," "0," "1," "2} , B" "=" "{-4," "-2," "0," "2} and f,g...

    Text Solution

    |

  16. LetA = {1, 2, 3}Then number of relations containing (1, 2) a n d (1, 3...

    Text Solution

    |

  17. Let A = {1, 2, 3}. Then number of equivalence relations containing (1...

    Text Solution

    |

  18. Let f: R->Rbe the Signum Function defined as f(x)={1,x >0 0,x=0-1,x<1 ...

    Text Solution

    |

  19. Number of binary operations on the set {a, b} are (A) 10 (B) 16 (C)...

    Text Solution

    |