SM 21 22 XI P1 Mathematics Unit-1 Section-A

Algebra UNIT 1
Section A : Straight Objective Type

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

x  2  2100  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|  |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
Aakash Educational Services Limited - Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Ph.011-47623456
2 Algebra Solutions of Success Magnet (Part-I)
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  t  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 (4)
Rewrite f(x ) as
e 2 x 1 e  e 2 x 1 e 2x
f (x)   
1  e 2 x 1 e  e  e 2 x 1 e  e 2x
e 2x
ex ex
 
e e 2x e1 x  e x

ex ex
e1 x
f (1  x ) 
e x  e1 x
ex e1 x
So, f ( x )  f (1  x )  1 x  1
e  e x e x  e1 x
 1   2   2008 
Now, f   f   .....  f  
 2009   2009   2009 
  1   2008    2   2007    1004   1005 

 f  f   f   f   .......  f   f 
  2009   2009    2009   2009    2009   2009 
= 1 + 1 + 1 + .... to 1004 times = 1004
5. Answer (2)
We employ the method of differece to telescope the sum
k 2 k 2 k 2 1 k 1
tk     
k!  (k  1)!  (k  2)! k! {1  k  1  (k  1)(k  2)} k ! (k  2)2 (k  2)k ! (k  2)!
( k  2)  1 1 1
  
( k  2) ! (k  1)! (k  2)!
Solutions of Success Magnet (Part-I) Algebra 3
t1  1  1
2! 3 !
t2  1  1
3! 4!
........................................
t 2006  1  1
2007 ! 2008 !
1 1
Adding we have sum =
2 2008 !
6. Answer (1)
Let E  1  1  1
xy  z  1 yz  x  1 zx  y  1
xy + z – 1 = x y + 1 – x – y = (x – 1) (y – 1)
So, E   ( x  1)(1 y  1)
x  y z3

( x  1)( y  1)(z – 1)
1 1
 
xyz  xy  x  1 5  ( xy  yz  zx )
xy  yz  zx  1 [( x  y  z )2  ( x 2  y 2  z 2 )]
2
 1 [ 2 2  3]  1
2 2
 E 1  2
5 1 9
2
7. 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.
8. 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
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.
9. 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 nC  n  1
+ ...... + = 1 + 3 + 5 + ...... + n = 
 2 
1 1 , where n is positive odd natural number.
10. Answer (4)

 + = 1  = 3
(2  )(  2) = 2 + 2 +  (2 +)
= 2 + 2 – 
=( + )2 – 3
=1–9
= –8
11. 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
12. 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 + 2293 – 2293} {(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)
13. 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.
14. Answer (4)
111
1  111
.... .....
1000  111
...(A)
123 times 120 1's
Now, 11111 = 41 × 271

We note that,
111
1  11111 100001
..... ......  111
00001

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
15. Answer (4)

The result follows from the fact an + bn is divisible by a + b for n odd and an – bn is divisible by a – b for all
n.
16. 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  i  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 is 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?
17. 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.
18. Answer (3)

In such problems we use factor theorem in an innovative way. Set up the polynomial.
g(x) = (x + 1)p(x) –1, then from the hypothesis
g(0) = g(1) = g(2) = ................. = g(11) = 0
But g(x) is a polynomial of degree 12, so because 0, 1, 2, ..... 11 are its zeroes, we must have by factor theorem
g(x) = a(x)(x – 1)(x – 2)......(x + 1), where a in a constant to be determined. ...(i)
Also, g(x) = (x + 1)P(x) – 1  g(–1) = –1 and from (i)
g(–1) = a(–1)(–2)(–3)...(–12) = –1
 a(12!) = –1
1
 a
12!
1
Thus, (x + 1)P(x) – 1 =  x  ( x  1)( x  2)...( x  11)
12!
Setting x = 12 in the above relation.
1
(12 + 1)P(12) –1 = (12)(11) (10).......1 = –1
12!
 13P(12) = 0  P(12) = 0
19. Answer (4)
Each draw should be from 1 to 9, this can be done in 98 ways but it is possible that only 1 to 8 numbers are only
drawn in 88 ways.
 The number of ways, this can be done is 98 – 88.
20. Answer (2)
Given  are the roots of x3 + 2x2 + 3x + 3 = 0 then we have to form the equation whose roots are
  
, ,
 1  1  1
 x
Let, y  , express x in terms of y
 1 x 1
y
 x
y 1
So that the equation is
3 2
 y   y   y 
   2   3   3  0
 1 y   1 y   1 y 
 y3 – 5y2 + 6y – 3 = 0 ...(i)
  
Let,  ,  ,  
 1  1  1
Thus , ,  are the roots of (i)
  = 5,  = 6,  =  = 3
Now use the identity
a3 + b3 + c3 – 3abc = (a + b + c) (a2 + b2 + c2 – ab – bc – ca)
= (a + b + c){(a + b + c)2 – 3(ab + bc + ca)}
Thus
3 + 3 + 3 = ( +  + ) {( +  + )2 – 3( +  + } + 3
= (5) [(5)2 – 3(6)] +3(3)
= 5[25 – 18] + 9
= 35 + 9 = 44
21. 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  2 can be recast as
an + 1 – an = 2an – 2an–1 = 2(an – an–1)
Let bn = an+1 – an, n  1
thus bn = 2bn – 1, n  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
22. Answer (1)

f(x) = 2x2 – 2(2a + 1)x + a(a – 1)
Applying the condition a
 
2f(a) < 0, D  0
 a  (–, –3)  (0, ) <a<
23. 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
 a0  a1  a2  ...  a2 n   a  a  ...  a 1/2

   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
24. Answer (1)

Let us calculate the number of numbers whose last digit is x, where x = 1, 2, 3, 4 or 5.
Since each digit can appear atmost once, the ten's place can be filled in 4 ways, hundred's place can be filled in
3 ways and thousand's place can be filled in 2 ways.
Thus the number of numbers whose last digit is x = 4 × 3 × 2 = 4!
So, the digits in the unit place of all the 120 numbers add upto 4!(1 + 2 + 3 + 4 + 5) = 24 × 15 = 360. Similarly the
number at ten's place add upto 360 and so on. Hence the sum of all number is
 10 4  1 
360(1  10  10 2  10 3 )  360     40(10 4  1)
 9 
 
= 4 × 105 – 40
= 399960
25. 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  yg ) d }
 (ux  yvd )2  (vx  uy )2 d

