The solution set contained in R of the inequation
3x + 31 - x - 4 < 0, is:
(1, 3)
(0, 1)
(1, 2)
(0, 2)
If N denotes the set of all positive integers and if f : efined by f(n) = the sum of positive divisors of n then, f(2k, 3), where k is a positive integers, is
2k + 1 - 1
2(2k + 1 - 1)
3(2k + 1 - 1)
4(2k + 1 - 1)
C.
3(2k + 1 - 1)
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
The number of subsets of {1, 2, 3, . . . , 9} containing at least one odd number is
324
396
496
512
If a set A has 5 elements, then the number of ways of selecting two subsets P and Q from A such that P and Q are mutually disjoint, is
64
128
243
729
Let N be the set of all natural numbers, Z be
the set of all integers and be defined by
is onto but not one-one