let the function `f` and `g` be one-one onto, then `gof` is

Prove that the function f:A rarr B is one-one onto,then the inverse function f^(-1):B rarr A is unique.

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

Let f: R-{n}->R be a function defined by f(x)=(x-m)/(x-n) such that m!=n 1) f is one one into function2) f is one one onto function3) f is many one into funciton4) f is many one onto funcionn then

Prove that the function f:R rarr R given by f(x)=2x is one-one and onto.

Show that the function f : R to R : f(x) =3-4 x is one-one onto and hence bijective.

A bijection function is both one-one and onto?.

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.