Home
Class 12
MATHS
Let f:NrarrN be defined by, f(n) = {((n+...

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

Promotional Banner

Topper's Solved these Questions

  • RELATIONS AND FUNCTIONS

    PRADEEP PUBLICATION|Exercise EXERCISE|401 Videos

  • PROBABILITY

    PRADEEP PUBLICATION|Exercise EXERCISE|467 Videos

  • THREE DIMENSIONAL GEOMETRY

    PRADEEP PUBLICATION|Exercise EXERCISE|373 Videos

Similar Questions

Explore conceptually related problems

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.

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

Show that f: N rarr N defined by : f(n)= {((n+1)/2, if n is odd),(n/2, if n is even):} is many-one onto function.

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.

If f:N–>N is defined by {[(n+1)/2 (if n is odd) ] ,[( n/2)(if n is even)] is f(n) is one one 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 f: Rrarr R be defined as f(x) = 2x for all x in N , then f is

Let N rarr N be defined by f (x) = 3x. Show that f is not an onto function.

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.

Show that f : N rarr N given by : f(x) = {x+ 1, if x is odd x - 1 , if x is even is both one-one and onto.

PRADEEP PUBLICATION-RELATIONS AND FUNCTIONS-EXERCISE
  1. Let f : Z rarr Z be defined as f(n) = 3n for all n in Z. Let g : Z ra...

    Text Solution

    |

  2. Let f : R rarr R be defined by f(x) = 1/x AA x inR, then f is

    Text Solution

    |

  3. Let f:NrarrN be defined by, f(n) = {((n+1)/2,,if n is odd,,),(n/2,,if ...

    Text Solution

    |

  4. Lert f : X rarr Y be such that fof = f. Show that f is onto if and onl...

    Text Solution

    |

  5. Let f : X rarr Y be an invertible function. Show that f has unique inv...

    Text Solution

    |

  6. Let A be any non-empty set and f be a bijection on A, prove that f^-1 ...

    Text Solution

    |

  7. Let A be any non-empty set and f be a bijection on A, prove that f^-1 ...

    Text Solution

    |

  8. Let f : A rarr B and g : B rarr C be onto functions, show that gof is ...

    Text Solution

    |

  9. Consider f: Rrarr[-5, oo] given by f(x) = 9x^2 + 6x - 5. Show that f ...

    Text Solution

    |

  10. Consider f : R+ rarr (-9, infty) given by f(x) = 5x^2 + 6x - 9. Prove ...

    Text Solution

    |

  11. Let f : R to R be the signum function defined as f(x) = {{:(1, x gt 0...

    Text Solution

    |

  12. Let f: R rarr R be defined as f(X) = 3x. Then

    Text Solution

    |

  13. Consider the function f(x) = (1-x)/(1+x). Is f one-one? If yes, find f...

    Text Solution

    |

  14. If f : R rarr R is defined by f(x) = x^2 – 3x + 2, find f (f (x)).

    Text Solution

    |

  15. If f : R rarr R is defined by f(x) = x^2 – 3x + 2, find f (f (x)).

    Text Solution

    |

  16. If f : R rarr R is defined by f(x) = x^2 – 3x + 2, find f (f (x)).

    Text Solution

    |

  17. Show that *:RxxRrarrR, given by (a,b)rarra+4b^2 is a binary operation...

    Text Solution

    |

  18. Let a mapping '*' from R xx R to R be defined by a * b = 2 a + 2 b for...

    Text Solution

    |

  19. Let a binary operation '*' be defined on Z by a * b = 2 a + 2b for all...

    Text Solution

    |

  20. Let S be the set of all real numbers except 1 and 'o' be an operation ...

    Text Solution

    |