26. 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.
27. Answer (3)
We are going to introduce you to a powerful technique of counting i.e., recursion.
Let us denote by un the number of n-digit string made up of 0, 1 or 2 and satisfying the condition of the problem.
u2, the number of 2-digit string, can be obtained by direct calculation, u2 = 8, viz., 00, 01, 02, 10, 11, 12, 22, 20.
Let x = x1, x2,.........x n be a sequence belonging to un. We can have two mutually exclusive cases.
(i) If x starts with 2, i.e., x1 = 2, then each of x2, x3.......xn can be 0 or 2. So there are 2n–1 such sequences. (Recall
that 1 cannot appear to the right of 2).
(ii) If x starts with 0 or 1, i.e., x1 = 0 or 1, then x2, x3.....xn is a sequence of (n – 1) digits satisfying the condition
of the problem. So there are 2un–1 such sequences.
Thus, un = 2n–1 + 2un–1, n  2
Also, u2 = 8
u3 = 22 + 2u2 = 4 + 2 × 8 = 20
u4 = 23 + 2u3 = 8 + 2 × 20 = 48
u5 = 24 + 2u4 = 16 + 2 × 48 = 112
u6 = 25 + 2u5 = 32 + 2 × 112 = 256.
27a. Answer (5) [JEE (Advanced)-2015]

n  6· 5
m  5C4  6P2  4!  5!
m
5
n
28. Answer (1) 2 2

   
Observe that 1 lies between  a  b  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
2 2
(a  b ) a  2 ab  b (a  b )
  
8a 2 8b
2
(a  b ) (a  b ) 2
  a  b  ab 
8a 2 8b
(a  b ) 2 (a  b ) 2
 D
8a 8b
29. Answer (3)
5!
Number of ways of arrangement in which all P's together =
3!
6!
Number of ways of arrangement in which all Q's together =
4!
Number of ways of arrangement in which with P & Q together = 3!
5! 6!
 – 3!
11
Required probability = 3! 4! 
8! 70
4!3!
30. Answer (2)
 2n   2n   2n   2n  2n n
We have,          ....     (1  1)  4
0 0  1  2n 
10 
for n = 5 we have    252  3 5
5
m=4
31. 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.
32. Answer (1)
Let 2 x = u and 3x = v. The equation becomes
1 + u 2 + v 2 – u – v – uv = 0
 2 + 2u 2 + 2v 2 – 2u – 2v – 2uv = 0
 (1 – u)2 + (u – v)2 + (v – 1)2 = 0
The above holds when v = u = 1
 1 = 2x = 3 x
 x = 0 is the only solution.
33. 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
34. Answer (2)
n n
1 2n !
Let Sn    1  (n  k )!(n  k )!
(n  k )! (n  k )! 2n !
k 0 k 0
n
 2n 
 1   n  k 
2n !
k 0
n
 2n 
 1   k 
2n !
k 0
 n  2n   2n 
 1 . 1      

2n ! 2   k   n 
k 0 
  2n 
 1 . 1 2 2n   
2n ! 2   n 
2n 1
2  1 2 , (After simplification)
2n ! 2(n ! )
199
 S100  2  1
200 ! 2(100 ! )2
35. 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.
36. Answer (1)

1 1 1
N  (a  a 2  1) n  (a  a 2  1) n  b  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.
37. 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
38. 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
39. Answer (3)
Distance travelled in the first day = 1.2n
Distance travelled in the second day = 2.2n–1
Distance travelled in the third day = 3.2n–2
Distance travelled in the fourth day = 4.2n–3

....................................................................................................................
....................................................................................................................
Distance travelled in the nth day = n.21
Total distance covered is
S = 1.2n + 2. 2n – 1 + 3.2n – 2 + 4.2n – 3 + ...... + n.21
S n 1 n 2
= 2  2.2  3.2n 3 + ...... + n
2
On substraction,
S
 2n  2n 1  2n 2  2n 3 +............... n terms – n
2
  1 n 
2n  1      n
S  2 
  
2 1
1
2
S
 2n 1  2  n
2
S  2n  2  4  2n
According to condition,
(n  1) n 1
2n  2  4  2n  (2  n  2)
4
n 1
 2n 7
4
40. Answer (2)
We are going to make use of pigeon-hole principle we will show that at least one factor in this product is even that
is the idea of the numbers 1, 2, 3, …169, exactly 85 are odd. Again as ais consists of the numbers from 1 to 169,
(for ais are the permutations of the numbers 1, 2, …121), we have among ais also 85 odd numbers.
Thus both the sets {1, 2, …169} and {a1, a2, …a169} have together 170 odd numbers.
These 170 odd numbers are to go into 169 (pigeon holes) factors (a1 – 1), (a2 – 2), … (a169 – 169). Hence,
by pigeon-hole principle, some factor say (am – m) contains both odd numbers i.e., am and m both are odd.
Consequently (am – m) is even and so is the entire product.
41. Answer (2)

