Algebra: Section A: Straight Objective Type

Algebra UNIT 1
Section A : Straight Objective Type (Only one correct answer)

1. Answer (1)
By division algorithm
x100 = (x2 – 3x + 2) g(x) + (ax + b) ...(i)
where ax + b is the remainder obtained when x100 is divided by x2 – 3x + 2, a polynomial of degree 2.
(i) can be recast as
x100 = (x – 1) (x – 2) g(x) + ax + b
Put, x  1,  1  a  b  a  2100  1
100 
x2  2  2a  b  b  2  2100
Thus, R(x) = ax + b = (2100 – 1)x + (2 – 2100)
.
= (2100 – 1)x + 2(1 – 299).
2. Answer (3)
Let,
|xy| |y z| |zx|
f ( x, y , z )   
|x||y | |y ||z| |z||x|
Two of the three number, say x and y, must have the same sign, therefore |x + y| = | x | + | y|
|y z| |zx|
f ( x, y , z )  1  
|y ||z| |z||x|
on the other hand, as |a + b| d |a | + |b|, we have
|y z| |zx|
f ( x, y , z )  1    1 1 1  3
|y ||x| |z||x|
| 1 1| | 1 1| | 1  1 |
f (1, 1,  1)     1 0  0  1
| 1 |  | 1 | | 1 |  | 1 | | 1 |  | 1 |
| 1 1| | 1 1| | 1 1|
f (1, 1, 1)     1 1 1  3
| 1|  | 1| | 1|  | 1| | 1|  | 1|
t 3
and for each t (1, 3), take x  1, y  z 
t 1
 t 3 t 3
then f ( x, y , z )  f 1, , 
 t 1 t 1
t 3 t 3 t 3 t 3
1  1
t 1 t 1 t 1 t 1
  
t 3 t 3 t 3 t 3
| 1|    | 1|
t 1 t 1 t 1 t 1
Corporate Office : Aakash Tower, 8, Pusa Road, New Delhi-110005. Phone : 011-47623456
2 Algebra Solutions of Success Magnet
2t  2 2
2 2 | t  1|
t 1 t  1
 1 1
3t 4
1
t 1 t 1
= (t – 1) + 1 = t
the f(x, y, –z) realizes all possible values in the interval 1 d t d 3.
3. Answer (2)
d1, d2, d3 .....dk are divisors of n and d1 + d2 + d3 +....+ d k = 72
1 1 1 1 1 n n n n 
   .....       ......  

d1 d 2 d 3 d x n  d1 d 2 d 3 dk 
1
 (d1  d 2  d 3  ....  d k )
n
72

n
4. Answer (2)
We employ the method of difference to telescope the sum
k 2 k 2 k 2 1 k 1
.
tk    2
 
k!  (k  1)!  (k  2)! k! {1  k  1  (k  1)(k  2)} k ! (k  2) (k  2)k ! (k  2)!
( k  2)  1 1 1
  
( k  2) ! (k  1)! (k  2)!
t1  1  1
2! 3 !
t2  1  1
3! 4!
........................................
t 2006  1  1
2007 ! 2008 !
1 1
Adding we have sum =
2 2008 !
5. Answer (1)
Harsha can always force a win. A set of three distinct rational non-zero numbers (a, b, c) such that
a + b + c = 0 will do. For any arrangement of numbers, the equation always has a solution 1 (rational) and
then the other root is also rational and different from 1.
6. Answer (2)
mz3  nz4 mz3  nz4
Let z1  , z2  H.C points
mn mn
z1  z2 

2 m2 z 3  n2 z 4   2  4z 3  z4 
2 2 3
m n
7. Answer (2)
Multiplying by 7! on both the sides, we get
3600 = 2520a2 + 840a3 + 210a4 + 42a5 + 7a6 + a7
3600 – a7 is a multiple of 7, which implies that a7 = 2
Solutions of Success Magnet Algebra 3
3598
Thus, = 514 = 360a2 + 120a3 + 30a4 + 6a5 + a6
7
514 – a6 is a multiple of 6 a6 = 4
510
Thus, = 85 = 60a2 + 20a3 + 5a4 + a5.
6
Then, it follows that 85 – a5 is a multiple of 5, whence a5 = 0. Continue in this process, we obtain a4 = 1, a3
= 1, a2 = 1.
Thus, the desired sum is 1 + 1 + 1 + 0 + 4 + 2 = 9.
8. Answer (3)
(x + y + z)n + (x – y – z)n
All the terms in the expansion of (x + y + z)n are positive. In the expansion of [x – (y + z)]n, we have nC0x n –
nC x n–1(y + z)1 + nC x n–2(y + z)2 – ...... Hence, the number of distinct terms would be equal to 1C + 3C +
1 2 1 1
2
5C  n  1
+ ...... + nC1 = 1 + 3 + 5 + ...... + n = 
 2 
1 , where n is positive odd natural number.
9. Answer (2)
Total number of quadrilaterals are = 10C4 = 210.
.
10
C1  5C3 10  10
The number of quadrilaterals which has no side common with decagon are    25
4 4
25 5
Probability  
210 42
10. Answer (3)
N = 2744 – 1 = 293 × 8 – 1 = (293)8 – 18
= (293 – 1) (293 + 1) ((293 )2 + 1) ((293)4 + 1)
= (293 – 1) (293 + 1) {(293)2 + 1 + 2293 – 2293} {(2124)3 + 13}
= (293 – 1) (293 + 1) {(293 + 1)2 – (247)2}{(2124 + 1)(2248 – 2124 + 1)}
= (293 – 1)(293 + 1)(293 + 247 + 1) (293 – 247 + 1)(2124 + 1)(2248 – 2124 + 1)
11. Answer (4)
We will show that the square can't have more than 12 terms. We will use the method of contradiction. Consider the
first 13 terms of the sequence.
a1 + a2 + a3 + a4 + a5 > 0
a2 + a3 + a4 + a5 + a6 > 0
.....................................
a9 + a10 + a11 + a12 + a13 > 0
Adding vertically, we get
(a1 + a2 +.........+ a9) + (a2 + a3 + .........a10) +........+ (a5 + a6 +.......+ a13) > 0
But, since sum of every 9 consecutive terms is negative, the sum on the left hand side of (i) must be negative, a
contradiction.
Hence the sequence can have 12 terms at the most.
12. Answer (4)

111
....
1  111
.....
1000  111
...(A)
123 times 120 1's
Now, 11111 = 41 × 271
We note that,
111
.....
1  11111 100001
......
00001
 111

120 1's 24 1's
...(B)
From (A) and (B)

111
......
1  11111 100001.....00001 1000  111
123 times
= 41 × 271 × 100001....00001 × 1000 + 111

Thus, 111
.....
11 when divided by 271 leaves a remainder of 111.
123 times
13. Answer (1)

Number of boxes having exactly i balls = number of boxes having at least i balls – number of boxes having at least
(i + 1) balls, (1 d i d r – 1)
? Number of boxes having exactly 1 ball = N1 – N2
Number of boxes having exactly 2 balls = N2 – N3
.
........................................................................
Number of boxes having exactly (r – 1) balls = Nr – 1 – Nr
Number of boxes having exactly r balls = Nr, for a box can hold a maximum of r balls.
Total number of balls = (N1 – N2) + 2(N2 – N3) + 3(N3 – N4) + ......+ (r – 1) (Nr – 1 – Nr) + r.Nr.
= N1 – N2 + 2N2 – 2N3 + 3N3 – 3N4+.....+(r – 2)Nr–1 + (r – 1)Nr–1 – (r – 1)Nr + r Nr
= N1 + N2 + N3 +...+ Nr–1 + Nr
Remarks:
This was a question on logical reasoning two important things are to be answered while having a go at this
problem.
1. How many boxes contain exactly i balls?
2. How many balls does box Nr contain?
14. Answer (3)
Consider
2006! + 2, 2006! + 3, ......., 2006! + 2006
1st number is divisible by 2, 2nd by 3,....and so on. Then all the numbers are composite.
2 3 51
? , , .......... .,
K ! 2 K ! 3 K !  51
Thus the number K! + 2, K! + 3,..... K! + 51 are all composite.
15. Answer (3)
Although there are standard methods of solving linear recurrence relation of a given order, we try to exploit the idea
of geometric progression to solve our problem.
an + 1 = 3an – 2an–1, n t 2 can be recast as
an + 1 – an = 2an – 2an–1 = 2(an – an–1)
Let bn = an+1 – an, n t 1, thus bn = 2bn – 1, n t 1
Thus bn is a G.P. of common ratio 2
? b n = 2n–1b1 = 2n–1(a2 – a1) = 2n(a1 – a0)
= 2n(3–2) = 2n
an 1  an  2n 
n 1 
an  an 1  2 
= 
.......... .......... ......
a2  a1  2 

Adding vertically, an + 1 – a1 = 2 + 22 + .... 2n
2(2 n  1)
  2 n 1  2
2 1
an + 1 = 2n + 1 – 2 + a1 = 2n + 1 – 2 + 3 = 2n + 1 + 1
an = 2n + 1
16. Answer (4)
We have, (1 + x + x2)n = a0 + a1x + a2x2 + ... + a2nx2n
Putting x = 1, we get
.
3n = a0 + a1 + a2 + ... + a2n
As we know that
m
 a1m  a2m  ...  anm   a1  a2  ...  an 
    
 n   n 
for 0 < m < 1
 a  a1  a2  ...  a2n   a  a  ...  a 1/2

?  0  0 1 2n

 2n  1   2 n  1 
 
1/ 2
 3n 
or a0  a1  a2  ...  a2n  2n  1 
 2n  1 
? a0  a1  ...  a2n  (2n  1)  3n
17. Answer (4)
In fact the product of two number of the form x 2 – dy 2 and u 2 – dv 2 is of the same form, where d is not a perfect
square.
( x 2  dy 2 )(u 2  dv 2 )  ( x  y d )( x  y d )(u  v d )(u  v d )
 {( x  y d )(u  v d )}{( x  y d )(u  v d )}
 (ux  vx d  yu d  vyd )( xu  xv d  yu d  vyd )
 {(ux  yvd )  (vx  yu ) d }{( xu  yvd )  (vx  yu ) d }
 (ux  yvd )2  (vx  uy )2 d
18. Answer (2)

Let u = x3
then x3(x3 + 1) (x3 + 2) (x3 + 3) = u(u + 1)(u + 2) (u + 3)
= u(u + 3) (u + 1) (u + 2)
= (u2 + 3u) (u 2 + 3u + 2)
= {(u 2 + 3u + 1) – 1} {(u 2 + 3u + 1) + 1}
= (u2 + 3u + 1)2 – 1
= (x6 + 3x3 + 1)2 – 1
Thus the minimum value of the expression is –1. But we must ensure that it's attained too. For that we note that
the minimum value is attained where x6 + 3x3 + 1 = 0, i.e., for the real roots of x 6 + 3x 3 + 1 = 0.
19. Answer (1)
2 2
 a b  
