The function f: is defined by f(x)=3- x. Observe the following statements
of it
I. f is one-one
II. f is onto
III. f is a decreasing function
Out of these, true statement are
Only I, II
Only II, III
Only I, III
I, II, III
If : RC is defined by f(x) =eix for x ∈ R, then f is (whereC denotes the set of all complex numbers)
one-one
onto
one-one and onto
neither one-one nor onto
If f(x) = 2x4 - 13x2 + ax + b is divisible by x2 - 3x + 2, then (a, b) is equal to
(- 9, - 2)
(6, 4)
(9, 2)
(2, 9)
A binary sequence is an array of O's and 1's. The number of n-digit binary sequences which contain even number of 0's is
2n - 1
2n - 1
2n - 1 - 1n
2n
Let R denote the set of all real numbers and RT denote the set of all positive real numbers. For the subsets A and B of R define f : A B by f(x) = x2 for x A. Observe the two lists given below
A | f is one-one and onto, 1. A = R, B = R If |
1 | A = R+, B = R |
B | f is one-one but not onto, If |
2 | A = B = R |
C | f is onto but not one-one, if |
3 | A = R, B = R+ |
D | f is neither one-one nor onto If |
4 | A = B + R+ |
A. A B C D | (i) 1 2 3 4 |
B. A B C D | (ii) 4 2 1 3 |
C. A B C D | (iii) 4 1 3 2 |
D. A B C D | (iv) 4 2 1 3 |
If f : RR2 and g : R R are such that g{f(x)} = and f{g(x)} = (sin )2, then a possible choice for f and g is
f(x) = x2, g(x) =
Onto but not one-to-one
One-to-one but not onto
One-to-one and onto
Neither one-to-one nor onto