then the correct matching of List-I from List-II is :
List-I list-II
(A) f(- 5) + f(- 4) (i) 14
(B) (ii) 4
(C) (iii) - 11
(D) f(f(f(f(0)))) + 1 (iv) 1
(v) 0
A. A B C D | (i) (iii) (vi) (ii) (v) |
B. A B C D | (ii) (iii) (iv) (ii) (v) |
C. A B C D | (iii) (iv) (iii) (ii) (i) |
D. A B C D | (iv) (iii) (vi) (v) (ii) |
The correct matching of List-I from List-II is :
List- I List-II
(A) (i)
(B) (ii)
(C) if x > 1, then (iii)
(D) (iv)
(v)
(vi)
A. A B C D | (i) (i) (iii) (iv) (v) |
B. A B C D | (ii) (ii) (iii) (iv) (v) |
C. A B C D | (iii) (iii) (ii) (iv) (v) |
D. A B C D | (iv) (ii) (iii) (i) (v) |
If f : R R is defined by f(x)=x - [ x] - for x R, where [x] is the greatest mteger not exceeding x, then is equal to :
Z, the set of all integers
N, the set of all natural numbers
, the empty set
R
If f : R R is defined by f(x) = [2x] - 2[x] for x R, where [x] is the greatest integer not exceeding x, then the range of f is :
{0, 1}
For all integers n > 1, which of the following is divisible by 9 ?
8n + 1
4n - 3n - 1
32n + 3n + 1
10n + 1
Eight different letters of an alphabet are given. Words of four letters from these are formed.The number of such words with at least one letter repeated is :
C.
Total number of words formed by 4 letters given from eight different letters with repetition = 84
The number of natural numbers less than 1000, in which no two digits are repeated, is :
738
792
837
720