If `f: AvecBa n dg: BvecC` are one-one functions, show that `gof` is one-one function.

Algorithm of one-one function

Statement-1 : If f(x) and g(x) are one-one functions then f(g(x)) and g(f(x)) is also a one-one function. and Statement-2 The composite function of two one-one function may or many not be one-one.

Which of the following is one-one function ?

Which of the functions defined below is one one function ?

Statement I: f : A->B is one - one and g : B->C is a one - one function, then gof :A->C is one - one Statement II : If f:A->B, g:B->A are two functions such that gof=IA and fog=IB, then f=g-1. Statement III : f(x)=sec 2x-tan2x,g(x)=cosec2x-cot2x, then f=g

If fandg are one-one functions,then (a) f+g is one one (b) fg is one one one (c)fog is one one (d) noneofthese

Let A be a finite set.If f:A rarr A is a one-one function,show that f is onto also.

Let A be a finite set.If f:A rarr A is an onto function,show that f is one-one also.

If f(x)=(x^(2)-x)/(x^(2)+2x), show that f is one-one function.

Let A be a finite set.If f:A rarr A is an onto function,show that f is one-one also.