To show f is bijective , we need to prove
(i) f is injective i.e. one-one.
(ii) f is surjective i.e. onto.
(i) Let
x1,x2∈A Let f(x1)=f(x2)
⇒x1−2x1−3=x2−2x2−3
⇒(x1−2)(x2−3)=(x1−3)(x2−2)
⇒x1x2−2x2−3x1+6=x1x2−2x1−3x2+6
⇒x1=x2
Hence, f is one-one.
(ii) Let y be any arbitrary element of B. Suppose there exists an x such that f(x)=y,
i.e. (x−2)(x−3)=y
x−2=xy−3y.
⇒x=(3y−2)(y−1)
Since y≠1, x is real.
Further x≠3,
For if x=3,
Then, 3=(3y−2)(y−2)
3y−3=3y−2, which is false.
It follows that x=(3y−2)(y−1)∈A such that f(x)=y and so f is surjective.
Thus f is bijective.