Let `A` and `B` be two sets. Show that `f: AxxB->BxxA` defined by `f(a ,\ b)=(b ,\ a)` is a bijection.

Let A and B be two sets such that A - B = B-A, then

Let A and B be sets.Show that f:A times B rarr B times A such that (a,b)=(b,a) is bijective function.

Let A and B be two sets such that AxxB = {(a, 1), (b, 3), (a, 3), (b, 1), (a, 2), (b, 2)} Then,

If a funciton f:[2,oo] to B defined by f(x)=x^(2)-4x+5 is a bijection, then B=

Let f:[-pi/2,\ pi/2]->A be defined by f(x)=sinx . If f is a bijection, write set A .

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

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

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

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. Let g : R - {2} rarr R - {1} be defined by g(x) = 2f(x) - 1 . Then g(x) in terms of x is :