n n
n n
As we know that     n  !    for n > 6
2 3
Putting n = 600
(300)600 > (600)! > (200)600

>>
42. Answer (1)

Area of printed matter
= (x – 2)(y – 2)
= k (given) …(i)
Our aim is to minimize A = xy 
Let x – 2 = x, y – 2 = y  xy = k
 A = xy = (x + 2)(y  + 2)  
x
= xy + 2 y  + 2x + 4
= (k + 4) + 2(y + x) …(ii) 
From A.M. - G.M. theorem y
y    x 
  x y   y   xk  2 k and equality is attained at y = x
2
x y 
  etc.
 
From (ii),
Amin  k  4  4 k
 k  4 k   4  ( k  2  )2
For our case k = 216,  = 3,  = 2
 Amin  ( 216  2 6 )2  (6 6  2 6 )2  (8 6 )2 = 64 × 6 = 384 sq. cm.
43. 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).
44. Answer (1)

Number of passwords that don’t use the digit ‘3’ = 43 × 112 …(A)
(Because each of the places of digits can be filled in 4 ways, but each letter can be filled in 11 ways).
Number of passwords that don’t use the letter A = 53 × 102 …(B)
(For each of the places of digit can be filled in 5 ways, but each letter can be filled in 10 ways only).
in (A) and (B) we have double counting of the those passwords that use neither 3 nor A.
Number of such passwords = 43 × 102.
 Number of those passwords that don’t have both A and 3 in them
= 43 × 112 + 53 × 102 – 43 × 102
= 43 × 21 + 53 × 102
= 1344 + 12500 = 13844.
45. 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) (x)
 From (i)
x(x – 1) (x – 3) (x – 1) = (x – 3) x(x – 2) (x)
 (x – 1) (x – 1) = (x – 2) (x)
 (x – 1) divides (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) = x (x – 1) (x – 2)
g(3) = 6 = 6   = 1
 g(25) = 252423 = 13800
46. 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.
47. Answer (2)
m3 + n3 + 3mn – 1 = 0
 m3 + n3 + (–1)3 – 3(m)(n)(–1) = 0
1 
 (m  n  1)  {(m  n )2  (m  1)2  (n  1)2 }   0
2 
So the solutions are m + n – 1 = 0 or m = n, m = –1, n = –1 i.e., m + n – 1 = 0 and (–1, –1) clearly there
are infinite solutions.
48. Answer (4)
2 + 2 + 2 = 28
By observation following triplets represent (, , ).
(2, 3, 4), (2, 4, 3), (3, 2, 4), (3, 4, 2), (4, 2, 3), (4, 3, 2). Total 6 triplets are possible.
49. Answer (3)
For each element x of S we associate the numbers 1, 2 or 0 according as x is in A, x is in B or x is in none
of them.
Each way of disposing off the members of S can be associated with a n-digit sequence made up of 1, 2
or 0. For example, 10201011……1 means element ‘1’ is in A, element ‘2’ is in none of A and B, element
‘3’ is in B, etc. Hence any selection of A and B corresponds to the numbers of n-digit numbers that can be
made using the digits 0, 1 or 2 with leading zeros allowed. There are obviously 3n such numbers. But that’s
the number of ordered pairs. We are being asked the number of unordered pairs. Every unordered pair counted
twice in the number 3n, except when both A and B are empty (viz., (, ) given just one selection).
3n  1 3n  1
Hence the number of unordered pairs  1 .
2 2
50. 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.
51. Answer (4)

We can write the relation as
x12 + x22 = y12 + y22 = c12 where c2 = 2
Let x1 = c cos, x2 = c sin and y1 = c cos, y2 = c sin
P = (1 – x1)(1 – y1) + (1 – x2)(1 – y2)
= (1 – c cos)(1 – c cos) + (1 – c sin)(1 – c sin)
= 1 – c(cos + cos) + c2cos cos+ 1 – c(sin + sin) + c2 sin sin
= 2 – c{(cos + sin) + (cos + sin)} + c2 cos( – )
    
 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.
52. Answer (2)
3 33 333 3333
    ....
11 112 113 114
3  11 111 1111 
  1  2  3
 ..... 
11  11 11 11 
3  99 999 
 9  2  .....
99  11 11 
3  102  1 103  1 
  10  1   2
 ..... 
99  11 11 
3  102 103 104   1 1  

  10   2  3  ....  –  1   2  ....  
99  11 11 11   11 11  
  
3  10  1 
   
99  10  1 
 1   1  
 11  11  
 
3  10 1 
  
99  1 10 
 
 11 11 
 11 
 110  10 
 
33

10
53. 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)  0
 (x2 – 4x + 3) (x2 – 6x + 8)  0  (x – 1) (x – 3)(x – 2)(x – 4)  0
+ – + – +
– 
1 2 3 4
x [1, 2]  [3, 4]
Hence number of integral value of |x| = 4
54. Answer (4)
(z + )3 = –3
 z1 = – – , z2 = – – , z3 = – – 2.
They form an equilateral triangle with side
3
| z1  z2 |  | (  1) |  |  |  3  i  3 ||
2 2
54a. Answer (1) (IIT-JEE 2009)

