Let `f: A to B` and `g: B to C` be two functions. Then; (i)if `gof` is onto then g is onto; (ii)if `gof` is one one then `f` is one-one and (iii)if `gof `is onto and `g` is one one then `f` is onto (iv) if `gof` is one one and `f` is onto then `g` is one one.

Let f: A to B and g: B to 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.

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.

Let f: A to B and g: B to 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.

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

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

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

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

Let f: A -> B and g : B -> C be two functions and gof: A -> C is define statement(s) is true? a. If gof is one-one, then f anf g both are one-one b. if gof is one-one, then f is one-one c. If gof is a bijection, then f is one-one and g is onto d. If f and g are both one-one, then gof is one-one.

Let f : A rarr B, g : B rarr C be two functions such that gof is one-one and onto. Show that f is one-one and g is onto.

If f: A->B and g: B->C are one-one functions, show that gof is one-one function.