Let A and B be sets. Show that f : A × B → B × A such that f(a, b) = (b, a) is bijective function.
f: A × B → B × A is defined as f(a, b) = (b, a).
.
∴ f is one-one.
Now, let (b, a) ∈ B × A be any element.
Then, there exists (a, b) ∈A × B such that f(a, b) = (b, a). [By definition of f]
∴ f is onto.
Hence,f is bijective.
In each of the following cases, state whether the function is one-one, onto or bijective. Justify your answer.
(i) f : R → R defined by f(x) = 3 – 4x
(ii) f : R → R defined by f(x) = 1 + x2
Show that the Modulus Function f : R → R, given by f(x) = |x|, is neither oneone nor onto, where | x | is x, if x is positive or 0 and |x| is – x, if x is negative.
Prove that the Greatest Integer Function f : R → R, given by f(x) = [x], is neither one-one nor onto, where [x] denotes the greatest integer less than or equal to x.
Determine order and degree(if defined) of differential equation yn + (y')2 + 2y =0
Find the direction cosines of a line which makes equal angles with the coordinate axes.
FYI V1 recaptcha will shutdown this Saturday
d