3 3
zz  zz  350
| z |2 ( z 2 )  | z |2 ( z 2 )  350
| z |2 ( z 2  z 2 )  350
 (x2 + y2) (x2 – y2 + 2ixy + x2 – y2 – 2ixy) = 350
 2(x2 + y2)(x2 – y2) = 350
 (x2 + y2)(x2 – y2) = 175 = (32 + 42)(42 – 32)
Which suggests that points (x, y) satisfying the given equation are (4, 3), (–4, –3), (–4, 3), (4, –3)
y
(–4, 3) A(4, 3)
B
x
O
D
C (4, –3)
(–4, 3)
Required area = AB × BC
= 8 × 6 = 48 sq.units
55. Answer (3) y
z 2  z
Clearly, arg   
 z 2 2
x
(–2, 0) O (2, 0)
 z z  
 arg  1 3   
 z2  z3  2
So, z1, z2, z3 will be the vertices of a right angled triangle.

56. 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
57. 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
58. Answer (2)
Let f(x) = x2 + ax + b
then x2 + (2c + a)x + c2 + ac + b = f(x + c)
Thus roots of f(x + c) = 0 will be 0, d – c.
59. Answer (2)

Rotation about B gives C(z3)
z1 – z2 = (z3 – z2)
2
3
z3 – z2 = 2 (z1 – z2)
B(z2)
 z3 = 2 z1 + (1 – 2) z2 A(z1)
60. Answer (1)

As, 2 – 2 + 42 = 0
2
     
     1 0
 2   2 

   or – 2
2
  = –2 or – 22
1 1 3
So, required area of OPR  |  | |  | sin120   4  8  8 3,
2 2 2
61. Answer (4)
(z – i) (z2 + 2iz – 2) = 0  z = i, 1 – i, –1 – i
0 1 1
1 1  1 1  | 2 | 2
Area = 2
1 1 1
62. Answer (3)

For required terms
7
 1  2 1 
x  x  x  2 
  x 
7 7
 2 1   2 1 
Coefficient of x–1 in  x  2  + Coefficient of x in  x  2  = 0
 x   x 
63. 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
64. 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 )  2
, ( z2  z3 )( z2  z3 )  2 and ( z1  z3 )( z1  z3 )  2
k 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
65. 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
66. 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 .
67. Answer (1)
Let z = x + iy
|x| + |y| = 8, |x| |y| = k
Applying A.M.  G.M.
|x||y |
 | x || y |
2
4 k
 k  16
68. Answer (2)
 AOB =  AOC = 
A z1
If z1 = re i, then
z2 = re i . e i
O
and
B z2 C z3
z3 = re i . e –i
 z2 z3 = r2 e2i = z12
69. Answer (1) Pz

A B z2
Let PQ be the diameter  AB and CD z1

z1 = ze i , z2 = ze –i O
 
z3 = –ze –i  , z4 = – ze i
C D z4
z3
 z1z2 = z3z4 –zQ
70. Answer (1)
OB = OA cos, O C = OA cos 2.
z2 = (z1ei) cos
z3 = (z1e2 i) cos2 C z3

Bz
 z3  2
 z22 = z12 . e2 i. cos2 = z12 cos2.  
z
 1 cos 2  
O  A
z z cos 2  z1
 z22  3 1
cos 2
or z22 cos 2 = z3 z1 cos2 .
71. Answer (2)

Let B corresponds to z.
Rotation about E, we get
D C
z – (6 – i ) = [(1 – 2i ) – (6 – i )] i = 1 – 5i
z = 7 – 6i
E 6–i
By mid-point formula
C is 2(6 – i ) – (1 – 2i ) = 11 A B
1 – 2i z
D is 2(6 – i ) – (7 – 6i ) = 5 + 4i.
72. Answer (2)

From question
2a22 + b + c = 0
 b + c = –2a22 …(i)
also, 3a22 – 2b – 2c = 0
3
 b  c  a 22 …(ii)
2
Now, let f(x) = 4a2x2 + 3bx + 3c
Then f() = 4a22 + 3(b + c)
= 4a22 – 6a22 …[from (i)]
= –2a22 < 0
f() = 4a22 + 3b + 3c
= 4a22 + 3(b + c)

9 2 2
2 2 x-axis
= 4a   a  …[from (ii)]  
2
17 2 2
= a  0
2
∵ f() f() < 0, then one root of the equation f(x) = 0 must lie between  and .
73. Answer (2)
| z   |2 |  z  1 |2
( z   ) ( z   )  (  z  1) (z  1)
|z|2 + ||2 = ||2 |z|2 + 1
(||2 – 1) (|z|2 – 1) = 0
 |z| = 1 since ||  1.
74. Answer (3)
| z   |2  |  z  1 |2
( z   ) ( z   )  (  z  1) (z  1)
|z|2 + ||2 – ||2 |z|2 – 1 > 0
(|z|2 – 1) (1 – ||2) > 0
 |z|2 – 1 < 0 since 1 – ||2 < 0
 |z| < 1
75. Answer (3)
1
z  i  z = –i, –i2,
z
1
z 2005  2005
 i (   2 )  i
z
76. Answer (3)

Let, n1, n2, n3 and n4 be the number of white, red, yellow and brown balls that are selected.
 n1 + n2 + n3 + n4 = 8
So, the required number of ways

= coefficient of x8 in (1 + x + x2 + ........)4
= coefficient of x8 in (1 – x)– 4
= coefficient of x8 in (1 + 4C1x + 5C2x2 + 6C3x3 + ........)
= 11C
8
= 11C
3
77. Answer (4)

z = a + ib
|z| = 1  a2 + b2 = 1
z – 1 a  1  ib (a  1  ib) (a  1  ib)
 