Observe that 1 lies between   and  a  b 
  
 2 a   2 b 
2 2
   
We have,  a  b   1   a  b 
 2 a   2 b 
( a  b )2 ( a  b )2 ( a  b )2 ( a  b )2
.
 ( a  b )2 
4a 4b
(a  b )2 a  2 ab  b (a  b )2
 
8a 2 8b
(a  b ) 2 a  b (a  b ) 2
  ab 
8a 2 8b
(a  b ) 2 (a  b ) 2
D
8a 8b
20. Answer (1)
Check that x = 2 is a solution
Rewrite the equation as
x x x x
 10    11    12   1   14 
       
 13   13   13   13 
L.H.S. is a decreasing function of x and the R.H.S. is an increasing function of x. So, their graphs can have
at most one point of intersection. So, there is exactly one solution that we have found x = 2.
21. Answer (2)
2( k  1  k )  2  1
k 1  k 1 k
Using this we get,
80 80
1  2 ( k  1  k )  16
k 1 k

k 1
Again,
2( k  k  1)  2  1
k  k 1 k
Using this we get,
80 80
1  1  2 ( k  k  1)  2 80  1  17

k 1 k k 2

Thus, 16 < S < 17
? [S] = 16
22. Answer (1)
x a
xa  ax
Taking loga, we have a x log a x = x a
The L.H.S is a decreasing function and the R.H.S is an increasing function. Hence there is at most one
solution. By inspection one solution x = a is obvious, this is the only solution.
23. Answer (1)
1 1
N  (a  a 2  1) n  (a  a 2  1) n
b 1
b
where,
.
1
b  (a  a 2  1) n
b m 1  1   b  1  b m  1    b m 1  1 
    
b m 1  b  bm   b m 1 
1
If we assume N to be rational, then we obtain that b m  m is rational for all m N.
b
1
But b n  n  a  a 2  1  a  a 2  1  2a, an irrational number.
b
Hence we have reached a contradiction. Thus N is irrational.
24. Answer (4)
The system of equations just says that
2
x2  y 2 2
 z 2  w 2 1
2 2
t 1 t 3 t 5 t 7
is satisfied by t = 4, 16, 36 and 64.
The equation is equivalent to polynomial
P(t) = 0
P(t ) = (t – 1)(t – 9)(t – 25)(t – 49)–x 2 (t – 9)(t – 25)(t – 49) –y 2(t – 1)(t – 25)(t – 49) – z 2(t – 1)(t – 9)
(t – 49) – w 2(t – 1)(t – 9)(t – 25)
Comparing the coefficient of t 3 in the another expression for
P (t) = (t – 4)(t – 16)(t – 36)(t – 64)
we have,
1 + 9 + 25 + 49 + x 2 + y 2 + z 2 + w 2 = 4 + 16 + 36 + 64
x 2 + y 2 + z 2 + w 2 = 36
25. Answer (4)


n! x
Consider  n( x  1)( x  2).....( x  n )
n 1
we have,
x  1 1
n( x  n ) n x  n
n! x (n  1) ! n!
 
n( x  1)( x  2)....( x  n ) ( x  1)....( x  n  1) ( x  1)....( x  n )
Telescoping this sum to infinity, we get,
n! x
1
n( x  1)( x  2)....( x  n )
(n  1)!
?  1
( x  1)( x  2).....( x  n ) x
26. Answer (4)
The numbers are a, a + 4, a + 14
i.e., a, (a + 1) + 3, (a + 2) + 4 × 3
Modulo 3 the numbers are congruent to a, a + 1, a + 2. They being consecutive integers, one of them is
.
divisible by 3. So one of a, a + 4, a + 14 is divisible by 3.
The only number is divisible by 3, that is prime is 3 itself. So only for a = 3 are the numbers a, a + 4,
a + 14 prime (viz., 3, 7, 17).
27. Answer (2)
x g(x – 1) = (x – 3) g(x) ...(i)
∵ x does not divide (x – 3)
? x divides g(x)
Similarly (x – 3) divides g(x + 1)
i.e., (x – 2) divides g(x) (replace x by (x – 1)
? g(x) = x(x – 2) I(x)
? From (i)
x(x – 1) (x – 3) I(x – 1) = (x – 3) x(x – 2) I(x)
? (x – 1) I(x – 1) = (x – 2) I(x)
? (x – 1) divides I(x)
? g(x) = x(x – 1) (x – 2) h(x)
Again from (i)
x(x – 1) (x – 2) (x – 3) h(x – 1) = (x – 3) x (x – 1) (x – 2) h(x)
? h(x) = h(x – 1)
? h(x) is constant function
? g(x) = Ox (x – 1) (x – 2)
g(3) = 6 = 6O O = 1
? g(25) = 252423
= 13800
28. Answer (2)
Both m and n factors of 23 74 1313.
So m  2a1 7 b1 13 c1 and n  2a2 7 b2 13 c2

For some non-negative integers a1, b1, c1, a2, b2, c2.
Since 23 74 1313 is the least common multiple.
max {a1, a2} = 3
max {b1, b2} = 4
max {c1, c2} = 13
Hence {a1 a2} can be equal to
(0, 3), (1, 3), (2, 3), (3, 3), (3, 2), (3, 1) or (3, 0) a total of 7 choices.
Similarly, since (b1, b2) = 4 for {b1, b2} we have 2 × 4 + 1 = 9 choices.
Again, since maximum {c1, c2} = 13, for {c1, c2} we have 2 × 13 + 1 = 27 choices.
Hence, the number of ordered pairs (m, n) = 7 × 9 × 27 = 1701.
29. Answer (4)
2D + 2E + 2J = 28
By observation following triplets represent (D, E, J).
.
(2, 3, 4), (2, 4, 3), (3, 2, 4), (3, 4, 2), (4, 2, 3), (4, 3, 2). Total 6 triplets are possible.
30. Answer (4)
Case-I : Let f(3) = 5, then
(i) f(2) = 5 and f(1) can take 5 values,
f(1) = 1, 2, 3, 4, 5 5 maps.
(ii) f(2) = 4 and f(1) can take 4 values,
f(1) = 1, 2, 3, 4 4 maps.
(iii) f(2) = 3 and f(1) can take 3 values,
f(1) = 1, 2, 3 3 maps.
(iv) f(2) = 2 and f(1) can take 2 values,
f(1) = 1, 2 2 maps.
(v) f(2) = 1 and f(1) can take 1 value,
f(1) = 1 1 map.
So for the case f(3) = 5
We have total of (1 + 2 + 3 + 4 + 5) = 15 maps.
Case-II : f(3) = 4, then
(i) f(2) = 4, … in this case f(7) can take 4 values 4 maps.
..............................
..............................
..............................
..............................
(ii) f(2) = 1, in this case f(1) can take 1 value 1 map.

So for f(3) = 4, number of maps = 1 + 2 + 3 + 4 = 10 maps.
Case-III : f(3) = 3, number of maps = 1 + 2 + 3 = 6 maps
Case-IV : f(3) = 2, number of maps = 1 + 2 = 3 maps
Case-V : f(3) = 1, number of map = 1 (viz., f(1) = f(2) = f(3) = 1)
Total number of maps = 1 + 3 + 6 + 10 + 15 = 35.
31. Answer (4)
We can write the relation as
x12 + x22 = y12 + y22 = c12 where c2 = 2
Let x1 = c cosT, x2 = c sinT and y1 = c cosI, y2 = c sinI
P = (1 – x1)(1 – y1) + (1 – x2)(1 – y2)
= (1 – c cosT)(1 – c cosI) + (1 – c sinT)(1 – c sinI)
= 1 – c(cosT + cosI) + c2cosT cosI+ 1 – c(sinT + sinI) + c2 sinT sinI
= 2 – c{(cosT + sinT) + (cosI + sinI)} + c2 cos(T – I)
    
 2  2c.sin      sin       c 2 cos(  )  2  2 2c  c 2  P  ( 2  c )2
  4  4
.
As c  2 we have P  ( 2  2 )2  8
? Pmax = 8.
32. Answer (1)
The given equation can be written as
|x2 – 4x + 3| + |6x– x2 – 8| = |2x – 5| = |(x2 – 4x + 3) + (6x – x2 – 8)|
and in this case
(x2 – 4x + 3)(6x – x2 – 8) t 0
(x2 – 4x + 3) (x2 – 6x + 8) d 0 (x – 1) (x – 3)(x – 2)(x – 4) d 0
+ – + – +
– 
1 2 3 4
x [1, 2] [3, 4]
Hence number of integral value of |x| = 4
33. Answer (4)
(z + DE)3 = –D3
z1 = –DE – D, z2 = –DE – DZ, z3 = –DE – DZ2.
They form an equilateral triangle with side
3
| z1  z2 |  | (  1) |  |  |  3  i  3 ||
2 2
34. Answer (3)

Tn = (n2 + 1) n
= [(n + 2) (n + 1) – 3(n + 1) + 2] n
= n  2  3 n 1  2 n
Tn  ( n  2  n  1)  2 ( n  1  n )
T1  ( 3  2)  2( 2  1)
T2  ( 4  3)  2( 3  2)
T3  ( 5  4)  2( 4  3)
Tn  ( n  2  n  1)  2( n  1  n )
On adding we get
T1 + T2 + T3 + .... + Tn = ( n  2  2)  2( n  1  1)
= n  1 (n  2  2)
= n n 1
35. Answer (2)

A is z, ? B = iz, C = i 2z, D = i 3z
z (i  i 2  i 3 )   z
The centroid of triangle BCD is .
3 3
.
36. Answer (2)
C(z3)
Rotation about B gives
z1 – z2 = (z3 – z2)Z
2
3
z3 – z2 = Z2 (z1 – z2)
B(z2)
z3 = Z2 z1 + (1 – Z2) z2 A(z1)
37. Answer (1)
As, E2 – 2DE + 4D2 = 0
2
     
    1 0
 2   2 

  or – Z2
2
E = –2DZ or – 2DZ2
1 1 3
So, required area of 'OPR  |  | |  | sin120   4  8  8 3
2 2 2
38. Answer (1)
200 < 2n < 900
n = 8, 9
but condition is given that only one middle term exists. So, possible value of n is 8.
8 1
4 5
1
1
x
4 1 5
 
9 1 9
1
x
9 1 9
  1
5 x 4
4 1 5
 
5 x 4
4 5
x
5 4
39. Answer (1)
1 3 5
Let,    k (say)
| z1  z2 | | z2  z3 | | z1  z3 |
1 3 5
? | z1  z2 |  , | z2  z3 |  and | z1  z3 | 
k k k
1 9 25
or, ( z1  z2 )( z1  z2 )  , ( z2  z3 )( z2  z3 )  2 and ( z1  z3 )( z1  z3 )  2
k2 k k
1
So,  k 2 ( z1  z2 )
z1  z2
9
 k 2 ( z2  z3 )
z2  z3
25
.
 k 2 ( z3  z1 )
z3  z1
1 9 25
?   0
z1  z2 z2  z3 z3  z1
40. Answer (4)
Im axis
3 + 4i
i
P
Real axis
0 1
4
The minimum value is at P i.e. at the point of intersection of x + y = 1 and y = x
3
3 4
? P  , 
7 7
(|z| + |z – 1| + |z – i| + |z – 3 – 4i|)min
5 4 3 30
=  2 2 5 2
7 7 7 7
41. Answer (2)

z = x + iy
x2 + y2 + (4 – 3i) (x + i y) + (4 + 3i ) (x – i y) + 5 = 0
x2 + y2 + 8x + 6y + 5 = 0, a circle of radius = 42  32  5  2 5 .
42. Answer (1)

Let z = x + iy
|x| + |y| = 8, |x| |y| = k
Applying A.M. t G.M.
|x||y |
 | x || y |
2
4 k
k d 16
43. Answer (2)
A z1
AOB = AOC = D
If z1 = re iT, then
O
z2 = re iT . e iD
and B z2 C z3
z3 = re iT . e –iD
? z2 z3 = r2 e2iT = z12
.
44. Answer (1)
Let PQ be the diameter A AB and CD Pz
A B z2
z1 = ze iD , z2 = ze –iD z1

z3 = –ze –i E , z4 = – ze iE O
? z1z2 = z3z4  
C D z4
45. Answer (1) z3
OB = OA cosT, OC = OA cos 2T. –zQ
z2 = (z1eiT) cosT
z3 = (z1e2 iT) cos2T C z3
Bz
 z3  2
? z22 = z12 . e2 iT. cos2T = z12 cos2T.  
 z1 cos 2  
O  A
z z cos 2  z1
? z22  3 1
cos 2
or z22 cos 2T = z3 z1 cos2 T.
46. Answer (2)
Let B corresponds to z.
Rotation about E, we get D C
z – (6 – i ) = [(1 – 2i ) – (6 – i )] i
= 1 – 5i E 6–i
z = 7 – 6i
By mid-point formula A B
1 – 2i z
C is 2(6 – i ) – (1 – 2i ) = 11
D is 2(6 – i ) – (7 – 6i ) = 5 + 4i.
47. Answer (2)

From question
2a2D2 + bD + c = 0
? bD + c = –2a2D2 …(i)
also, 3a2E2 – 2bE – 2c = 0
3
? b  c  a 22 …(ii)
2
Now, let f(x) = 4a2x2 + 3bx + 3c
Then f(D) = 4a2D2 + 3(bD + c)
= 4a2D2 – 6a2D2 …[from (i)]

= –2a2D2 < 0
f(E) = 4a2E2 + 3bE + 3c
= 4a2E2 + 3(bE + c)
2 2 9 2 2
= 4a   a  …[from (ii)] 
2 x-axis
 
.
17 2 2
= a  0
2
∵ f(D) f(E) < 0, then one root of the equation f(x) = 0 must lie between D and E.
48. Answer (2)
| z   |2 |  z  1 |2
( z   ) ( z   )  (  z  1) (z  1)
|z|2 + |D|2 = |D|2 |z|2 + 1
(|D|2 – 1) (|z|2 – 1) = 0
|z| = 1 since |D| z 1.
49. Answer (3)
| z   |2  |  z  1 |2
( z   ) ( z   )  (  z  1) (z  1)
|z|2 + |D|2 – |D|2 |z|2 – 1 > 0
(|z|2 – 1) (1 – |D|2) > 0

|z|2 – 1 < 0 since 1 – |D|2 < 0
? |z| < 1
50. Answer (3)
1
z  i z = –iZ, –iZ2,
z
1
z 2005  2005
 i (   2 )  i
z
51. Answer (3)
Z13 = 1
Now, a + b = Z + Z2 + Z3 + Z4 + Z5 + Z6 + Z–4 + Z–3 + Z–1 + Z–6 + Z–5 + Z–2
= (Z + Z2 + ... + Z6) + (Z7 + Z8 + ... + Z12)
= –1
Also, ab = (Z + Z3 + Z4 + Z–4 + Z–3 + Z–1) × (Z2 + Z5 + Z6 + Z–6 + Z–5 + Z–2)
= 3(Z + Z2 + Z3 + ... + Z12)
= –3
Therefore, equation is given by
x 2 – (a + b)x + ab = 0
x2 + x – 3 = 0
52. Answer (3)
x 2 – 2x + 4 = 0
x  1  3i  1  3i , 1  3i
x = –2Z, –2Z2
Now, D 8 + E 8 = (–2Z)8 + (–2Z2)8
= (–2)8{Z8 + Z16}
.
= 256(Z + Z2)
= –256
53. Answer (4)
The locus is a circle with its interior.
15
OP is tangent to the circle at P. 25 i
C
CP 15 3
cos     
CO 25 5 P
4 ∵ 0  0    25
∵ sin     . Also PO = 25 2  15 2  20 
5  2
O
Now the coordinates of P in the argand plane is 20 (cosT + i sin T)
3 4
= 20  i 
 5 5 
= 12 + 16i
54. Answer (3)
z2 = Z2 |z| = |Z|
? B A
Also (1, i ) A ∵ |1| = |i|
But (1, i ) B ∵ 12 z i 2
55. Answer (1)
The geometric meaning of the expression is the sum of the squares of distances of any point inside P to the
vertices of the right angled triangle formed by points (0, 0), (3, 0), (0, 6). The least value of the sum of squares
of any point inside the triangle to the vertices turns out to be 30.
56. Answer (1)

|zz | 3
A
3 C
|x|
2 O
The circle is having centre origin & radius 1
D B
Area of shaded portion
 Area of OCD]
