If f : [2, 3] R is defined by f(x) = x3 + 3x - 2, then the range of f(x) is contained in the interval
[1, 12]
[12, 34]
[35, 50]
[- 12, 12]
The number of subsets of {1, 2, 3, ..., 9} containing atleast one odd number is
324
396
496
512
C.
496
The total number of subsets of given set is 29 = 512
Even numbers are {2, 4, 6, 8}.
Case I : When selecting only one even number.
= = 4
Case II : When selecting only two even numbers
= = 6
Case III : When selecting only three even numbers
= = 4
Case IV : When selecting only four even numbers
= = 1
Therefore, number of ways
= 512 - (4 + 6 + 4 + 1) - 1
= 496
[ Here, we substract 1 for due to the null set]
A binary sequence is an array of 0'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 - 1
2n
If x is numerically so small so that x2 and higher power of x can be neglected, then is approximately equal to
The locus of z satisfying the inequality , where z = x + iy, is
x2 + y2 < 1
x2 - y2 < 1
x2 + y2 > 1
2x2 + 3y2 < 1
If n is an integer which leaves remainder one when divided by three, then equals
- 2n + 1
2n + 1
- (- 2)n
- 2n
If X is a binomial variate with the range {0, 1, 2, 3, 4, 5, 6} and P(X = 2) = 4P(X = 4), then the parameter p of X is
The area (in square unit) of the circle which touches the lines 4x + 3y = 15 and 4x + 3y = 5 is
4