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.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Let `z in D,` then there is some `y in C` such that `g(y)=z`
` :.` Now if `y notin B`, then there is no x for which `f(x)=y`
` :. gof` is not onto.