Define a bijective function.

Define bijective function.

If f: R rarr R be a function defined by f(x)=4 x^3-7 , show that the function f is a bijective function.

Let f: N rarr N be defined by : f(n)= {(n+1, if n is odd),(n-1, if n is even):} .Show that f is a bijective function.

Show that the inverse of a bijective function is unique.

let f:ArarrB is a bijective function. Do you think f^(-1):BrarrA is also bijective? justify your answer.

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

If f:A rarr B,g:B rarr C are bijective functions show that gof:A rarr C is also a bijective function.

If f: A to B, g:B to C are two bijective functions then prove that gof:A to C is also a bijective function.