Home
Class 12
MATHS
Consider the identity function IN : N...

Consider the identity function `I_N : N->N` defined as, `I_N(x)=x` for all `x in N` . Show that although `I_N` is onto but `I_N+I_N : N->N` defined as `(I_N+I_N)(x)=I_N(x)+I_N(x)=x+x=2x` is not onto.

Text Solution

Verified by Experts

From given `I_N` is onto
Here we can find an element 3 in the codomain N
Such that there does not exist any x in the domain N with `(I_N+I_N)(x)`=`2x`=3
`:.` `(I_N+I_N)` is not onto.
Promotional Banner

Topper's Solved these Questions

  • RELATIONS AND FUNCTIONS

    NCERT ENGLISH|Exercise EXERCISE 1.4|13 Videos
  • RELATIONS AND FUNCTIONS

    NCERT ENGLISH|Exercise EXERCISE 1.2|12 Videos
  • RELATIONS AND FUNCTIONS

    NCERT ENGLISH|Exercise EXERCISE 1.3|14 Videos
  • PROBABILITY

    NCERT ENGLISH|Exercise EXERCISE 13.2|18 Videos
  • THREE DIMENSIONAL GEOMETRY

    NCERT ENGLISH|Exercise EXERCISE 11.3|14 Videos

Similar Questions

Explore conceptually related problems

Prove that the function f: N->N , defined by f(x)=x^2+x+1 is one-one but not onto.

Prove that the function f: N->N , defined by f(x)=x^2+x+1 is one-one but not onto.

Prove that the function f:N to N , defined by f(x)=x^(2)+x+1 is one-one but not onto.

If I_n is the identity matrix of order n, then rank of I_n is

If I_n is the identity matrix of order n then (I_n)^-1 (A) does not exist (B) =0 (C) =I_n (D) =nI_n

Let A be the set of all 50 students of class X I I in a central school. Let f: A->N be a function defined by f(x)=Roll number of student x Show that f is one-one but not onto.

Let A be the set of all 50 students of class X I I in a central school. Let f: A->N be a function defined by f(x)=Roll\ n umber\ of\ s t u d e n t\ x Show that f is one-one but not onto.

If I_(n)=int_(0)^(pi) e^(x)(sinx)^(n)dx , then (I_(3))/(I_(1)) is equal to

If I_(n)=int_(0)^(pi) e^(x)sin^(n)x " dx then " (I_(3))/(I_(1)) is equal to

Find the value of i^n+i^(n+1)+i^(n+2)+i^(n+3) for all n in Ndot

NCERT ENGLISH-RELATIONS AND FUNCTIONS-SOLVED EXAMPLES
  1. Let f: N->R be a function defined as f(x)=4x^2+12 x+15. Show that f: N...

    Text Solution

    |

  2. Consider f : N ->N, g : N ->Nand h : N ->Rdefined asf (x) = 2x, g (y) ...

    Text Solution

    |

  3. Consider f:{1,\ 2,\ 3}->{a ,\ b ,\ c} and g:{a ,\ b ,\ c}-> {apple, ba...

    Text Solution

    |

  4. Consider functions f and g such that composite gof is defined and is ...

    Text Solution

    |

  5. Are f and g both necessarily onto, if gofis onto?

    Text Solution

    |

  6. Let f : {1, 2, 3}->{a , b , c}be one-one and onto function given by f...

    Text Solution

    |

  7. Let f"":""NvecY be a function defined as f""(x)""=""4x""+""3 , wher...

    Text Solution

    |

  8. Let S = {1, 2, 3}. Determine whether the functions f : S->Sdefined as ...

    Text Solution

    |

  9. Show that addition, subtraction and multiplication are binary operati...

    Text Solution

    |

  10. Consider the identity function IN : N->N defined as, IN(x)=x for al...

    Text Solution

    |

  11. Let R be a relation on the set A of ordered pairs of positive integer...

    Text Solution

    |

  12. Let X={1,\ 2,\ 3,\ 4,\ 5,\ 6,\ 7,\ 8,\ 9} , Let R1 be a relation on X ...

    Text Solution

    |

  13. Show that -ais not the inverse of a in Nfor the addition operation +...

    Text Solution

    |

  14. If R1and R2are equivalence relations in a set A, show that R1nnR2is ...

    Text Solution

    |

  15. Find the number of all one-one functions from set A = {1, 2, 3}to itse...

    Text Solution

    |

  16. Let A={1,\ 2,\ 3} . Then, show that the number of relations containi...

    Text Solution

    |

  17. Let f: X->Y be a function. Define a relation R on X given by R={(a ...

    Text Solution

    |

  18. Determine which of the following binary operations on the set N are a...

    Text Solution

    |

  19. Show that the number of equivalence relation in the set {1, 2, 3}cont...

    Text Solution

    |

  20. Show that the number of binary operations on {1," "2} having 1 as iden...

    Text Solution

    |