Home
Class 12
MATHS
Are f and g both necessarily onto, if go...

Are f and g both necessarily onto, if `gof`is onto?

Text Solution

Verified by Experts

The correct Answer is:
f is not onto
Promotional Banner

Topper's Solved these Questions

  • RELATIONS AND FUNCTIONS

    MODERN PUBLICATION|Exercise NCERT - FILE (Question from NCERT Book) (Exercise 1.1)|16 Videos

  • RELATIONS AND FUNCTIONS

    MODERN PUBLICATION|Exercise NCERT - FILE (Question from NCERT Book) (Exercise 1.2)|12 Videos

  • RELATIONS AND FUNCTIONS

    MODERN PUBLICATION|Exercise Objective Type Questions (C. True/False Questions)|5 Videos

  • PROBABILITY

    MODERN PUBLICATION|Exercise MOCK TEST SECTION D|6 Videos

  • THREE DIMENSIONAL GEOMETRY

    MODERN PUBLICATION|Exercise CHAPTER TEST 11|11 Videos

Similar Questions

Explore conceptually related problems

Consider functions f and g such that composite gof is defined and is one-one.Are f and g both necessarily one-one.

Let f:A rarr B and g:B rarr C be two functions.Then; if gof is onto then g is onto; if gof is one one then f is one-one and if gof is onto and g is one one then f is onto and if gof is one one and f is onto then g is one one.

Show that if f:A rarr B and are onto,then are onto,then is also onto.

Let f: R->R be any function. Also g: R->R is defined by g(x)=|f(x)| for all xdot Then is a. Onto if f is onto b. One-one if f is one-one c. Continuous if f is continuous d. None of these

If f:A rarr B and g:B rarr C are onto functions show that gof is an onto function.

A function is said to be bijective if it is both one-one and onto, Consider the mapping f : A rarr B be defined by f(x) = (x-1)/(x-2) such that f is a bijection. Let g : R - {2} rarr R - {1} be defined by g(x) = 2f(x) - 1 . Then g(x) in terms of x is :

A function is said to be bijective if it is both one-one and onto, Consider the mapping f : A rarr B be defined by f(x) = (x-1)/(x-2) such that f is a bijection. Domain of f is

A function is said to be bijective if it is both one-one and onto, Consider the mapping f : A rarr B be defined by f(x) = (x-1)/(x-2) such that f is a bijection. Range of f is :

A function is said to be bijective if it is both one-one and onto, Consider the mapping f : A rarr B be defined by f(x) = (x-1)/(x-2) such that f is a bijection. A function f(x) is said to be one-one iff :

MODERN PUBLICATION-RELATIONS AND FUNCTIONS-Objective Type Questions (D. Very Short Answer Types Questions)
  1. If f is a function from RrarrR such that f(x)=x^(2)AA x inR, then show...

    Text Solution

    |

  2. Let A = {1, 2, 3}, B = {4, 5, 6, 7}and let f = {(1, 4), (2, 5), (3, 6)...

    Text Solution

    |

  3. The function P is defined as: ''To each person on the earth is assig...

    Text Solution

    |

  4. Write the function whose graph is shown below:

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

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

    Text Solution

    |

  8. Give examples of function: f:NrarrN and g:NrarrN such that gof is ...

    Text Solution

    |

  9. Find fog, if f:RrarrR and g:RrarrR are given by: f(x)=cosxandg(x)=x^...

    Text Solution

    |

  10. If f (x) = sin x, g(x) = x^(2), if x inR, then find [(fog)(x)].

    Text Solution

    |

  11. If f:RrarrR is defined by f(x)=3x+1, find f(f(x)).

    Text Solution

    |

  12. Let '**' be a binary operation on N given by: a**b=LCM (a,b) for all...

    Text Solution

    |

  13. Let '**' be a binary operation on N given by: a**b=LCM (a,b) for all...

    Text Solution

    |

  14. The binary operation **:RxxRrarrR is defined as: a**b=2a+b. Find (...

    Text Solution

    |

  15. Show that + : R xx R ->Rand xx : R xx R ->Rare commutative binary ope...

    Text Solution

    |

  16. Show that + : R xx R ->Rand xx : R xx R ->Rare commutative binary ope...

    Text Solution

    |

  17. Show that addition and multiplication are associative binary operat...

    Text Solution

    |

  18. Show that subtraction and division are not binary operations on N.

    Text Solution

    |

  19. Show that " "a is not the inverse of a in N for the addition op...

    Text Solution

    |

  20. Show that " "a is not the inverse of a in N for the addition op...

    Text Solution

    |