" Bijective Function: "

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

A function is said to be bijective if it is both one-one and onto, Consider the mapping f : A rarr B be defined by f(x) = (x-1)/(x-2) such that f is a bijection. A function f(x) is said to be one-one iff :

Is the reciprocal function a bijection ?

All constant functions are bijections.

A function is called one - one if each element of domain has a distinct image of co - domain or for any two or more the two elements of domain, function doesn't have same value. Otherwise function will be many - one. Function is called onto if co - domain = Range otherwise into. Function which is both one - one and onto, is called bijective. answer is defined only for bijective functions. Let f:[a, oo)rarr[1, oo) be defined as f(x)=2^(x(x-1)) be invertible, then the minimum value of a, is

Let f:AtoA where A={x:-1lexle1} . Find whether the following function are bijective x|x|

Let f:AtoA where A={x:-1lexle1} . Find whether the following function are bijective x^(4)

Let f:AtoA where A={x:-1lexle1} . Find whether the following function are bijective x|x|