= 4 [Area of OAB
–3 3
x= x= 2
1  1 3 1  3 2
 4  . (1)2  . .  
2 3 2 2 2 3 2
57. Answer (4)
Roots are 2Z, 2 + 3Z, 2 + 3Z2, 2 – Z – Z2.
i.e. 2Z, 2 + 3Z, 2 + 3Z2, 3
The roots 2 + 3Z, 2 + 3Z2 can come from a 2nd degree polynomial with real coefficients.
Again the root 2Z can come from a 2nd degree polynomial with real coefficients.
The root 3 comes from a linear polynomial.
Thus the least possible degree is 5.
.
58. Answer (4)
f(x) is divisible by x2 + x + 1 = (x – Z) (x – Z2)
? Z and Z2 are roots of f(x) = 0
? g(Z3) +Zh(Z3) = 0
g(1) + Zh(1) = 0
and g(1) + Z2h(1) = 0
g(1) = h(1) = 0
59. Answer (4)
z 1 1  3
Let   z
z3  1
As |z| = 1 |Z – 1| |1 + 3Z|
(Z– 1) = 3   1
3
1
1    
 3
The locus of Z is a circle, the radius being
1
3
3
4/3 4 1
=  
8/3 8 2
60. Answer (2)
z2 
 
z 2 3
This will denote part of the circle.
61. Answer (2)
n
 z  1 1
( z  1)n  z n     1  1   (1)1/ n
 z  z
1 2k 2k
1  cos  i sin ; k = 0, 1, 2, ........ n – 1.
z n n
1
But k = 0,  0 , impossible.
z
 2k  2k
  1  cos   i sin
1  n  n
? z = 2k 2k =  2
 1  cos  i sin 2k  2k
n n   1  cos   sin
 n  n
2k  2k
 1  cos   i sin n
 n 
=
 2k 
21  cos 
 n 
k k
i .2 sin . cos
1
=   n n   1  i cot k
2 k  2 2 n
2 .  2 sin2 
 n 
.
1 1 1
Thus, Re( z )   or x   , show that the roots of the equation (z + 1)n = zn lie on the line x   .
2 2 2
62. Answer (1)
A B
  1 A2 – AB + B2 = 0
B A
2 2
A   B  B  4B  B  3Bi
2 2
 1  3i 
A   B = –ZB, –Z2B

 2 
|A| = |B|
Now A – B = –ZB – B = Z2B
or A – B = –Z2B – B = –(Z2 + 1)B = ZB.
i.e. |A – B| = |Z2 B| or |ZB| = ZB
|A – B| = |A| = |B|
|A – B| = |A – 0| = |B – 0|
Showing that the origin point A and point B form an equilateral triangle.
63. Answer (4)
n
  r 2 .  n Cr  nCr 1    2r  1 .n Cr 
r 1
  r  1
2
. nCr  r 2 · nCr 1 = Vr 1  Vr
r 1
f(n) = Vn+1 – V1 = (n + 1)2 · nC

r – 1 = n2 + 2n
? f(50) = 502 + 2 × 50 = 2500 + 100 = 2600
64. Answer (1)

A solution could be given consisting in eliminating two variables out of three and then arrive at an equation in
just one variable. But the symmetry of the system can be exploited to observe some elegent decomposition.
    y 
 x  1  y  1  z  1    x  1  yz   1  1 
 y  z  x  y  x zx 
 1 1 1  1 
= ( x  y  z )   x  y  z    xyz  xyz 
   
 1  1  1 1
=  x  y    y  z    z  x   xyz  xyz
 
 7 ( 4)(1)  7  4  1  xyz  1
3 3 xyz
xyz  1  2
xyz
(xyz)2 – 2(xyz) + 1 = 0
(xyz – 1)2 = 0 xyz = 1
65. Answer (3)
To write the first nine single digit number from 1 to 9, both inclusive, the number of digits used = 9.
To write the two digit numbers from 10 to 99, number of digits required = (99 – 9) × 2 = 180.
.
So the total number of digits used in writing up to 99 is 189.
Given that the number of digits used in writing up to n is 1998.
The number of three digit numbers = 999 – 99 = 900.
So number of digits used up in writing all three digit numbers = 2700 > 1998.
So n should be less than 999.
Number of digits used to write the three digit numbers up to n is 1998 – 189 = 1809.
1809
So number of three digit numbers = = 603, since each takes three digits to write. And a three digit
3
number starts with 100.
? Number of numbers = one digit numbers + two digit numbers + three digit numbers
= 9 + 90 + 603 = 702
66. Answer (3)
n   n   n 
The greatest power of a prime p in n! is     2    3   .......
 p   p   p 
Number of zeros at the end of n! = greatest power of 5 in n!
n   n  n n  n  .......
=       .......  
 5   25  5 25 125
n 1 1 
  1   ....... 
5  5 25 
 
n  1  n
 · 
5  1 4
 1  
 5
n
as > 1998 n > 7992
4
For n = 7995, the number of zeroes at the end
 7995    7995    7995    7995    7995 

= 
 5   25   125   625   3125 
= 1599 + 319 + 63 + 12 + 2
= 1995
For n = 8000, we have, the number of zeroes at the
end = 1600 + 320 + 64 + 12 + 2 = 1998.
Thus, there is just one value of n, i.e. 8000.
67. Answer (2)
a3 = a2 + a1
a4 = a3 + a2 = 2a2 + a1
a5 = a4 + a3 = 3a2 + 2a1
a6 = a5 + a4 = 5a2 + 3a1
a7 = a6 + a5 = 8a2 + 5a1
a8 = a7 + a6 = 13a2 + 8a1
We are given that 8a2 + 5a1 = 120, a1 < a2
.
5(24  a1 )
Clearly 5 divides a2 since a2  and a1 is a positive integer.
8
a1 can take values 8 and 16 where a1 = 8, a2 = 10.
When a1 = 16, a2 = 5 which is not possible since a2 > a1.
? a1 = 8, a2 = 10.
Hence a8 = 13a2 + 8a1 = 13(10) + 8(8) = 194.
68. Answer (2)
Let Sm  m [2a  (m  1)d ], Sn  n [2a  (n  1)d ]

2 2
m
[2a  (m  1)d ]
Sm m2
?  2 
Sn n n2
[2a  (n  1)d ]
2
2a  (m  1)d m (2a  d )  md md
2a  (n  1)d  n  (2a  d )  nd  nd
If 2a = d, then in this case the rate can be m2 and n2.

Note that,
10 2  100  25
12 2 144 36
Tm a  (m  1)d a  (m  1)2a 2m  1
  
Tn a  (n  1)d a  (n  1)2a 2n  1
T31 31 2  1 61
?  
T29 29  2  1 57
69. Answer (3)

 2 3 1  2 1 4
 1       –   1     – 2   
   
 1 3 4  1 2 3 4
 1   – 3        1– 4        = (–2Z ) (–2Z ) (–2Z ) (–2Z)
4 3 2
     
= 16Z10
= 16
70. Answer (2)
1
By the graph of y  K and y || x |2 3 | x | 2 | we get 8 solutions if 0  K  , Hence, number of integral value
4
of 8K is 1.
y
(0, 2)
1
0,
4
y=k
.
–2 –1 1 2 x
71. Answer (1)

Observed that 10025 – 25 = 1050 – 25
1000
.........  25  999
00 ......... 9 75
=
50 zeroes

48 9'S

So the sum of its digits = 9 × 48 + 7 + 5 = 432 + 12 = 444.

72. Answer (3)
Let 24 + 27 + 2n = m2, m being an integer
16 + 128 + 2n = m2.
2n = m2 – 144 = (m – 12) (m + 12)
(m – 12) and (m + 12) are both powers of 2.
Also (m + 12) – (m – 12) = 24. So the problem amounts to finding two powers of 2 whose difference is 24.
Observe, 21 = 2, 22 = 4, 23 = 8, 24 = 16, 25 = 32, 26 = 64, 27 = 128.
We have 25 – 23 = 24 and as 2n grows rapidly, we can’t have a pair other than (25, 23) having a difference of 24.
Consequently m – 12 = 8 and m + 12 = 32
m = 20 and 2n = 32 × 8 = 256 = 28
? n = 8.
There is only one value of n that makes 24 + 27 + 2n a perfect square.
73. Answer (1)
The number is divisible by 5
The digits will be 1, 2, 3, 4, 5 or 0, 1, 2, 4, 5
Total number of ways = 5! + 4 × 4! = 216
74. Answer (4)
log3 | z1| log 1 2

 125   64 
 100    9 y
   100 
(0, 3) P
log3 | z1| 2 log 1 2
5 5 2
or 4   9
  4 S C
x
(–1, 0) O (1, 0) (3, 0)
log3| z1| log3 2
5 5 2
or 4  
  4
(0, – 3) Q
log3|z – 1| d log32
|z – 1| d 2
z lies inside the circle of radius 2 with centre { (1, 0)
Also, ∵ Re(z) < 0
 Ar CPQ
Area of the required region is the shaded area which is equal to  Ar CPSQC
Equation of the circle is |z – 1| = 2

(x – 1)2 + y2 = 4
.
On putting x = 0 we get,
y2 = 3
? y  3
P  (0, 3) and Q  (0, 3)

PCO 
3
 4 sq. unit
Ar CPSQC
3
1
Now, Ar CPQ  1 2 3  3
2
 4 
? The sought result =   3  sq. unit
 3 
75. Answer (2)
Consider the expression y 2
y = ax – bx – c
y = ax2 – bx – c ; a, b, c R +
b
Here,     x
a  
c
and   
a Figure-1
where D, E are the roots of the equation ax2 – bx – c = 0
Since, DE < 0. So, graph of y = ax2 – bc – c can be drawn as figure-1
Therefore, graph of y = ax2 – b|x| – c can be drawn as figure-2 y
Obviously number of solution of the equation

ax2 – b|x| – c = 0 in this case is 2
x
n=2 – 
Now, |z – 4i| = 3
y Figure-2
C
(0, 4)
Q 3 P
z2 4 z1
7 7
x
O
z lies on the circle having centre (0, 4) and radius 3

P(z1) and Q(z2) are the points having least and greatest arguments
Obviously, |z1 | = |z2 | = 7
.
1 1
? z 1
2
 z2 
2 n
 (14) 2  14
76. Answer (1)

Let r be the common ratio of the G.P.
a1
5  a1  5 1  r 
1 r
2
a12 52 1  r 
Also, 5 i.e. 5
1 r 2 1 r 2
2 5
r  a1 
3 3
2
2 52 20
3rd term = a1r    
33 27
77. Answer (4)
x lies between –5 and 9
x + 5 and 9 – x are positive numbers.
Apply A.M. > G.M.
9x  x 5 1
4   3 3   9  x 4 x  5 3 7
 4       
43   .  
 4   3  
(9 – x)4 (x + 5)3 < 27.44.33

Maximum value is 27.33.44.
78. Answer (2)

r
5!  1
General term = 3 p (  x 2 )q  
p!q ! r ! x
where p + q + r = 5 and 2q – r = 4
q=2 r=0 p=3
q=3 r=2 p=0
5! 3 5!
? The required co-efficient of x4 = .3 ( 1)2  ( 1)3 = 260
2!3! 3!2!
79. Answer (1)

Let z1 = x1 + iy1 and z2 = x2 + iy2
Then, z1 + z2 = (x1 + x2) + i(y1 + y2)
Now, (z1 + z2) = |x1 + x2| + |y1 + y2|
d |x1| + |x2| + |y1| + |y2|
= (z1) + (z2)
80. Answer (4)
.
The total number of rectangles with odd length and breadth
= (1 + 3 + 5 + 7 + .....+ 2m – 1) (1 + 3 + 5 + 7 + .....+ 2n – 1)
= m2 n2
81. Answer (2)
The total number of wrong answers = n.20 + (n – 1)21 + (n – 2)22 + .....+ 12n – 1
= 2047
n = 11
82. Answer (4)
Number of words starting with E = 120
Number of words starting with H = 120
Number of words starting with ME = 24
Number of words starting with MH = 24
Number of words starting with (MOE) = 6
Number of words starting with (MOH) = 6
Number of words starting with (MOR) = 6
Number of words starting with (MOTE) = 2
The rank of the word = 309
83. Answer (3)
n n(n  1)
The number of point of intersection = C2 
2!
n( n 1)
2 C n(n  1)(n  2)(n  3)
The number of fresh lines = 2 n 
8
84. Answer (2)

2nC + 3. 2nC2n – k + 1 + 3. 2nC2n – k + 2 + 2nC
2n – k 2n – k + 3
= 2nCk + 3. 2nCk – 1 + 3. 2nCk – 2 + 2nC

k–3
2n 2n 2n 2n 2n 2n
= Ck + Ck – 1 + 2. Ck – 1+ 2. Ck – 2 + Ck – 2 + Ck – 3









= 2n + 1Ck + 2. 2n + 1Ck – 1 + 2n + 1C
k–2 [according to Pascal’s law]
2n + 1 2n + 1 2n + 1 2n + 1
= Ck + Ck – 1 + Ck – 1 + Ck – 2






= 2n + 2Ck + 2n + 2C
k– 1 = 2n + 3Ck
85. Answer (3)
n!     
 0  1  2  .......  m  .......  n
x( x  1)( x  2).......( x  n ) x x 1 x  2 xm xn
By thumb rule,
n!
m 
( m )( m  1).......( m  m  1)( m  m  1).......( m  n )
.
n!
=
( m )( m  1).......( 1).(1)(2).......(n  m )
n! n!
= m = m
 ( 1)m n
Cm
( 1) m(m  1)........(1)(n  m )! ( 1) m !(n  m )!
? 7 = (–1)7 nC7.
86. Answer (1)
The number of ways to select 1st station = 10

The number of ways to select 2nd station = 7
10 5  4  2  5
The total number of ways =  50
3!
87. Answer (1)
8! = 27 × 32 × 5 × 7 for odd factors of the form 3m + 2
we can take only combinations of 5 & 7
The required factors are 5 & 35.
sum = 40.
88. Answer (4)
The total number of non-negative integral solution of x + y + z d n
= The total number of non-negative integral solution of x + y + z + t = n
= n + 3C3
89. Answer (1)
Obviously the LCM is got by taking the greater of ai and bi. Hence choice (1) is correct.
90. Answer (3)
One has to think of worst can scenario. It one takes out 82 balls, there is still a possibility that the hypothesis
of the problem is not satisfied. For example 82 balls could have 41 green balls, 34 black balls and 7 blue
balls. Then 83 is the minimum number of balls one needs to take out to be sure that the number of balls of
any two colours exceeds the number of balls of the remaining colour.
91. Answer (3)
b = ar, c = ar2
log x
loga x 
log a
log x
logb x 
log a  log r
log x
logc x 
log a  2 log r
.
2 loga x · logc x
logax, logbx, logcx are in HP because logb x 
loga x  logc x
92. Answer (1)
Rewrite D as
D = 4673 + 6734 = 44672 + 6734 = 4(4168)4 + 6734
= 4a4 + b4, (say), where a = 4168, b = 673.
Observed that 4a4 + b4 can be factorized
4a4 + b4 = (2a2 + b2)2 – 4a2b2
= (2a2 + b2 – 2ab) (2a2 + b2 + 2ab)
D is composite,
∵   4 929  929 4 
 232 4 4 
Similarly E is composite   4  (4 )  929 
93. Answer (2)
P (GBB or BGB or BBG)
3 2 3 1 2 3 1 2 1 13
x . .  . .  . . 
4 4 4 4 4 4 4 4 4 32
94. Answer (4)
Let n = (am am–1...a1a0)10 where a0, a1,.....am are digits of positive integer n, be the decimal representation of n.
n – Sn = (am10m + am–110m–1 +........+ a110 + a0) – (am + am–1 + ........ + a1 + a0)
= am(10m – 1) + am – 1(10m – 1–1) + .........+ a1(10 – 1) ...(i)
As every number of the form 10K – 1 is divisible by 10 – 1 = 9,
n – Sn is divisible by 9.
But n – Sn = 1234, which is not divisible by 9.
Hence no such n exists.
95. Answer (4)

10999 = (2 × 5)999 = 2999 × 5999 has been written in prime factorisation form.
Number of divisors of 10999 is (999 + 1) (999 + 1) = 10002.
Again, 10998 = 2998 × 5998
So, number of divisors of 10998 = (998 + 1)(998 + 1) = 9992
All the divisors of 10998 also divide 10999
Hence the number of divisors that divide 10999 but not 10998
= 10002 – 9992 = (1000 – 999) (1000 + 999) = 1999.
96. Answer (4)
35 21
Let a  2 2  1 and b  2 2 1
 
35 22 2 13
 2 13 22
a  2  22  1  22  1  22 1
K
  2 2
22  13
  1, K  2
 
K
But  2 2   1 is divisible by 2 2  1,
22 22
 
.
 2 22  1m, m  N
So we can write a  2   2 
 
 21 2 
  2 22  1  m   2 2   1  m
21
    
  2 2  1 2 2  1m   2 2  1.bm

21 21 21
    
a – 2 = bl, where l  m 2 2  1

21
 
a – bl = 2 ...(A)
The d be the gcd of a and b, then d divides a – bl, so from (A) d must divide 2.
i.e., d = 1 or 2.
But a and b are both odd, so gcd can't be even
gcd (a, b) = 1.
97. Answer (3)
2
 n  n

 (i  1) 
 i 1 
 (i  1)2
p  lim 
i 1
n  2n 4
2
 (n  2)(n  1)   ( n  1)( n  2)(2n  3) 
  1   
2 6
 lim    
n  2n 4
 1
n 4    n 3  .... decreasing powers of n
4 1
 lim 
4 8
n  2n
98. Answer (3)
Set x = 1, Z, Z2 and then add the results.
99. Answer (3)
Let (x1, y1, z1) and (x2, y2, z2) be points
x1  x2 x  x2 y1  y 2 z1  z2
 2 and 1 , , I
2 2 2 2
y1  y 2
0 3
2
z1  z2
0 4
2
to be so there are following possibilities
2.2.3 = 12 points whose co-ordinates are all even
1.2.2 = 4 points whose co-ordinates are all odd
1.2.3 = 6 points whose only odd co-ordinate is x
2.2.3 = 12 points whose only odd co-ordinate is y
2.2.2 = 8 points whole only odd co-ordinate is z
2.2.2 = 8 points whole only even co-ordinate is x
.
1.2.2 = 4 points whole only even co-ordinate is y
1.2.3 = 6 points whole only even co-ordinate is z
Total desired number of segments = 12C + 4C2 + 6C2 + 12C + 8C2 + 8C2 + 4C2 + 6C2 = 230
2 2
100. Answer (1)

We have,
(1 – x2)n = C0 – C1x 2 + C2x 4 – C3x 6 + C4x 8–...........+ (–1) nCn x 2n.
Multiply both sides by x and then differentiate w.r.t. x.
Set x = 1 to get the desired result.
101. Answer (3)
We have,
(x 2 – x – 2)5 = –[2 + x (1 – x)]5 expand it and then equate the coefficient of x 5.
102. Answer (2)
According to the question (D – 1)35 = (1 – D)35 D = 1
103. Answer (4)
Let f(x) = 2cx2 + 2bx + a2
f(x1) = 2cx12  2bx1  a 2 = –2a2 + a2, (∵ cx12  bx1  a 2  0 )

f(x1) < 0
f(x2) = 2cx 22  2bx 2  a 2 = 2a2 + a2, (∵ cx 22  bx 2  a 2  0)

f(x2) > 0
Also f(x3) = 0
? x3 lies between x1 and x2
104. Answer (1)

| z | 5
zz  25
and let w  3 zz  4 z
w  75  4 z
| w  75 | 4 | z | 20
Locus of w is a circle.
105. Answer (4)
15 15! 15!
Greatest coefficient in ( x  y  z  t )  4 3 3

(3! ) ( 4! ) 3! ( 4 ! ) 3
106. Answer (2)
We have
 (Ci  C j )2  (C0  C1)2  (C0  C2 )2  .....  (C0  Cn )2  (C1  C2 )2  .....(C1  Cn )2

0i  j n
+......+ (Cn – 1 ± Cn)2
 n(C0 2  C12  C2 2  ......Cn 2 )  2 Ci C j
0 i  j  n
 n  2nCn  22n  2n
Cn .
.
= (n  1) 2n Cn ± 22n
107. Answer (1)
Equate the coefficients of like terms in the expansion.
108. Answer (3)
As, | a || b || c |
 az 2    bz  c 
a z 2    bz  c   b z  c
z2  z  1  0
  5  1     5  1  
 z      z      0 .
  2     2  
5 1
 z 
2
Also a z 2    bz  c   c  b z
z2  z  1  0
  5  1     5  1  
 z      z      0
  2     2  
5 1
 z 
2
 5  1 5  1
 z  , 
 2 2 
109. Answer (2)
Given equation is written as
(x 4 – 3x 2) + (2x – y)i = 4 + (2y – 5)i
So, x 4 – 3x 2 – 4 = 0 (x 2 – 4)(x 2 + 1) = 0
x 2 = 4 x = ±2
and 2x – y = 2y – 5 2x – 3y + 5 = 0 y = 3
110. Answer (1)
We have
n n n
10! 1 2 3
( 2  3  5) 3 6 10
 22 3 3 5 6
n1 ! n2 ! n3 !
111. Answer (2)
1
–Z, –Z2 are roots are x  1
x
a = –1, b = 7
a – b = – 1 – 7 = – 8.
112. Answer (2)
.
1 n 1 n 1 n 1 1
an  nC0  nC1   C2   C3   C4   ..........  nCn 
2 3 4
n n n n nn
1 1 1  1  2 1 1  2  n  1
 1 1 1    1  1    .....  1  1  ......1  
2!  n  3!  n  n n!  n  n  n 
1 1  1 1  2  1  1  2   n 
 an 1  1  1  1    1   1    ....  1  1  ......1  
2!  n  1  3!  n  1  n  1 (n  1)!  n  1  n  1  n  1
Clearly, a n + 1 > an, n t 2

113. Answer (2)
We have, (1 + x + x 2)n = a0 + a1x + a2 x 2 + a 3 x 3 + ...... + a 2n x 2n.
Let us put x = i
n
  
i n = (a0 – a2 + a4 – a6 +.....) + i(a1 – a3 + a5 – a7 + .....)   cos  i sin 
 2 2 
Equate real & imaging parts and then divide.

114. Answer (4)
2 |x|
3| x 12|
 10log10 9
3|x 2 12|  9|x|
|x2 – 12| = |x|

x2 – 12 = ±x
x = ±3, ±4
115. Answer (4)

S = 132 + 233 + 334 + .... + n3n + 1
3S = 133 + 234 + ..... + n3n + 2
–2S = (132 + 133 + 134 + ... upto n terms) – n3n+2
1 9 n n 2 
S    (3  1)  n.3 
2 2 
1
= 2n  3n  2  3n  2  9 
4
n  3 n 2 1
(3  (2n  1)  9)  [3n  2 (2n  1)  9]
28 4
n+3=7
n=4
116. Answer (2)
Set x = y = z = t = 0
117. Answer (1)
.
n(S) = 53 = 125
n(E) = 5C3 3!
60 12
? P (E )  
125 25
118. Answer (1)
 i j  ni n j 
  
 nC

n
C 
   
 nC

n

C j 
0i  j n  i j  0i  j n  i
 i j  n2k
   n C n C   2
 
0i  j n  i j 
119. Answer (1)

Expand the expression.
120. Answer (1)
We have
(1 + x)n = C0 + C1x + C2x 2 + C3x 3 + ....+ C n x n.
x(1 + x)n = C0x + C1x 2 + C2x 3 + C3x 4 + ...... + Cn x n + 1
Differentiating it w.r.t x we get,
(1 + x )n + n(1 + x)n –1x = C0 + 2C1x + 3C2 x 2 + 4C3 x 3 + ......+(n + 1)Cn x n.
Also, (1 + x)n = C0 x n + C1x n–1 + C2 x n–2 + ..... + Cn – 1x + C n.
? (1 + x)2n + n(1 + x)2n–1.x = {C0 + 2C1x + 3C2x 2 + 4C3x3 +....(4 + 1)C4x n} × {C0x n + C1xn–1 + C2xn–2 + ....+ Cn–1x + Cn}.
Equating the coefficient of x n from both sides we get
C0 2  2C12  3C 2 2  ( n  1)C n 2  2nC n  n 2n 1 C n 1
121. Answer (2)
n
Use the result n Cr  n 1Cr 1.
r
122. Answer (1)
x 3  ( x1  x3  x5 )x 2  ( x1x3  x1x5  x5 x3 )x  ( x1x3 x5 )
 x 3  ( x2  x 4  x6 ) x 2  ( x2 x 4  x2 x 6  x 4 x 6 ) x  ( x2 x 4 x 6 )  0
(x – x1)(x – x3)(x – x5) + (x – x2) (x – x4) (x – x6) = 0
f ( x1 ).f ( x2 )  0
f ( x3 ).f ( x4 )  0
f ( x5 ).f ( x6 )  0
? The equation has three real roots and all of them negative.
123. Answer (3)
Let Pr denotes the probability that number greater than 4 appears first time at r th trial. Then P(E) = P2 + P4
+ P6 + P8 + .................f.
r 1
4 1
Pr   
.
6 3
2
2 1  4 4  2 9 2
P (E )   1      .......    
3 3 9 9  9 5 5
 
124. Answer (4)
Total number of arrangements = n!
The number of arrangement in which they are together = 2(n – 1)!
n(E) = n!– 2(n – 1)!
( n  2)
n(S ) 
n
125. Answer (2)
4
2 log3 ( x 1) 
log3 ( x 1)
| x  2|  ( x  2)7
For domain x – 1 > 0 and x–1z1
x>1 and xz2
LHS is positive, therefore, x > 2.
 2 
2 log3 ( x  1)  7
 log3 ( x  1) 
Put log3(x – 1) = t
2t 2 – 7t – 4 = 0
1
t = 4, t 
2
x = 34 + 1, 3–1/2 + 1
1
but x   1 (neglected)
3
126. Answer (2)

n(E) = 4C113C839C5
n(S) = 52C
13
( 4 13C8  39C5 )
P (E ) 
52
C13
127. Answer (3)
Let the 3n positive integers begin with a write them as
a a+3 a+6 a + 3n – 3
a+1 a+4 a+7 a + 3n – 2
a+2 a+5 a+8 a + 3n – 1
The number of ways of choosing 3 integers out of 3n integers = 3nC
3
The number of favourable ways = 3. nC3 + nC1.nC1.nC1
3n 3  3n 2  2n

2
3n 3  3n 2  2n
The desired probability 
n(3n  1)(3n  2)
.
3n 2  3n  2

(3n  1) (3n  2)
128. Answer (2)
The last two digits must be divisible by 4.
n(S) = 9!
n(E) = 2(8)!
2
P (E ) 
9
129. Answer (2)
1 2 3 1
The probability that the question is not solved (P (E )    
2 3 4 4
1 3
P (E )  1  
4 4
130. Answer (4)
n(E1) = The number divisible by 6 = 15
n(E2) = The number divisible by 8 = 11
n(E1 E2) = 3
23
P (E )  .
90
131. Answer (4)
3 3 9
The probability that he did not miss a test =  
4 4 16
7
The probability that he missed atleast one test =
16
132. Answer (3)
N1 = Number of element in set which gives remainder zero when divides to 1020
? n(N1) = 441, n (N2) = 121, n(N3) = 736
n(N1 N2 N3) = n(N1) + n (N2) +n(N3)
– n (N1N2) – n (N1N3) – n (N2N3) + n (N1N2N3)
= 441 + 121 + 736 – 11 – 11 – 21 + 1
= 1256
n(N1N2) = number of divisiors of HCF of N1 and N2
133. Answer (1)
Let f(x) = x(4x2 – x + O2)
Clearly f(x) = 0 has only one real root
? x(4x2 – x + O2) – P = 0 also has only one real root
134. Answer (1)
.
The last digit of the product will be 1, 3, 7 or 9 or if the last digit of the numbers is 1, 3, 7 or 9
4
2 16
required probability =    .
5 625
135. Answer (3)
a1 a a a
 2 2  3. 3  .......  n. n
a2 a3 a4 a1
 1.2.3.........n 
1/ n
n
a1 a a 1
 2 2  ................n n  n  n ! n
a2 a3 an
136. Answer (1)
1 1 1   1 2 100 
3   2  ......  100   6  100  99  ...... 
4 4
 4 4 4 4 
 
S1 S2
  1 100 
 1    100
3 4   1  1 
Now, S1     4
4  1  1/ 4   
 
 
1 2 ......... 100
and S2    
4100 499 4
1 ...........
4S2    100
499
1  1 1 1
3S2  100
  99  98         100
4 4 4 4 
100 1   1  
100
S2   1    
3 9   4  
  1 100   100 1  1 
100
? S  1      6   1   
 4   3 9  4  
  
1 
100
 1
  601    
3  4 

137. Answer (2)
As, leading coefficient is always positive
? f(3) < 0
9a2 + 9a + 9 + 3a – 3 + a2 < 0
5a2 + 6a + 3 < 0
2
 3 6
 5a     0
 5  5
aI
138. Answer (3)
y B (z2)
b
∵ z1  z2   ...(i)
a
.
c
and z1z2  ... (ii) (z1)
a 3 A
2
b2  b a  z1 z2 i  3 o x
Now,  =  z1  z2 
2
z1z2 = z  z  2 = e  ei  3  2 = 3
ac ca 2 1 i 3
z2 = z1e
139. Answer (3) y
c
Here,   0
a2
 
x
b
and       0 [    ] and from graph
a2
we can conclude that E > ~D~ > 0 >D
even place
140. Answer (4)
Even digits = 0, 2, 4, 6, 8
5
Odd digits = 1, 3, 5, 7, 9
Required no. = 4 u 3 u 4 u 4 u 3 = 576

odd place
141. Answer (2)
As product of roots = 72. Hence the divisor 2, –2, 3, –3, all as satisfied confirms to be root.
z5 – 2z4 – 13z3 + 26z2 + 36z – 72 = (z – 2) (z4 – 13z2 + 36)
? Sum of real roots = 2 + k + (–k) = 2
142. Answer (1)
By theorem on real polynomials if f (x) has all coefficients R then for any z f  z   f  z  .
143. Answer (2)
As D, E and J are in HP
     9 3
Hence,  
  

O z 0 and E =
3
3 2
  
10    9    9      0
3 3 3
10O3 – 27O2 + 54O = 0
10O2 – 27O + 54 = 0 (∵ O z 0)
54 27
? O1.O2 = 
10 5
144. Answer (2)
1

2
S =  1  
2
 3 hence for a Q
 3
bQ
.
145. Answer (1)
n 1 n 1
  
k k
w  0, w 0
k 0 k 0
n 1
LHS = 
k 0
z1  w k z2 z
1
k
 w  z2 
2 2
= n z1  0  0  n z2

= n z1  z2
2 2

146. Answer (3)
Let zn + 1 = an + 1 + ibn + 1 = 3 an  bn  i  3 bn  an 
 3  an  ibn   i  an  bn 
∴ zn 1   3  i  zn

zn 1 i
⇒  2e 6 … (i)
zn

z100 z99 z98 z i
∴    ....  2  2e 6
z99 z98 z97 z1
∴
z100
z1
i
 299. e 6    99
 299 i
2  4i
⇒ z1 
299 i
 1 i 
∴ z1   97  98 
z z 
1 1
⇒ a1  99
, b1  
2 298

z2 z3 z4 i
And . .  z 3 .e 2
z1 z2 z3
1 i
⇒ z4  23 iz1  95
 94
z 2
1 1
⇒ a4  95
and b4 
z z98
a4
⇒  22  4
a1
147. Answer (4)
∵ z n  a  i   z  a  i 
So, z n  z  z  0 or 1
If |z| = 0 ⇒ z = 0
.
1
If |z| = 1, then z  a  i    a  i 
n
Z
n 1 a  i
⇒ z 
ai
has (n + 1) roots.
∴ Total number of roots be n + 2.
148. Answer (4)
By A.M., G.M. inequality, we get
3 2 9 2
a2  ,b  ,c 3
4 4
149. Answer (2)
2
Using AM t GM for x 2  ,
x
1 1
x2   1/3
x x   x2  1  1 
3  x x 

2
x2  3
x
 2
 x 2   is minimum at x = 1.
 x
1 1
Also, y  2

x  2x  2 ( x  1)2  1
1
y max   1 also at x = 1
0 1
Hence, the minimum value of f(x) = 3 – 1 = 2.
150. Answer (4)
P(A) is the set of all subsets of A. An element a has four possibilities with respect to A1, A2.
(i) a A1, a A2
(ii) a A1, a A2
(iii) a A1, a A2
(iv) a A1, a A2
If A1 A2 = A, then 'a' has three possibilities.
But A has three elements hence total cases = 3 × 3 × 3 = 27.
151. Answer (3)
|D4 – 1| = |D|4 + 1| = |D4| + | –1|
This is possible only when

arg(D4) = arg(–1) 4arg (D) = S  arg( ) 
4
z 2
arg    , hence the locus of z is straight line.
z3
152. Answer (2)
The sum of co-efficients of all even power of x in (2x2 – 3x + 1)11
1
.
= sum of co-efficients of {(2x2 – 3x + 1)11 + (2x2 + 3x + 1)11}
2
1 11
= [6 ] = 3.610
2
153. Answer (1)
The given functions can be written as
f(x) = |x – 2| + 6 |x|
2  7 x, x0

f ( x )  5 x  2, 0  x  2
7 x  2, x2
The graph of the function is Y y = 7x – 2
y = 2 – 7x y = 5x + 2
(0, 2)
(0, 0) X
Clearly, y is minimum at x = 0. Hence, minimum at one point.

154. Answer (3)
Put 3
2  a  a3  2
1 3 2  3 4  1 a  a2
(1 – a + a2)2 = 1 + a2 + a4 – 2a – 2a3 + 2a2
= 1 + a2 + 2a – 2a – 4 + 2a2 (∵ a3 = 2)
= 3a 2 – 3 = 3(a 2 – 1)
(1 – a + a2)3 = (1 – a + a2)2 (1 – a + a2) = 9(a – 1)
1  a  a 2  3 9(a  1)
1 3 2  3 4  3 9 3 3 2  1
1 32 34 3 3
3    2 1  B  A
9 9 9
155. Answer (2)
Let 2252 have m digits when it is expanded and written down and 5252 have n digits when it is expanded and written
down then 10m–1 < 2252 < 10m and 10n–1 < 5252 < 10n
10 m + n – 2 < 10252 < 10m + n
m + n – 2 < 252 < m + n
m + n – 1 = 252 m + n = 253
156. Answer (1)
In this type of problems we must look for periodicity when it at all, the sequence starts repeating itself.
an  2  2an 1  an
.
2an 1  an  2  an ...(i)
Changing n o n + 2
2an 3  an  4  an  2 ..(ii)
Adding (i) and (ii),
2 (an 1  an 3 )  an  4  2an  2  an
2an+2 = an + 4 + 2an + 2 + a n
a n + 4 = – an ...(iii)
Changing n o n + 4
a n + 8 = –a n + 4 ...(iv)
Equation (iv) – (iii),
an + 8 = an
? a n = an + 8 = an + 16 = a n + 24 = ....................
a 337 = a 8 × 42 + 1 = a1 = 13
Similarly, a 338 = a 2 = 25
157. Answer (1)
(Once you see an expression involving many 6cs, there is no need to panic. You just have to find how many
terms are being summed up by that 6 notation.)
 
0i j k n
1, has n + 1C3 terms and all of them are equal to 1.
?  
0i j k n
1  (1).n 1C3  n 1
C3
158. Answer (2)
an = n2 – 2n + 2 = (n – 1)2 + 1
an + 1 = n2 + 1
an an + 1 = (n2 – 2n + 2) (n2 + 1)
= (n2 – n + 1)2 + 1 = (n2 – n + 2 – 1)2 + 1
= an 2 n  2 .
? a40 a41 = a1562
Similarly a36 a37 = a1262, a24 a25 = a554 and a52 a53 = a2654.
159. Answer (1)
Here x – [x] = {x}, where { } represents fractional function
The minimum value of | x  1|  | x  10 | is 9, and in this condition 1  x  10 .
But the minimum value of {x} is zero, and in this condition x is an integer.
Hence the common values of x = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
Total 10 solutions exist.
160. Answer (1)
Each element has 5 choices as it may be in any one of A1, A2, A3, A4 or may not be in any one.
.
? The required number of ways = 57.
161. Answer (2)
Let the number of rows in triangle be k
? 1 + 2 + 3 + ....+ k = n
k (k  1)
n ...(1)
2
k (k  1)
Also,  49  (k  3)2
2
 k 2  k  98  2k 2  12k  18
k2 + 11k – 80 = 0
k2 + 16k – 5k – 80 = 0
k=5
k (k  1)
? The number of balls n   15
2
162. Answer (3)
(1  x )n  C0  C1x  C2 x 2  .....  Cn x n
(1  x )n 1  1 C x2 C x n 1
 C0 x  1  .....  n
n 1 2 n 1
(1  x )n  2 x 1
 
(n  1)(n  2) n  1 (n  1)(n  2)
C0 x 2 C7 x 3 C4 x n  2
   ..... 
2.1 2.3 (n  1)(n  2)
Put x = 2, we get
3n  2  1 2

(n  1)(n  2) n  1
C0 .22 C1  23 Cn  2n  2
   ..... 
1 2 23 (n  1) (n  2)
22  C0 23  C1 2n  2  Cn 1 2 3n  2
  .....    
2 6 (n  1)(n  2) (n  1)( n  2) n  1 ( n  1)( n  1)
3n  2
? Sn 
2(n  1)(n  2)
S7 39 278 7
?   
S6 2  8  9 38 3
163. Answer (1)
3r.nCr = co-efficient of xr in (1 + 3x)n
3r – 1. n–1
Cr – 1 = co-efficient of xr – 1 in (1 + 3x)n – 1 and so on.
? The given expression is the coefficient of xr in nC0(1 + 3x)n – nC1.(2x).(1 + 3x)n – 1 + nC2(2x)2 (1 + 3x)n – 2 ...
= Co-efficient of xr in (1 + 3x – 2x)n
.
= nCr
164. Answer (4)
Let x 1 d x 2 d x 3 d x 4 d x 5
As x 5 < x 1 + x 2 + x3 + x 4 + x5 d 5x 5
We have,
x 5 < x 1x 2x 3x 4x 5 d 5x 5
1 < x1 x2 x3 x4 d 5
A possible value of (x1, x2, x3, x4) is (1, 1, 1, 5,) ? max {x 5} = 5.
165. Answer (2)
Y
y = log|x|
(0, 2)
(2, 0)
(–2, 0) (1, 0) X
(–1, 0)
y = 2 – |x|
Clearly x is an integer.
[x] = x
Hence the equation becomes.
log |x| = 2 – |x|
Clearly the solution exist in the interval (1, 2) and (–2, –1). But no integer lies in these intervals. Hence number
of solution = 0.
166. Answer (1)
log ak 1
logak  ak 1  1   logak ak21  2 logak ak 1  2
 4  log ak
 log a2 log a3 log a1 

Now the given expression t 2   ....  
 log a1 log a 2 log a16 
t 216 = 32
a 1
Equality holds if and only if a1  a2  
b 2
167. Answer (3)
R
The points in the complex plane P(–3) and Q(3) both lie on
the circle | z  3i |  3 2.
O
For we have |3 – 3i| = 3|1 – i| = 3 2 and | 3  3i |  3 2.
Thus P and Q are points on the circle, also PQ = 6, as Q
P
OP 2  OQ 2  (3 2 )2  (3 2 )2  18  18  36  PQ 2

POQ 
2
1 
.
PRQ  POQ 
2 4
z3 
? arg  .
z3 4
168. Answer (4)
| zi |  | zi | and zi zi  1
Modulus of each complex number being unity. We have,
z1z2 z3 z1z2 z3 z1z2 z3

| z1z2  z2 z3  z3 z4 |   
z3 z1 z2
1 1 1
 | z1z2 z3 |  
z1 z2 z3
z1z1 z2 z2 z3 z3
 | z1 | | z2 | | z3 |  
z1 z2 z3
 | z1 | | z2 | | z3 | | z1  z2  z3 |
 (1) (1) (1) | z1  z2  z3 | = |z1 + z2 + z3|

Hence the largest number O such that
|z1z2 + z2z3 + z3z1| tO |z1 + z2 + z3| is O = 1.
(Recall a t b is true when either a is greater than b or a is equal to b).
169. Answer (1)
D bisects the arc BC
ODC = D
Then z3 = z4 eiD, z2 = z4e–iD
? z2z3 = z42
170. Answer (3)
1 a  ib a b
  i 2
a  ib a 2  b 2 a 2  b 2 a  b2
For the above to be integer the possible choice of (a, b) are (0, 1), (1, 0), (0, –1), (–1, 0).
171. Answer (2)
The expression is |z| + |z – 1| + |z – i| + |z – (3 + 4i )|
= |z| + |z – (3 + 4i)| + |z – 1| + |z – i |
? The least distance = 5  2

172. Answer (2)
The expression
= |z – i | + |z – (3 + 4i )| – |z | – |z – i|
= |z – i | – |z – 1| + |z – (3 + 4i )| – |z|
The greatest value = 1 2 5
173. Answer (4)
Using the operation modulo n + 10, we have
.
n + 10 { 0 mod (n + 10) n { –10 (mod (n + 10))
n3 { (–10)3 (mod (n + 10))
n3 + 100 { –900 (mod (n + 10))
For n + 10 to divide n3 + 100, n + 10 should divide –900. The largest n such that n + 10 divides –900 and
consequently n3 + 100 is 890.
174. Answer (1)
Whenever you see the system is incomplete, i.e. the number of unknowns exceed the number of equations it
should suggest you to look for the possibility of an inequality turning into an equality. As positive numbers are
involved, the stage is all set for an application of AM-GM theorem.
ab  ac  ad  bc  bd  cd  (ab)(ac )(ad)(bc )(bd)(cd)1/ 6
6
ab + ac + ad + bc + bd + cd t 6. abcd
The equation abcd = 27 + ab + ac + ad + bc + bd + cd, can now be written as
abcd  27  6 abcd
( abcd )2  6 abcd  27  0
( abcd  9)( abcd  3)  0
abcd  9  0
abcd  9 ....(A)
a  b  c  d  (abcd )1/ 4  12  (abcd )1/ 4

But
4 4
3 t (abcd) 9 t (abcd)
1/4 1/2
or abcd  9 ....(B)
From (A) and (B);
abcd  9
Equalilty holding only when a = b = c = d = 3.
(3, 3, 3, 3) is only the solution.
175. Answer (2)
Distinct n digit numbers which can be formed using the digit 2, 5 and 7 are 3n
? 3n  900 3n–2  100 n – 2  5 n  7
176. Answer (3)

We have,
n
 1
2  1    3  n  1
 n 
177. Answer (1)
n n
  n Ck k Cr  nC11C0  1C1  nC2 2 C0  2C1  2C2   .......  nCn n C0  nC1  ......  nCn 
r 0 k 1
r k
.
= nC12 + nC22 2 + nC 2 2 3 +....+ nC2 2n = (1 + 2)n – 1 = 3n – 1.
178. Answer (4)
a, b, c be side of a triangle a is smallest
2b = a + c
2b = 20 + c
c must be even number
Also, 20 + b > c
20  c
20   c c < 60 also c ! 20
2
for c = 20, a = b = 20, a, b, c are in A. P. but these are not distinct.
? Number of even integer in (20, 60) = 19
179. Answer (4)
Either all three are divisible by 4 or only two are divisible by 4 or one is divisible by 4 or all three are even of
only two are even then the product is divisible by 4
? n(E) = 6C3 + 6C219C1 + 6C119C2 + 12C
3 + 12C 13C
2 1
n(S) = 25C
3
963
P (E ) 
1150
180. Answer (2)
Sum to be even number of f(1), f(2),........, f(12) should be assigned odd number.
? Total number of such functions = 12C0 30 312 + 12C2 32 310 + ... + 12C12 30 312 = 312. 211 = 3. 611
181. Answer (2)

Number to be divisible by 4
3!
Case-I 1 1 2 2!
= 3
3!
Case-II 2 1 2 2!
= 3
3!
Case-III 1 3 2 2!
= 6
3! 3
Case-IV 2 2!
= 15
182. Answer (1)
Since order of selection in each subject is important hence
18!
Number of selection =
6!6!6!
183. Answer (2)
2n  1
tn 
1  22  .....  n 2
2
6(2n  1)
=
n(n  1) (2n  1)
.
6
=
n(n  1)
1 1 
= 6  
 n n  1
1 1
t1  6   
1 2 
 1 1
t2  6   
2 3

 1 1 
t100  6   
 100 101 
 1 
S100  6  1  
 101 
600
=
101
184. Answer (3)
n2 + 3n + 2 = (n + 1) (n + 2)
n can be 3m, 3m + 1, 3m + 2
If n = 3m
n2 + 3n + 2 = (3m + 1) (3m + 2) not divisible by 3
In other case it is divisible by 6
Number of required numbers = 1343
185. Answer (4)
C D
If consider a presentation like A 4 5 , then we have possible selections are
B 5 4
4 0 3 1 2 2 1 3 0 4
, , , ,
0 4 1 3 2 2 3 1 4 0
The number of ways is
(4C4)2 × (5C0)2 + (4C3)2 × (5C1)2 + (4C2)2 × (5C2)2 + (4C1)2 × (5C3)2 + (4C0)2 × (5C4)2
= 1 + 202 + 602 + 402 + 52 = 5626
5626
So, required probability = 18
.
C8
186. Answer (4)
f(x) = (x2 – 4) ([x] – x) = –(x –[x])(x 2 – 4)
? f(x ) > 0 x 2 – 4 < 0
|x | < 2
187. Answer (3)
.
Here, S = (27)log3 7  (49)log7 11  ( 11)log11 25
= 73 + 112 + 5 = 469
So, sum of digits of 469 = 4 + 6 + 9 = 19.
188. Answer (2)
Clearly the institute should be opened at town X.
189. Answer (1)
log(a2 + b2) = log 2 + log a + log b
a2 + b2 = 2ab a = b
190. Answer (2)
x
  · y logz x  · z logx y   P
log y z
(say)
log P = (log y – log z) log x + (log z – log x) log y + (log x – log y) log z = 0
P=1
191. Answer (4)
 1 1  1 1  1 2
A2     
0 1 0 1 0 1
1 3  1 5
A3    and A5   
 0 1  0 1
 2 3  2 3
    
7 7 7 7   1 0
BB   
T
 
 3 2   3 2   0 1
   
 7 7   7 7 
(BBTA)5 = A5
192. Answer (4)

AB = A
ABA = A2
AB = A2
A = A2
Similarly B = B2
(A + B)2 = A2 + AB + BA + B2 = 2(A + B)
(A + B)3 = (A + B)2 (A + B) = 22(A + B)
(A + B)4 = 23 (A + B) .....
Now,
 1 1 
= ( A  B ) 1    .....   2( A  B )
 2 4 
193. Answer (1)
Differentiate the determinant w.r.t. x and put x = 0.
194. Answer (2)
1 1 1 1 1 11
P (H )  .  .1  . 
3 2 3 3 3 18
1 1 1 2 7
.
P (T )  .  . 
3 2 3 3 18
1 H
2
1
2
A T
1
3 1 H
1
3 B 0
1 T
3 1 H
3
C
2 T
3
1 2
.
C  3 3 4
P   
T  7 7
18
1 1
.
 A 3 2 3
P   
H  11 11
18
195. Answer (2)
P(no one among A1, A2,... An dies within a year) = (1 – m)n
P(atleast one among A1, A2,... An dies within the year = 1 – (1 – m)n
1
P(A dies within a year and is first to die) = [1  (1  m )n ]
n
196. Answer (2)
1 i
P (E i )   P (E i ) 
i 1 (i  1)
1
Probability that no event occurs (P (E ))  P (E1 )  P (E 2 )....P (E n ) 
n 1
n
P (E ) 
n 1
197. Answer (3)
Pr = odd number come r times
2n 1
 1
P2i 1  2n 1C2i 1 
2
n
1
 P2i 1  2
i 0
198. Answer (1)
The probability that atleast 4 will arrive safely
= the probability that all 5 are safe + the probability that exactly 4 are safe
5 4
 9   9  1
    5C4     0.92
 10   10  10
199. Answer (4)
P(A) = 0.3, P(B) = 0.4, P(A BC) = 0.5
P(A) = 0.7, P(BC ) = 0.6
P(A BC ) = 0.7 + 0.6 – 0.5 = 0.8
.
 BC  P (B C  A  B C ) P (B C ) 3
P   
 A  BC  C
P( A  B ) C
P( A  B ) 4
 
 B   BC  1
P    1  P     0.25
 A  BC   A  BC  4
 
200. Answer (1)
Ac = –A AAc = –A2 = I AAc = I
Considering determinant, |AAc| = |I|
|A|2 = 1
|A| = 1, –1
Let n be the order of A.
| Ac| = | –A | = (–1)n | A |
| A| {1 – (–1)n } = 0 and | A | z 0
1 – (–1)n = 0n is even.
201. Answer (1)
AT = A and BT = B
(ABA)T = ATBTAT = ABA
202. Answer (2)
B = – A–1BA
Multiplying both sides by A,
AB = – AA–1BA
AB = – IBA
AB = –BA
AB + BA = 0
(A + B)2 = A2 + B2 + AB + BA = A2 + B2
203. Answer (3)

Order of A = 3 × 3, order of AT = 3 × 3
Order of B = 3 × 2, order of BT = 2 × 3
Order of C = 3 × 1, order of CT = 1 × 3
Out of these four only three are defined.
204. Answer (3)
Clearly, (1), (2) and (4) are correct.
205. Answer (3)
 x 3 2
A   1 y 4  , xyz = 60 and 8x + 4y + 3z = 20
2 2 z 
 
|A| = 68
(adj A)A = A(adjA) = |A|I
206. Answer (4)
For non-trivial solutions
sin   cos    1
cos   sin   0
.
   1  cos 
sin   cos   (sin   cos ) 1 0  (sin   cos ) 1
cos   sin     0  cos   sin   sin   0
  1  cos  2  1  1  cos 

cos   0    (2n  1) , n I and O R
2
207. Answer (3)
A2 + A + 2I = 0 can be written –(A2 + A) = 2I
 1 
 A ( A  I )  I.
 2 
1
Thus A is invertible and inverse of A is  ( A  I ).
2
208. Answer (2)
2 cos 2  sin 2  2 sin 

2
  sin 2 2 sin  2 cos 
sin   cos  0
= 2cos2T[2cos2T] + sin2T [2cosTsinT] + 2sinT [2sinTcos2T + sin3T]

= 4cos4T + sin22T + 4sin2T z 0
209. Answer (2)
1   3 
|A – OI |= 0 det.    0  (1   )(2   )  6  0 O – 3O – 4 = 0
2
 2 2  
210. Answer (1)
2
| adj (adj A ) |  | A |( n 1) = (14)4
211. Answer (2)
A2r – 1 = –(A2r–1)T
(A2r – 1)2r – 1 = –[(A2r – 1)2r – 1]T
(A2r – 1)2r – 1 skew-symmetric
(2r – 1)(A2r – 1)2r – 1 is skew-symmetric
B is a skew-symmetric.
212. Answer (1)
Use the definition of orthogonal matrix.
AAT = I for orthogonal matrix.
213. Answer (3)
Expand along any row /column and the result is straight.
214. Answer (1)
LetEJDG = x, JDEG = y and D EJG = z, then the determinant reduces to
1 x x 2  2
1 y y 2  2
1 z z 2  2
which can be written as a sum of two determinants, one of which vanishes. The surviving one can then be
.
evaluated with ease.
215. Answer (1)
Apply first R2 o R2 – R1 and R3 o R3 – R1 to create two zeros in the first column and then expand along
first column.
216. Answer (1)
1 x x 1 x 1 1
x 1 x  1 1 x 1  x3  1  0
x x 1 1 1 1 x
? x = –Z, –Z2
1
x 2009  1
2009
x
217. Answer (4)
∵ (A + B)T = A – B
|A + B| = |A – B|
∵ |C| = |(A + B)–1. (A – B)| = 1 = |CT|
Now, |CT. A. C| = |CT|. |A|. |C| = |A|
218. Answer (4)
1 1 1
P  E1   , P  E2   , P  E3  
2 4 4
1
     
P  E   P  E1  E2  E3   P E1  E2C  E3  P E1C  E2  E3  P E1  E2  E3C 
4
7
 E  P  E  E1  32 7
P    
 E1  P  E1 1 16
2
7
32 7
P(candidate exactly qualifies in two sections/E)  
1 8
4
5
 E  P  E  E2  32 5
P    
 E1  P  E2  1 8
4
1
 E1C  P E1C  E
P 
 32 
1 
 E  P E  1 8
4
219. Answer (2)
3
The probability that he will speak the truth (P (T )) 
5
2
P (T ) 
5
1 3

P (6)  P (T ) 6 5 3
P (E )   
P (6)  P (T )  P ( 6 )  P (T ) 1  3  5  2 13
.
6 5 6 5
220. Answer (3)
For non-trivial solutions,
a3 (a  1)3 ( a  2) 3
a (a  1) ( a  2)  0
1 1 1
a3 (a  1) 2  a 2  a(a  1) (a  2) 2  (a  1) 2  (a  1)(a  2)
 a 1 1 0
1 0 0
(a + 2)2 + (a + 1)2 + (a + 1)(a + 2) – (a + 1)2 – a 2 – (a + 1)a = 0

4a + 4 – 2(a + 1) = 0 a = –1
221. Answer (1)
(A 2 + B 2) (A – B) = A 3 – A2B + B 2A – B 3 = 0
As A z B, we have (A2 + B 2) non invertible and thus det (A 2 + B 2) = 0


Algebra: Section A: Straight Objective Type

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Algebra: Section A: Straight Objective Type

Uploaded by

Copyright:

Available Formats

Algebra UNIT 1

Section A : Straight Objective Type (Only one correct answer)

Thus, R(x) = ax + b = (2100 – 1)x + (2 – 2100)

12. Answer (4)

From (A) and (B)

= 41 × 271 × 100001....00001 × 1000 + 111

13. Answer (1)

? b n = 2n–1b1 = 2n–1(a2 – a1) = 2n(a1 – a0)

16. Answer (4)

We have, (1 + x + x2)n = a0 + a1x + a2x2 + ... + a2nx2n

for 0 < m < 1

 a  a1  a2  ...  a2n   a  a  ...  a 1/2

? a0  a1  ...  a2n  (2n  1)  3n

17. Answer (4)

( x 2  dy 2 )(u 2  dv 2 )  ( x  y d )( x  y d )(u  v d )(u  v d )

 {( x  y d )(u  v d )}{( x  y d )(u  v d )}

 (ux  vx d  yu d  vyd )( xu  xv d  yu d  vyd )

 {(ux  yvd )  (vx  yu ) d }{( xu  yvd )  (vx  yu ) d }

 (ux  yvd )2  (vx  uy )2 d

18. Answer (2)

25. Answer (4)

So m  2a1 7 b1 13 c1 and n  2a2 7 b2 13 c2

(ii) f(2) = 1, in this case f(1) can take 1 value  1 map.

34. Answer (3)

35. Answer (2)

41. Answer (2)

42. Answer (1)

47. Answer (2)

= 4a2D2 – 6a2D2 …[from (i)]

f(E) = 4a2E2 + 3bE + 3c

49. Answer (3)

(|z|2 – 1) (1 – |D|2) > 0

56. Answer (1)

f(n) = Vn+1 – V1 = (n + 1)2 · nC

64. Answer (1)

 7995    7995    7995    7995    7995 

Let Sm  m [2a  (m  1)d ], Sn  n [2a  (n  1)d ]

If 2a = d, then in this case the rate can be m2 and n2.

69. Answer (3)

71. Answer (1)

So the sum of its digits = 9 × 48 + 7 + 5 = 432 + 12 = 444.

log3 | z1| log 1 2

Equation of the circle is |z – 1| = 2

 P  (0, 3) and Q  (0, 3)

Therefore, graph of y = ax2 – b|x| – c can be drawn as figure-2 y

Obviously number of solution of the equation

z lies on the circle having centre (0, 4) and radius 3

Obviously, |z1 | = |z2 | = 7

76. Answer (1)

(9 – x)4 (x + 5)3 < 27.44.33

78. Answer (2)

79. Answer (1)

84. Answer (2)

= 2nCk + 3. 2nCk – 1 + 3. 2nCk – 2 + 2nC

85. Answer (3)

The number of ways to select 1st station = 10

95. Answer (4)

  2 2  1 2 2  1m   2 2  1.bm

a – 2 = bl, where l  m 2 2  1

100. Answer (1)

f(x1) = 2cx12  2bx1  a 2 = –2a2 + a2, (∵ cx12  bx1  a 2  0 )

f(x2) = 2cx 22  2bx 2  a 2 = 2a2 + a2, (∵ cx 22  bx 2  a 2  0)

104. Answer (1)

(ii) f(2) = 1, in this case f(1) can take 1 value 1 map.

P  (0, 3) and Q  (0, 3)

Clearly, a n + 1 > an, n t 2

3|x 2 12|  9|x|

|x2 – 12| = |x|

–2S = (132 + 133 + 134 + ... upto n terms) – n3n+2

10 m + n – 2 < 10252 < 10m + n

m + n – 2 < 252 < m + n

( abcd  9)( abcd  3)  0

(a + 2)2 + (a + 1)2 + (a + 1)(a + 2) – (a + 1)2 – a 2 – (a + 1)a = 0