You are here
Question 5 - Composite functions and one-one onto - Chapter 1 Class 12 Relation and Functions
Last updated at July 24, 2026 by Teachoo
Composite functions and one-one onto
Chapter 1 Class 12 Relation and Functions
Concept wise
- Relations - Definition
- Empty and Universal Relation
- To prove relation reflexive, transitive, symmetric and equivalent
- Finding number of relations
- Function - Definition
- To prove one-one & onto (injective, surjective, bijective)
- Composite functions
-
Composite functions and one-one onto
- Finding Inverse
- Inverse of function: Proof questions
- Binary Operations - Definition
- Whether binary commutative/associative or not
- Binary operations: Identity element
- Binary operations: Inverse
Take a fresh quiz. Then take another.
Every attempt is a new AI-adaptive Teachoo quiz with 5 questions, selected from your answers, mistakes, and progress.
Transcript
Question 5 Are f and g both necessarily onto, if gof is onto? Let f : {1, 2, 3, 4} {1, 2, 3, 4} f is not onto g: {1, 2, 3, 4} {1, 2, 3} g is onto gof is onto. But g & f are not necessarily onto