z  1 a  1  ib (a  1)2  b 2
z  1 a2  1 b2
Re   0 , [since a2 + b2 = 1]
 z  1  (a  1)2  b 2
78. Answer (1)
1
n = 1  in + i–n = i + =i–i=0
i
 1 
n = 2  i n + i – n = i 2 + i –2 = –1 +   = –2
  1
1
n = 3  i 3 + i –3 = –i + = –i + i = 0
i
1
n = 4  i4 + = 1 + 1 = 2.
i4
After that the values repeat. Hence the number of element is 3.
79. Answer (3)

13 = 1
Now, a + b =  + 2 + 3 + 4 + 5 + 6 + –4 + –3 + –1 + –6 + –5 + –2
= ( + 2 + ... + 6) + (7 + 8 + ... + 12) = –1
Also, ab = ( + 3 + 4 + –4 + –3 + –1) × (2 + 5 + 6 + –6 + –5 + –2)
= 3( + 2 + 3 + ... + 12) = –3
Therefore, equation is given by
x 2 – (a + b)x + ab = 0
 x2 + x – 3 = 0
80. Answer (3)
x 2 – 2x + 4 = 0
 x  1  3i  1  3i , 1  3i
 x = –2, –22
Now,  8 +  8 = (–2)8 + (–22)8
= (–2)8{8 + 16}
= 256( + 2) = –256
81. 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  25
∵ sin   ∵ 0  0   . Also PO = 25 2  15 2  20 
5 2
O
Now the coordinates of P in the argand plane is 20 (cos + i sin )
3 4
= 20  i  = 12 + 16 i
5 5
82. Answer (3)

z2 = 2  |z| = ||
 B A
Also (1, i )  A ∵ |1| = |i|
But (1, i ) B ∵ 12  i 2
83. 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.
83a. Answer (2) y (IIT-JEE 2008)

Let z = x + iy P
Set A corressponds to the region y  1 ...(i) 0, 2
(2, 1)
Set B consists of points lying on the circle, ...(ii) y=1
x
centred at (2, 1) and radius 3,
2, 0
i.e. x2 + y2 – 4x – 2y = 4
Set C consists of points lying on the x + y = 2 ..(iii)
Clearly, there is only one point of intersection of the line x  y  2 , and circle x2 + y2 – 4x – 2y = 4
83b. Answer (3)

2 2
z  1– i  z–5–i
= (x + 1)2 + (y – 1)2 + (x – 5)2 + (y – 1)2
= 2(x2 + y2 – 4x – 2y) + 28

= 2(4) + 28 ∵ x 2  y 2 – 4 x – 2y  4 = 36 
83c. Answer (4)
w – 2  i   3
 |w | – |2  i | < 3
 3  5  w  3  5
 –3– 5 – w 3– 5 ...(i)
Also, z – 2  i   3
 –3 5  z 3 5 ...(ii)

– 3 < |z| – |w| +3 < 9
84. Answer (2)

z1  z2
M the midpoint is
2
Now the vertices P and Q, i.e. zp and zQ are given by
 z1  z2   z  z2 
zP, Q =    i  z2  1 
 2   2 
Q B (z2)
 z1  z2   z2  z1 
=  2 i 2 
    M
 z1  z2   z1  z2 
=   ∓ i 
 2   2 
1 1 1 1 A (z1) P
= ( z  z2 )  i ( z1  z2 ) and ( z1  z2 )  i ( z1  z2 )
2 1 2 2 2
85. Answer (1)
|zz | 3
3 A
|x|
2 C
The circle is having centre origin & radius 1 O
Area of shaded portion D B
 Area of OCD]
= 4 [Area of OAB
–3 3
1  1 3 1  3 x= 2
 4  . (1)2  . .   x=
2
2 3 2 2 2 3 2
86. Answer (4)

Roots are 2, 2 + 3, 2 + 32, 2 –  – 2.
i.e. 2, 2 + 3, 2 + 32, 3
The roots 2 + 3, 2 + 32 can come from a 2nd degree polynomial with real coefficients.
Again the root 2 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.
87. Answer (4)
(3)2
Area of shaded region  4   9
4
Imaginary axis
  y=3
–3 + 3i 3 + 3i
real
axis
–3 – 3i 3 – 3i
  y = –3
x = –3 x=3
88. Answer (4)
f(x) is divisible by x2 + x + 1 = (x – ) (x – 2)
  and 2 are roots of f(x) = 0
 g(3) +h(3) = 0
 g(1) + h(1) = 0
and g(1) + 2h(1) = 0
 g(1) = h(1) = 0
89. Answer (4)

z 1 1  3
Let   z
z3  1
As |z| = 1  | – 1| |1 + 3|
 (– 1) = 3   1
1
3 1    
 3  4/3 4 1
The locus of  is a circle, the radius being =  
1 8/3 8 2
3
3
89a. Answer (1, 4) [JEE (Advanced)-2017]

a – b  1, y  0, z = x + iy
 az  b 
Im  y
 z 1 
  (ax  b )  ayi   x  1  iy  
lm      y
  ( x  1)  iy   x  1  iy  
 (ax  b )( x  1)  ay 2  ay ( x  1)i  iy (ax  b ) 
lm    y
 ( x  1)2  y 2 
 ay(x + 1) – y(ax + b) = y(x + 1) + y 2 3
 ax + a – ax – b = x2 + 2x + 1 + y2
 a – b = x2 + y2 + 2x + 1
 1 = x2 + y2 + 2x + 1
 (x + 1)2 = 1 – y2
 x  1   1 y 2
 x  1  1  y 2
90. Answer (2)
z2 
 
z 2 3
This will denote part of the circle.
91. 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
=
2 k
21  cos 
 n 
k k
i .2 sin . cos
=  
1 n n   1  i cot k
2  2 k  2 2 n
2 .  2 sin
 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
92. 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 = –B, –2B

 2 
 |A| = |B|
Now A – B = –B – B = 2B
or A – B = –2B – B = –(2 + 1)B = B.
i.e. |A – B| = |2 B| or |B| = B
 |A – B| = |A| = |B|
 |A – B| = |A – 0| = |B – 0|
Showing that the origin point A and point B form an equilateral triangle.
93. Answer (4)
  r 2 .  n Cr  nCr 1    2r  1 .n Cr 
n
r 1
  r  1
2
. nCr  r 2 · nCr 1
n
= Vr 1  Vr
r 1
f(n) = Vn+1 – V1 = (n + 1)2 · nCr – 1 = n2 + 2n

 f(50) = 502 + 2 × 50 = 2500 + 100 = 2600
94. 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  = ( x  y  z )   1  1  1    xyz  1 
 y  z  x   y  x zx   x y z   xyz 
 1  1  1 1
=  x  y    y  z    z  x   xyz  xyz
 
 7 ( 4)(1)  7  4  1  xyz  1

3 3 xyz
1
 xyz  xyz  2
 (xyz)2 – 2(xyz) + 1 = 0
 (xyz – 1)2 = 0  xyz = 1
95. 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.
96. Answer (3)

n   n   n 
The greatest power of a prime p in n! is  p    2    3   .......
   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  n
n 1 1  
= 1    .......  = 5 · 
5  5 25   1  1  4
 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.
97. 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.
98. 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.
10 2  100  25
Note that,
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
 T  29  2  1  57
29
99. Answer (3)
 2 3 1  2 1 4
 1       –   1     – 2   
   
 1 3 4  1 2 3 4
 1   – 3        1– 4       
     
= (–24) (–23) (–22) (–2)
= 1610
= 16
100. 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
101. 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.
102. 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.
103. 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
104. Answer (4)
log3 | z1| log 1 2

 125   64 
 100    9
   100  y
log3 | z1| 2 log 1 2 (0, 3) P

5 5
or 4   9
  4 2
S C
x
log3| z1| log3 2 (–1, 0) O (1, 0) (3, 0)
5 5
or 4   2
  4
(0, – 3) Q
 log3|z – 1|  log32
 |z – 1|  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 
105. Answer (1)
1
On putting x  we get ; a + by + cy2 = 0
y
If x   y  0, then
a
∵ y1y 2 
c
So, if one of the root becomes zero
 a0
106. 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 ,  are the roots of the equation ax2 – bx – c = 0
Since,  < 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
 n=2 x
– 
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
107. Answer (1)

Let r be the common ratio of the G.P.
a1
5  a1  5 1  r 
1 r
52 1  r 
2
a12
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
108. 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   4 3 7
 4   3    9  x  .  x  5  
43    
 4   3  
(9 – x)4 (x + 5)3 < 27.44.33
Maximum value is 27.33.44.
109. Answer (2)
n+1C
n – 2–
n + 1C
n–1  100  n  8
110. Answer (4)
111. 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
 The required co-efficient of x4
5! 3 5!
= .3 ( 1)2  ( 1)3
2!3! 3!2!
= 260
112. 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|
 |x1| + |x2| + |y1| + |y2|
= (z1) + (z2)
113. Answer (3)
The number of ordered pair (p, q ) whose LCM is r 2 = 5
The number of ordered pair (p, q) whose LCM is s 4 = 9
The number of ordered pair (p, q ) whose LCM is r 2 s 4t 2 = 5 × 9 × 5 = 225.
114. 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
115. Answer (2)
The number of ways to forming first team = 9 × 8 = 72
The number of ways to forming second team = 7 × 6 = 42
72  42 (3024 )
Total number of ways   1512
2 2
116. Answer (2)

The total number of wrong answers = n.20 + (n – 1)21 + (n – 2)22 + .....+ 12n – 1
= 2047
 n = 11
117. 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
118. 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
119. 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
120. 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 =  ( 1)m n
Cm
( 1) m(m  1)........(1)(n  m )! m
( 1) m !(n  m )!
 7 = (–1)7 nC7.
121. Answer (1)
1 10
The number of ways to select 1st station = 10 2
The number of ways to select 2nd station = 7 9
3
8
The total number of ways = 10[5  4  2  5] = 50
3! 4
122. Answer (2) 7
5 6
sin a  7 sin b  4(sin c  2 sin d )
cos a  7 cos b  4(cos c  2cos d )
sin a  8 sin d  4 sin c  7 sin b ...(i)

cos a  8 cos d  4 cos c  7 cos b ...(ii)
Squaring and adding equation (i) and (ii)
1  64  16(sin a sin d  cos a cos d )  16  49  56(sin c.sin b  cos c.cos b )
cos(a  d ) 56 7
  
cos(b  c ) 16 2
123. 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.
124. Answer (4)
The total number of non-negative integral solution of x + y + z  n
= The total number of non-negative integral solution of x + y + z + t = n
= n + 3C3
125. Answer (1)
Obviously the LCM is got by taking the greater of ai and bi. Hence choice (1) is correct.
126. 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.
127. 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
128. Answer (1)

Rewrite  as
 = 4673 + 6734 = 44672 + 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)
  is composite,
∵   4 929  929 4 

Similarly  is composite  
232 4 4
  4  (4 )  929 
129. 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
130. 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 = (am10m + am–110m–1 +........+ a110 + 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.
131. 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.
132. Answer (4)
35 21
Let a  2 2  1 and b  2 2 1
 
22 213
213
a  2  2235  1  22  1  2222 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.
133. 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  4
2n
 1
n 4    n 3  .... decreasing powers of n
 lim 4
n  2n 4
1
 .
8
134. Answer (1)
We have,
22n = 2(2nC0 + 2nC
1 + .......+ 2nC
n – 1) + 2nC
n + 2nC
n – 2nC .
n
(2n  1)!
 2n C 0  2n C1  ...........  2n C1  2 2n 1 
n! (n  1)!
135. Answer (3)
Set x = 1, , 2 and then add the results.
136. 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
137. 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.
138. Answer (3)
We have,
(x 2 – x – 2)5 = –[2 + x (1 – x)]5 expand it and then equate the coefficient of x 5.

Power of Coefficient of x11
x2 x3 x4 4 7
C0 × C1 × C2
12
0 1 2 4
C2 × 7C1 × 12C1
2 1 1 4
C4 × 7C1 × 12C0
4 1 0
4
1 3 0 C1 × 7C3 × 12C0
1113
138b. Answer (8) [JEE (Advanced)-2015]

(1 + x) (1 + x2) ..... (1 + x100)
Possible combination of 9 are (0, 9), (1, 8), (2, 7), (3, 6), (4, 5), (1, 2, 6), (1, 3, 5) (2, 3, 4)
So, coefficient = 8
138c. Answer (4) [JEE (Advanced)-2017]

Required number of subsets
= 5C1 × 4C4 + 5C2 × 4C3 + 5C3 × 4C2 + 5C4 × 4C1 + 5C5 × 4C0
= 5 + 40 + 60 + 20 + 1 = 126
Alternate method
Coefficient of x5 in (1 + x)5(1 + x)4 = 9C5 = 126
139. Answer (2)

According to the question ( – 1)35 = (1 – )35   = 1
140. 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
141. 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.
142. Answer (4)

Greatest coefficient in
15! 15!
( x  y  z  t )15  
4 3 3
(3! ) ( 4! ) 3! ( 4 ! ) 3
143. 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
2n 2n 2n
 n  Cn  2  Cn .
= (n  1) 2n Cn ± 22n
144. Answer (3)

We have
(1 + x)n – 1 = nC1x + nC2x 2 + nC3 x 3 +.....+ nCn x n.
The n th root of unity are given by
2Ki
e n , K  0, 1, 2, 3,......., n  1.
Put x = any one of the non real complex nth root.
145. Answer (1)

Equate the coefficients of like terms in the expansion.
146. 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    bz  c   c  b z
2
z2  z  1  0
  5  1     5  1  
 z      z      0
  2     2  
5 1
 z 
2
 5  1 5  1
 z  , 
 2 2 
147. 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
148. Answer (1)
We have
n n n
10! 1 2 3
( 2  3 3  6 5 )10   22 3 3 5 6
n1 ! n2 ! n3 !
149. Answer (2)

1
–, –2 are roots are x  1
x
a = –1, b = 7
a – b = – 1 – 7 = – 8.
150. 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  2
151. 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.
152. Answer (4)
2 |x|
12|
3| x  10log10 9
 3|x 2 12|  9|x|
 |x2 – 12| = |x|

 x2 – 12 = ±x
 x = ±3, ±4
153. Answer (4)
S = 132 + 233 + 334 + .... + n3n + 1

3S = 133 + 234 + ..... + n3n + 2
–2S = (132 + 133 + 134 + ... upto n terms) – n3n+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
154. Answer (2)
Set x = y = z = t = 0
155. Answer (1)
n(S) = 53 = 125
n(E) = 5C3  3!
60 12
 P (E )  
125 25
156. Answer (1)
 i j  ni n  j 
   n Ci  n C j      n Ci 
n
C j 
0i  j n   0i  j n 
 i j  n2k
    n C  n

C j  2
0i  j n  i
157. Answer (1)
Expand the expression.
158. 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
159. Answer (2)
n n 1
Use the result n Cr  Cr 1.
r
160. Answer (1)

The given equation can be written as
x 3  ( x1  x3  x5 )x 2  ( x1x3  x1x5  x5 x3 )x  ( x1x3 x5 )
 x 3  ( x2  x4  x6 )x 2  ( x2 x4  x2 x6  x4 x6 )x  ( x2 x4 x6 )  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.
161. 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 + ..................
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
 
162. 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
163. Answer (2)
4
2 log3 ( x 1) 
log3 ( x 1)
| x  2|  ( x  2)7
For domain x – 1 > 0 and x–11

x>1 and x2
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
164. 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
165. Answer (1)
× × × × × ×
Suppose stations are on linear path s1 s2 s10
Number of ways of selection = 10 – 4 + 1C = 7C3 = 35

3
Pairs of following stations are on circular path those are not counted
s1
s1s10 , s3 s5 s4 s6 s5 s7 s6 s8 × s2
s10 ×
s3 s6 s4 s7 s5 s8 ×
s9 × ×s3
s3 s7 s4 s8
s3 s8 s8 × × s4
Number of ways of selection = 35 – 10 = 25.

s7× ×s
5
×
166. Answer (2) s6
n(E) = 4C113C839C5
n(S) = 52C
13
( 4 13C8  39C5 )
P (E ) 
52
C13
167. Answer (3)
Either all 5 are safe or 4 out of 5 are safe.
5
4
Probability that all 5 all safe =  
5
4 4
Probability that four are safe  5C1  1   4    4 
5 5 5
4
4 9
P (E )    
5 5

P(2) + P(3)...... 0.96
1 – P(0) + P(1)  0.96
n n
1 1
1 – 0.96  n C0    nC1  
2 2
 (0.04)2n  1 + n
 4.2n (n + 1)100
 2n+2  (n + 1)100
as 210  900
 n=8
168. 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
169. Answer (4)
Required probability = P(A B) + P(A  B) + P(AB)
170. Answer (2)
The last two digits must be divisible by 4.
n(S) = 9!
n(E) = 2(8)!
2
P (E ) 
9
171. 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
172. 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 (N1N2) – n (N1N3) – n (N2N3) + n (N1N2N3)
= 441 + 121 + 736 – 11 – 11 – 21 + 1

= 1256
(n(N1N2) = number of divisiors of HCF of N1 and N2)
173. Answer (1)

Let f(x) = x(4x2 – x + 2)
Clearly f(x) = 0 has only one real root
 x(4x2 – x + 2) –  = 0 also has only one real root
174. 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
175. 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
176. Answer (1)

1 1 1   1 2 100 
3   2  ......  100   6  100  99  ...... 
4 4
 4  4 4
 4 

S1 S1
  1 100 
 1    100
3 4   1  1 
Now, S1     4
4  1  1/ 4   
 
 
1 2 ......... 100
and S2  100
  
4 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 

177. 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
 a
178. Answer (3)
Coefficient of xn–1 is   CiC j

0i  j n
As, (C0 + C1 + C2 + .... + Cn )2 = C02  C12  C22  ........  Cn2  2   CiC j

0i  j n
22 n  2n
Cn  2   CiC j
0i  j n
   Ci C j  1 22n  2nCn 
0i  j n 2
178a. Answer (5) [JEE(Advanced) 2016]

3
C3  3C2  4C2  5C2  ...  49
C2  m2 50C2  (3n  1) 51C3
50
C3  m2 50C2  (3n  1) 51C3
n n 1
Cr  nCr 1  Cr
n 1
Cr  nCr  nCr 1
m2 50C2  3n  51C3  50
C2
(m2  1) 50C2  3n  51C3

50  49 51 50  49
(m 2  1)   3n 
2 32
( m 2  1)  51n
m2  51n  1 n5
179. Answer (4)

∵ (2a + 1) x = x2 + 9
x2 9
 2a  1  
x x
9
= x  x
9
2 x 
x >6
5
 a
2
180. Answer (3)

b
y B (z2)
∵ z1  z2   ...(i)
a
c
and z1z2  ... (ii)
a (z1)
3 A
b2  b a 
2
z1 z2 i  3
Now,  =  z1  z2 
2
z1z2 = z  z  2 = e  ei  3  2 = 3 x
ac ca 2 1
o
i 3
z2 = z1e
181. Answer (3) y
c
Here,   0
a2
 
b x
and       0 [    ] and from graph
a2
we can conclude that  >  > 0 >
even place
182. Answer (4)
Even digits = 0, 2, 4, 6, 8
5
Odd digits = 1, 3, 5, 7, 9
Required no. = 4  3  4  4  3 = 576

odd place


SM 21 22 XI P1 Mathematics Unit-1 Section-A

Uploaded by

Document Information

Original Description:

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

SM 21 22 XI P1 Mathematics Unit-1 Section-A

Uploaded by

Copyright:

Available Formats

Algebra UNIT 1

Section A : Straight Objective Type

  1   2008    2   2007    1004   1005 

Then, it follows that 85 – a5 is a multiple of 5, whence a5 = 0. Continue in this process, we obtain a4 = 1, a3

10. Answer (4)

(2  )(  2) = 2 + 2 +  (2 +)

12. 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 + 2293 – 2293} {(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)

13. Answer (4)

Now, 11111 = 41 × 271

From (A) and (B)

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

15. Answer (4)

2006! + 2, 2006! + 3, ......., 2006! + 2006

18. Answer (3)

22. Answer (1)

23. Answer (4)

for 0 < m < 1

 a0  a1  a2  ...  a2 n   a  a  ...  a 1/2

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

24. Answer (1)

( 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  yg ) d }

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

27a. Answer (5) [JEE (Advanced)-2015]

28. Answer (1) 2 2

30. Answer (2)

35. Answer (1)

36. Answer (1)

38. Answer (4)

39. Answer (3)

Distance travelled in the first day = 1.2n

Distance travelled in the second day = 2.2n–1

Distance travelled in the third day = 3.2n–2

Distance travelled in the fourth day = 4.2n–3

Distance travelled in the nth day = n.21

Total distance covered is

S = 1.2n + 2. 2n – 1 + 3.2n – 2 + 4.2n – 3 + ...... + n.21

41. Answer (2)

(300)600 > (600)! > (200)600

42. Answer (1)

For our case k = 216,  = 3,  = 2

 Amin  ( 216  2 6 )2  (6 6  2 6 )2  (8 6 )2 = 64 × 6 = 384 sq. cm.

43. Answer (4)

44. Answer (1)

Case-II : f(3) = 4, then

51. Answer (4)

52. Answer (2)

3  102 103 104   1 1  

54a. Answer (1) (IIT-JEE 2009)

55. Answer (3) y

So, z1, z2, z3 will be the vertices of a right angled triangle.

57. Answer (2)

59. Answer (2)

60. Answer (1)

62. Answer (3)

63. Answer (1)