Adfda PDF

Aakash Educational Services Ltd. Regd. Office: Aakash Tower, Plot No.-4, Sector-11, Dwarka, New Delhi-75 Ph.
011-47623456
Section A : Straight Objective Type
1. Answer (1)
By division algorithm
x
100
= (x
2
3x + 2) g(x) + (ax + b) ...(i)
where ax + b is the remainder obtained when x
100
is divided by x
2
3x + 2, a polynomial of degree 2.
(i) can be recast as
x
100
= (x 1) (x 2) g(x) + ax + b
100
100
100
2 2
1 2
2 2 2
b a 1 1, Put,
=
=
+ = =
+ = =
b
a
b a x
x
Thus, R(x) = ax + b = (2
100
1)x + (2 2
100
)
= (2
100
1)x + 2(1 2
99
).
2. Answer (3)
Let,
| | | |
| |
| | | |
| |
| | | |
| |
) , , (
x z
x z
z y
z y
y x
y x
z y x f
+
+
+
+
+
+
+
+
=
Two of the three number, say x and y, must have the same sign, therefore |x + y| = | x| + | y|
| | | |
| |
| | | |
| |
1 ) , , (
x z
x z
z y
z y
z y x f
+
+
+
+
+
+ =
on the other hand, as |a + b| |a| + |b|, we have
3 1 1 1
| | | |
| |
| | | |
| |
1 ) , , ( = + +
+
+
+
+
+
+ =
x z
x z
x y
z y
z y x f
1 0 0 1
| 1 | | 1 |
| 1 1 |
| 1 | | 1 |
| 1 1 |
| 1 | | 1 |
| 1 1 |
) 1 , 1 , 1 ( = + + =
+
+
+
+
+
+
+
= f
3 1 1 1
| 1 | | 1 |
| 1 1 |
| 1 | | 1 |
| 1 1 |
| 1 | | 1 |
| 1 1 |
) 1 , 1 , 1 ( = + + =
+
+
+
+
+
+
+
+
= f
and for each t (1, 3), take
1
3
, 1
+
= = =
t
t
z y x
then
=
1
3
,
1
3
, 1 ) , , (
t
t
t
t
f z y x f
| 1 |
1
3
1
1
3
1
3
1
3
1
3
1
3
1
3
| 1 |
1
3
1
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
=
t
t
t
t
t
t
t
t
t
t
t
t
t
t
t
t
Algebra
UNIT1
2 Algebra Success Magnet (Solutions)
Aakash Educational Services Ltd. Regd. Office: Aakash Tower, Plot No.-4, Sector-11, Dwarka, New Delhi-75 Ph.011-47623456
1
1
4
| 1 |
1
2
2
1
1
3
1
1
2 2
2
+
+
= +
+
+
+
=
t
t
t
t
t
t
t
= (t 1) + 1 = t
the f(x, y, z) realizes all possible values in the interval 1 t 3.
3. Answer (2)
d
1
, d
2
, d
3
.....d
k
are divisors of n and d
1
+ d
2
+ d
3
+....+ d
k
= 72
+ + + + = + + + +
k x
d
n
d
n
d
n
d
n
n d d d d
......
1 1
.....
1 1 1
3 2 1 3 2 1
) .... (
1
3 2 1 k
d d d d
n
+ + + + =
n
72
=
4. Answer (4)
Rewrite f(x) as
x
x
x
x
x
x
e e
e
e e e
e e
e
e
x f
2
2
1 2
1 2
1 2
1 2
1
) (
+
=
+
=
+
=

x x
x
x
x
x
x
x
e e
e
e
e
e
e
e
e
+
=
+
=
1 2
2
x x
x
e e
e
x f

+
=
1
1
) 1 (
So,
1 ) 1 ( ) (
1
1
1
=
+
+
+
= +

x x
x
x x
x
e e
e
e e
e
x f x f
Now,
+ +
2009
2008
.....
2009
2
2009
1
f f f
+ +
=
2009
1005
2009
1004
.......
2009
2007
2009
2
2009
2008
2009
1
f f f f f f
= 1 + 1 + 1 + .... to 1004 times
= 1004
5. Answer (2)
We employ the method of differece to telescope the sum
)! 2 (
1
! ) 2 (
1
) 2 ( !
2
)} 2 )( 1 ( 1 1 { !
2
)! 2 ( )! 1 ( !
2
2
+
+
=
+
=
+
+
=
+ + + + +
+
=
+ + + +
+
=
k
k
k k k k
k
k k k k
k
k k k
k
t
k

)! 2 (
1
)! 1 (
1
! ) 2 (
1 ) 2 (
+
+
=
+
+
=
k k k
k
3 Success Magnet (Solutions) Algebra
! 3
1
! 2
1
1
= t
! 4
1
! 3
1
2
= t
........................................
! 2008
1
! 2007
1
2006
= t
Adding we have sum =
! 2008
1
2
1

6. Answer (1)
1
1
1
1
1
1
Let
+
+
+
+
+
=
y zx x yz z xy
E
xy + z 1 = xy + 1 x y = (x 1) (y 1)
So,

=
) 1 )( 1 (
1
y x
E
) 1 )( 1 )( 1 (
3
z y x
z y x

+ +
=
) ( 5
1
1
1
zx yz xy x xy xyz + +

=
+
=
)] ( ) [(
2
1 2 2 2 2
z y x z y x zx yz xy + + + + = + +
2
1
] 3 2 [
2
1 2
= =
9
2
2
1
5
1
=
= E
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 (1)
0 1
1 1 1
1 1 1
1 1 1
1
1
1
3
= + =
+ x
x
x
x
x x
x x
x x
x = ,
2
1
1
2009
2009
= +
x
x
9. Answer (2)
Let PA = PB = d
BP is obtained by rotating BO about B and magnifying by
r
d
.
z z
2
=
r
d
(O z
2
)i ....(1)
O
r
r
B
A
z
1
z
2
P
z
Similarly, i z z
d
r
z O ) (
1 1
= ....(2)
For (1) and (2), z
1
(z z
2
) = (z z
1
) ( z
2
)
2 1
2 1
2
z z
z z
z
+
=
10. Answer (3)
The total number of words before COCHIN will be equal to the number of words starting with 'CC' + The number
of words starting with 'CH' + the number of words starting with 'CI' + the number of words starting with 'CN'.
= 24 + 24 + 24 + 24 = 96
11. Answer (4)
Let us consider the number in any base b
N = (12321)
b
= b
4
+ 2b
3
+ 3b
2
+ 2b + 1, (b 4).
The above expression reminds us of reciprocal equation. We try to factorize it by pairing terms equidistant from
beginning and end.
N = (b
4
+ 1) + 2b(b
2
+ 1) + 3b
2
= (b
2
+ 1)
2
+ 2b(b
2
+ 1) + b
2
= (b
2
+ 1 + b)
2
= (b
2
+ b + 1)
2
The number N is a perfect square in any base b 4 (Note that we must have b 4 as digits 1, 2, 3, have been
used up)
12. Answer (2)
Let
3 3
2 29 45 2 29 45 + + = ...(i)
on cubing both sides
3 3 3 3
) 2 29 45 ( ) 2 29 45 ( 2 29 45 ) 2 29 45 ( 3 ) 2 29 45 ( ) 2 29 45 ( +
+ + + + + =
+ =
3
1682 2025 3 90
{using (i)}
= 90 + 3 7 = 90 + 21

3
21 90 = 0 ( 6)(
2
+ 6 + 15) = 0
The equation
2
+ 6 + 15 = 0 has no real roots, hence = 6 i.e., . 6 2 29 45 2 29 45
3 3
= + +
Thus is a rational number.
13. Answer (3)
N = 2
744
1 = 2
93 8
1 = (2
93
)
8
1
8
= (2
93
1) (2
93
+ 1) ((2
93
)
2
+ 1) ((2
93
)
4
+ 1)
= (2
93
1) (2
93
+ 1) {(2
93
)
2
+ 1 + 22
93
22
93
} {(2
124
)
3
+ 1
3
}
= (2
93
1) (2
93
+ 1) {(2
93
+ 1)
2
(2
47
)
2
}{(2
124
+ 1)(2
248
2
124
+ 1)}
= (2
93
1)(2
93
+ 1)(2
93
+ 2
47
+ 1) (2
93
2
47
+ 1)(2
124
+ 1)(2
248
2
124
+ 1)
14. 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.
a
1
+ a
2
+ a
3
+ a
4
+ a
5
> 0
a
2
+ a
3
+ a
4
+ a
5
+ a
6
> 0
.....................................
a
9
+ a
10
+ a
11
+ a
12
+ a
13
> 0
Adding vertically, we get
(a
1
+ a
2
+.........+ a
9
) + (a
2
+ a
3
+ .........a
10
) +........+ (a
5
+ a
6
+.......+ a
13
) > 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.
15. Answer (4)
111 1000 ..... 111 1 .... 111
s 1' 120 times 123
+ =

...(A)
Now, 11111 = 41 271
We note that,
111 00001 ...... 100001 11111 1 ..... 111
' 1 24 ' 1 120
+ =

s s
...(B)
From (A) and (B)

111 1000 00001 ..... 100001 11111 1 ...... 111
times 123
+ =

= 41 271 100001....00001 1000 + 111
Thus,

times 123
11 ..... 111 when divided by 271 leaves a remainder of 111.
16. Answer (1)
At first sight the problem looks intractable. However, using the idea of conjugate and modulus function, the
problem is solved easily.
Consider,
| 3 2 |
| ) 3 2 )( 3 2 ( |
| 3 2 |
b a
b a b a
b a
+
= +
| 3 2 |
3 2
2 2
b a
b a
=
...(A)
0 3 2 b a for then
b
a
would be
2
3
, i.e.,a rational number being equal to the irrational number. Impossible
Now a and b are integer and so is 2a
2
3b
2
|2a
2
3b
2
| 1 ...(B)
Also,
3 | | 2 | | | 3 | | 2 | | 3 2 | b a b a b a + = +
= 350 ) 3 2 ( 100 3 100 2 100 < + = + ...(C)
If follows from (A), (B) and (C)
350
1
| 3 2 | , . .
350
1
| 3 2 |
| 3 2 |
2 2
+
b a e i
b a
b a
17. Answer (1)
Number of boxes having exactly i balls = number of boxes having at least i balls number of boxes having atleast
(i + 1) balls, (1 i r 1)
Number of boxes having exactly 1 ball = N
1
N
2
Number of boxes having exactly 2 balls = N
2
N
3
........................................................................
Number of boxes having exactly (r 1) balls = N
r 1
N
r
Number of boxes having exactly r balls = N
r
, for a box can hold a maximum of r balls.
Total number of balls = (N
1
N
2
) + 2(N
2
N
3
) + 3(N
3
N
4
) + ......+ (r 1) (N
r 1
N
r
) + r.N
r
.
= N
1
N
2
+ 2N
2
2N
3
+ 3N
3
3N
4
+.....+(r 2)N
r1
+ (r 1)N
r1
(r 1)N
r
+ r N
r
= N
1
+ N
2
+ N
3
+...+ N
r1
+ N
r
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 N
r
contain?
18. Answer (3)
Consider
2006! + 2, 2006! + 3, ......., 2006! + 2006
1
st
number is divisible by 2, 2
nd
by 3,....and so on. Then all the numbers are composite.
51 !
51
., .......... ,
3 !
3
,
2 !
2
+ + + K K K
Thus the number K! + 2, K! + 3,..... K! + 51 are all composite.
19. 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
! 12
1
= a
Thus, (x + 1)P(x) 1 = ) 11 )...( 2 )( 1 (
! 12
1

x x x x
Setting x = 12 in the above relation.
(12 + 1)P(12) 1 =
! 12
1
(12)(11) (10).......1 = 1
13P(12) = 0 P(12) = 0
20. Answer (2)
Set,
3
2
= a a
3
= 2
Now, (1 a + a
2
)
2
= 1 + a
2
+ a
4
2a + 2a
2
2a
3
= 1 + a
2
+ a
3
a 2a + 2a
2
2a
3
= 1 + a
2
+ 2a 2a + 2a
2
4
= 3a
2
3 = 3(a
2
1)
(1 a + a
2
)
3
= (1 a + a
2
)
2
(1 a + a
2
)
= 3(a
2
1) (1 a + a
2
)
= 3(a 1) (a + 1) (a
2
a + 1)
= 3(a 1)(a
3
+ 1)
= 3(a 1) (2 + 1) = 9(a 1) ...(i)
From (i)
3 3 3 3
) 4 2 1 ( ) 1 2 ( 9 + =
Taking cube roots
3 3 3
3 3
9
4
9
2
9
1
1 2 + =
21. Answer (2)
Given , , are the roots of x
3
+ 2x
2
+ 3x + 3 = 0 then we have to form the equation whose roots are
1
,
1
,
1 +

+
Let,
1
,
1 + +
=
x
x
y express x in terms of y
1
=
y
y
x
So that the equation is
0 3
1
3
1
2
1
2 3
= +
y
y
y
y
y
y
y
3
5y
2
+ 6y 3 = 0 ...(i)
Let, =
+

=
+
=
+
1
,
1
,
1
Thus , , are the roots of (i)
= 5, = 6, = = 3
Now use the identity
a
3
+ b
3
+ c
3
3abc = (a + b + c) (a
2
+ b
2
+ c
2
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
22. 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.
a
n + 1
= 3a
n
2a
n1
, n 2 can be recast as
a
n + 1
a
n
= 2a
n
2a
n1
= 2(a
n
a
n1
)
Let b
n
= a
n+1
a
n
, n 1
thus b
n
= 2b
n 1
, n 1
Thus b
n
is a G.P. of common ratio 2
b
n
= 2
n1
b
1
= 2
n1
(a
2
a
1
) = 2
n
(a
1
a
0
)
= 2
n
(32) = 2
n
=
=
=
=
+
2
...... .......... ..........
2
2
1 2
1
1
1
a a
a a
a a
n
n n
n
n n
Adding vertically, a
n + 1
a
1
= 2 + 2
2
+ .... 2
n
2 2
1 2
) 1 2 ( 2
1
=
=
+ n
n
a
n + 1
= 2
n + 1
2 + a
1
= 2
n + 1
2 + 3 = 2
n + 1
+ 1
a
n
= 2
n
+ 1
23. Answer (1)
f(x) = 2x
2
2(2a + 1)x + a(a 1)
Applying the condition
2f(a) < 0, D 0
a (, 3) (0, )

a
a < <
24. Answer (1)
The given equation can be rewritten as
x
2
+ xy = y
2
+ xz x
2
xz = y
2
xy
x(x z) = y(y x) ...(i)
Let d = gcd (x, y), then x = da, y = db with gcd (a, b) = 1
(i) becomes
da(x z) = db(y x)
a(x z) = b(y x)
as (a, b) = 1, we have x z = Kb
and y x = ka for some integer K
But gcd(a, b a) = gcd (a, b) = 1
Thus it follows that (b a) divides K
Let K = n(b a), we obtain d = na
Hence solution becomes x = na
2
, y = nab
z = n(a
2
+ ab b
2
), where n, a, b are arbitrary integers.
25. Answer (1)
Let us calculate the number of numbers whose last digit is x, where x = 1, 2, 3, 4 or 5.
x
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
) 1 10 ( 40
9
1 10
360 ) 10 10 10 1 ( 360
4
4
3 2
=

= + + +
= 4 10
5
40
= 399960
26. 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.
) )( )( )( ( ) )( (
2 2 2 2
d v u d v u d y x d y x dv u dy x + + =
)} )( )}{( )( {( d v u d y x d v u d y x + + =
) )( ( vyd d yu d xv xu vyd d yu d vx ux + + =
} ) ( ) }{( ) ( ) {( d yg vx yvd xu d yu vx yvd ux + =
d uy vx yvd ux
2 2
) ( ) ( =
27. Answer (2)
Let u = x
3
then x
3
(x
3
+ 1) (x
3
+ 2) (x
3
+ 3) = u(u + 1)(u + 2) (u + 3)
= u(u + 3) (u + 1) (u + 2)
= (u
2
+ 3u) (u
2
+ 3u + 2)
= {(u
2
+ 3u + 1) 1} {(u
2
+ 3u + 1) + 1}
= (u
2
+ 3u + 1)
2
1
= (x
6
+ 3x
3
+ 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 x
6
+ 3x
3
+ 1 = 0, i.e., for the real roots of x
6
+ 3x
3
+ 1 = 0.
28. Answer (3)
We are going to introduce you to a powerful technique of counting i.e., recursion.
Let us denote by u
n
the number of n-digit string made up of 0, 1 or 2 and satisfying the condition of the problem.
u
2
, the number of 2-digit string, can be obtained by direct calculation, u
2
= 8, viz., 00, 01, 02, 10, 11, 12, 22, 20.
Let x = x
1
, x
2
,.........x
n
be a sequence belonging to u
n
. We can have two mutually exclusive cases.
(i) If x starts with 2, i.e., x
1
= 2, then each of x
2
, x
3
.......x
n
can be 0 or 2. So there are 2
n1
such sequences. (Recall
that 1 cannot appear to the right of 2).
(ii) If x starts with 0 or 1, i.e., x
1
= 0 or 1, then x
2
, x
3
.....x
n
is a sequence of (n 1) digits satisfying the condition
of the problem. So there are 2u
n1
such sequences.
Thus, u
n
= 2
n1
+ 2u
n1
, n 2
Also, u
2
= 8
u
3
= 2
2
+ 2u
2
= 4 + 2 8 = 20
u
4
= 2
3
+ 2u
3
= 8 + 2 20 = 48
u
5
= 2
4
+ 2u
4
= 16 + 2 48 = 112
u
6
= 2
5
+ 2u
5
= 32 + 2 112 = 256.
29. Answer (1)
Observe that 1 lies between
2 2
2
and
2

+
b
b a
a
b a
We have,
2 2
2
1
2

+
b
b a
a
b a
b
b a b a
b a
a
b a b a
4
) ( ) (
) (
4
) ( ) (
2 2
2
2 2
+

+
b
b a b ab a
a
b a
8
) (
2
2
8
) (
2 2

b
b a
ab
b a
a
b a
8
) (
2 8
) (
2 2

+
b
b a
D
a
b a
8
) (
8
) (
2 2

30. Answer (4)

Let S be the sum of the squares of numbers on the board. Observe that S increases in the first operation
and doesn't decrease in any successive operation.
2 2 2 2
2 2
) (
4
5
2 2
b a b a
a
b
b
a + + =
+
Equality holds only if a = 0 = b.
Thus never can the set of numbers on board coincide with the initial set.
31. Answer (2)
We have,
n n
n
n n n n
4 ) 1 1 (
2
2
....
1
2
0
2
0
2
2
= + =
+ +
<
for n = 5 we have
5
3 252
5
10
> =
m = 4
32. Answer (1)
Check that x = 2 is a solution
Rewrite the equation as
x x x x
+ =
13
14
1
13
12
13
11
13
10
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.
33. Answer (1)
Let 2
x
= u and 3
x
= 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 = 2
x
= 3
x
x = 0 is the only solution.
34. Answer (2)
k k k
k k
1
1 1
2
) 1 ( 2 <
+ +
= +
Using this we get,

= =
= + >
80
1
80
1
16 ) 1 ( 2
1
k k
k k
k
Again,
k k k
k k
1
1
2
) 1 ( 2 >
+
=
Using this we get,

= =
< = + <
80
2
80
1
17 1 80 2 ) 1 ( 2 1
1
k k
k k
k
Thus, 16 < S < 17
[S] = 16
35. Answer (2)

= =
+
=
+
=
n
k
n
k
n
k n k n
n
n k n k n
S
0 0
)! ( ! ) (
! 2
! 2
1
! ) ( )! (
1
Let
=
n
k
k n
n
n
0
2
! 2
1
=
n
k
k
n
n
0
2
! 2
1
=

=
n
n
k
n
n
n
k
2 2
2
1
.
! 2
1
0
+ =
n
n
n
n
2
2
2
1
.
! 2
1 2
,
) ! ( 2
1
! 2
2
2
1 2
n
n
n
+ =

(After simplification)
2
199
100
) ! 100 ( 2
1
! 200
2
+ = S
36. Answer (1)
a
x
x
a
a x =
Taking log
a
, 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.
37. Answer (1)
n n
a a a a N
1
2
1
2
) 1 ( ) 1 ( + + =
b
b
1
+ =
where,
n
a a b
1
2
) 1 ( + =
+ = +

+
+
1
1
1
1 1 1 1 1
m
m
m
m
m
m
b
b
b
b
b
b
b
b
If we assume N to be rational, then we obtain that
m
m
b
b
1
+ is rational for all m N.
But , 2 1 1
1 2 2
a a a a a
b
b
n
n
= + + = + an irrational number.
Hence we have reached a contradiction. Thus N is irrational.
38. Answer (4)
The system of equations just says that
1
7 5 3 1
2
2
2
2
2
2
2
2
=
+
t
w
t
z
t
y
t
x
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
39. Answer (4)
Consider
=
+ + +
1
) ).....( 2 )( 1 (
!
n
n x x x n
x n
we have,
n x n n x n
x
+
=
+
1 1
) (
) )....( 1 (
!
) 1 )....( 1 (
! ) 1 (
) )....( 2 )( 1 (
!
n x x
n
n x x
n
n x x x n
x n
+ +
+ +

=
+ + +
Telescoping this sum to infinity, we get,
1
) )....( 2 )( 1 (
!
=
+ + + n x x x n
x n
x n x x x
n
1
) ).....( 2 )( 1 (
! ) 1 (
=
+ + +

40. Answer (2)
c x b x a x = + + +
x c b x a x = + +
...(i)
c x x c b x a x . 2 + = + +
b c x c a = +
2
) 2 (
Only when a + 2c = 0 and c
2
b = 0, does the equation have infinitely many solutions, substituting
a = 2c and b = c
2
in (i).
x c c x x c b x c x = = +
2
) ( 2
x c c x = | |
For c < 0, this equation has no root, and for c = 0, it has a single solution x
1
= 0.
Let c > 0, we consider the values the unknown x which satisfy the quality 0 x c
2
then
c x
and
therefore x c c x = | | .
Consequently equation is equivalent to

>
2
0
0
c x
c
Thus our equation has infinitely many solutions iff a = 2c, b = c
2
and c > 0 and then all numbers belonging
to [0, c
2
] are its solutions.
41. 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 a
i
s consists of the numbers
from 1 to 169, (for a
i
s are the permutations of the numbers 1, 2, 121), we have among a
i
s also 85 odd
numbers.
Thus both the sets {1, 2, 169} and {a
1
, a
2
, a
169
} have together 170 odd numbers.
These 170 odd numbers are to go into 169 (pigeon holes) factors (a
1
1), (a
2
2), (a
169
169). Hence,
by pigeon-hole principle, some factor say (a
m
m) contains both odd numbers i.e., a
m
and m both are odd.
Consequently (a
m
m) is even and so is the entire product.
42. Answer (2)
As 5 places can be filled by any of the numbers 3, 4 or 5, we have the total number of numbers without
restriction = 3
5
.
Number of 5 digit numbers made up only of 3s or 4s, with each occurring at least once = 2
5
2.
2
5
is the number of ways in which 5 places can be filled with digits 3 or 4 and we subtract 2 to take care
of two numbers that are made up entirely of 3s or 4s (viz., 33333, 44444).
Similarly, the number of numbers made up only of 4s or 5s = 2
5
2 and, the number of numbers made up
only of 3s or 5s = 2
5
2.
We have to subtract from 3
5
, the number of numbers, without restriction, those numbers from which any of
the digits 3, 4 or 5 is missing.
Number of numbers = 3
5
{(2
5
2) + (2
5
2) + (2
5
2)}3
= 243 96 + 3 = 150
(We have subtracted 3 to take case of overcounting. Each of the numbers 33333, 44444 and 55555 have been
counted in the group of 3
5
numbers).
43. 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 xy = k

y
x
A = xy = (x + 2)(y + 2)
= xy + 2y + 2x + 4
= (k + 4) + 2(y + x) (ii)
From A.M. - G.M. theorem
+
+
k k x y y x
x y
2
2
and equality is attained at y = x
y x
etc.
From (ii),
A
min
+ + = k k 4 4
+ + = 4 4 k k
2
) 2 ( + = k
For our case k = 216, = 3, = 2
2 2 2
min
) 6 8 ( ) 6 2 6 6 ( ) 6 2 216 ( = + = + = A
= 64 6 = 384 sq. cm.
44. 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).
45. Answer (1)
Number of passwords that dont use the digit 3 = 4
3
11
2
(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 dont use the letter A = 5
3
10
2
(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 = 4
3
10
2
.
Number of those passwords that dont have both A and 3 in them
= 4
3
11
2
+ 5
3
10
2
4
3
10
2
= 4
3
21 + 5
3
10
2
= 1344 + 12500 = 13844.
46. Answer (2)
x g(x + 1) = (x 3) g(x) (i)
As the above relation holds for all x, we have that x must divide g(x) as x cant divide (x 3) for all x.
(x 1) must divide g(x 1), (changing x to x 1)
But, then from (i)
g(x 1) divides g(x)
(x 1) divides g(x) (ii)
Changing x to x 1 in (ii), (x 2) divides g(x 1)
then, arguing as we did earlier
x 2 must divide g(x) (iii)
Hence from (i), (ii) and (iii)
x, x 1, x 2 must all divide g(x).
g(x) = x(x 1)(x 2)h(x), where h(x) is another function.
Putting in (i)
x(x 1)(x 2)(x 3) h(x 1) = (x 3)(x 2)(x 1) x.h(x)
h(x 1) = h(x)
h(x) must be a constant function.
h(x) = A (say), g(x) = Ax (x 1)(x 2)
g(3) = A(3)(2)(1) 6A = 6 A = 1
g(x) = x(x 1)(x 2)
g(25) = (25)(24)(23) = 13800.
47. Answer (2)
Both m and n factors of 2
3
7
4
13
13
.
So
2 2 2 1 1 1
13 7 2 and 13 7 2
c b a c b a
n m = =
For some non-negative integers a
1
, b
1
, c
1
, a
2
, b
2
, c
2
.
Since 2
3
7
4
13
13
is the least common multiple.
max {a
1
, a
2
} = 3
max {b
1
, b
2
} = 4
max {c
1
, c
2
} = 13
Hence {a
1
a
2
} 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 (b
1
, b
2
) = 4 for {b
1
, b
2
} we have 2 4 + 1 = 9 choices.
Again, since maximum {c
1
, c
2
} = 13, for {c
1
, c
2
} we have 2 13 + 1 = 27 choices.
Hence, the number of ordered pairs (m, n) = 7 9 27 = 1701.
48. Answer (2)
m
3
+ n
3
+ 3mn 1 = 0
m
3
+ n
3
+ (1)
3
3(m)(n)(1) = 0
0 } ) 1 ( ) 1 ( ) {(
2
1
) 1 (
2 2 2
=
+ + + + + n m n m n m
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.
49. Answer (1)
Here, A = 4
125
+ 125
4
= 4.4
124
+ 125
4
= 4.(4
31
)
4
+ 125
4
= 4a
4
+ b
4
, (say) where a = 4
31
, b = 125
Now, b
4
+ 4a
4
= (b
2
+ 2a
2
)
2
4a
2
b
2
= (b
2
+ 2ab + 2a
2
)(b
2
2ab + 2a
2
),
A is composite for A has a factor b
2
+ 2ab + 2a
2
i.e., (125)
2
+ 2.4
31
125 + 2 (4
31
)
2
Also B can be written in the form b
4
+ 4a
4
B = 4
245
+ 245
4
= 4(4
61
)
4
+ (245)
4
Hence B is also composite.
50. 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, 102010111 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 3
n
such numbers. But thats
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).
Hence the number of unordered pairs .
2
1 3
1
2
1 3 +
= +
=
n n
51. 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.
52. Answer (4)
We can write the relation as
x
1
2
+ x
2
2
= y
1
2
+ y
2
2
= c
1
2
where c
2
= 2
Let x
1
= c cos, x
2
= c sin and y
1
= c cos, y
2
= c sin
P = (1 x
1
)(1 y
1
) + (1 x
2
)(1 y
2
)
= (1 c cos)(1 c cos) + (1 c sin)(1 c sin)
= 1 c(cos + cos) + c
2
cos cos + 1 c(sin + sin) + c
2
sin sin
= 2 c{(cos + sin) + (cos + sin)} + c
2
cos( )
2 2 2
) 2 ( 2 2 2 ) cos(
4
sin
4
sin . 2 2 c P c c c c + + + +

+ +

+ =
As 2 = c we have 8 ) 2 2 (
2
= + P
P
max
= 8.
53. Answer (3)
Let
+ + = 4 4 4 4 x
to infinity,
then
x x + = 4 4
(i)
Set x a a x a + = = 4
x a a x + =
2
(x
2
a)
2
= a x
x
4
2ax
2
+ (a
2
a + x) = 0
As an equation x its fourth degree. But the beauty is that it is quadratic in a.
a
2
a(2x
2
+ 1) + (x
4
+ x) = 0
a
2
a(2x
2
+ 1) + x(x + 1)(x
2
x + 1) = 0
a
2
a{(x
2
+ x) + (x
2
x + 1)} + (x
2
+ x)(x
2
x + 1) = 0
a = x
2
+ x or a = x
2
x + 1
x
2
+ x 4 = 0 or x
2
x 3 = 0
2
17 1
= x or
2
13 1
= x
From (i) x 4 and as 2 , quantity positive a + = x a x
2 x 4
The only number satisfying this among the solution is .
2
13 1+
= x
54. Answer (1)
x = ,
2
6 2 ) 1 ( ) 1 (
1 1 1 3 3 3
3
3
3
3
2
2
3
= + + =
+ +
+ +
+
x
x
x
x
x
x
The sum of any three consecutive terms is 6.
2005 = (3) (668) + 1
The sum = 668 6 1 = 4007.
55. Answer (4)
(z + )
3
=
3
z
1
= , z
2
= , z
3
=
2
.
They form an equilateral triangle with side
| | 3
2
3
2
3
| | | ) 1 ( | | |
2 1
=
= = i z z
55a. Answer (1) (IIT-JEE 2009)
3 3
350 + = zz zz
2 2 2 2
| | ( ) | | ( ) 350 + = z z z z
2 2
2
| | ( ) 350 + = z z z
(x
2
+ y
2
) (x
2
y
2
+ 2ixy + x
2
y
2
2ixy) = 350
2(x
2
+ y
2
)(x
2
y
2
) = 350
(x
2
+ y
2
)(x
2
y
2
) = 175 = (3
2
+ 4
2
)(4
2
3
2
)
Which suggests that points (x, y) satisfying the given equation are (4, 3), (4, 3), (4, 3), (4, 3)
y
x
A(4, 3)
(4, 3)
B
C
(4, 3)
D
(4, 3)
O
Required area = AB BC
= 8 6 = 48 sq.units
56. Answer (3)
The centres of the circles are a and c and radii b a a and d c c . The circles cut orthogonally, then
|c a|
2
= (c a) ) ( a c
=
d c c b a a +
d b a c c a + = +
) (
2
1
) Re( d b c a + =
57. Answer (1)
2
2
2
1 3
=

=
+
= i
i i
i
z
i
101
+ z
101
= i
101
(1 +
202
) = i(1 + ) = i
2
(i
101
+ z
101
)
103
= (i
2
)
103
= i
2
= z.
58. Answer (3)
4
1
2
1
2
1
= = OAB
2
1
= OBC
B( ) A i ( )
30
1 1
1
O
( ) i
C
Area =
4
3
2
1
4
1
= +
59. Answer (2)
A is z, B = iz, C = i
2
z, D = i
3
z
The centroid of triangle BCD is
3
) (
3
3 2 z
i i i
z
= + +
.
60. Answer (3)
1
1
+
iz
iz
=
ix y
ix y
iy x i
iy x i
+
+
=
+ +
+ +
) 1 (
) 1 (
) ( 1
) ( 1
= 2 2
) 1 (
) 1 ( ) 1 (
x y
ix y ix y
+ +
+
2
1
1
Re =
+
iz
iz
1 + y
2
+ x
2
= 2[(1 + y)
2
+ x
2
]
x
2
+ y
2
+ 4y + 3 = 0 radius = 1
61. Answer (1)
ABC = OAB + OBC OAC
=
2
1
.1.1.sin60 +
2
1
.1.1.sin 60
2
1
.1.1.sin120
A
i
O
C
B
i
i
(

+

)
=
4
3
62. Answer (2)
Rotation about B gives
z
1
z
2
= (z
3
z
2
)
z
3
z
2
=
2
(z
1
z
2
)
A z ( )
1
B z ( )
2
C z ( )
3
2
3
z
3
=
2
z
1
+ (1
2
) z
2
63. Answer (2)
z
2
= cos2 + isin2
2
z
= cos2 isin2
cos2 =
2 2
2
z z +
64. Answer (4)
(z i) (z
2
+ 2iz 2) = 0 z = i, 1 i, 1 i
Area =
2 | 2 |
1 1 1
1 1 1
1 1 0
2
1
= =

65. Answer (1)
In an ellipse SP + SP = 2a, where S, S are foci, 2a is the major axis and P is the point on the ellipse.
Here foci i and i, 2a > SS
k > 2.
65a. Answer (2, 3) (IIT-JEE 2010)
Given + =
2
cos cos 4sin
2
A
B C
+
=

2
2cos .cos 4sin
2 2 2
B C B C A

=

2
2sin .cos 4sin
2 2 2
A B C A

=

cos 2sin
2 2
B C A
, as sin 0
2

A

=
+

cos
2
2
cos
2
B C
B C
+
=
1 tan .tan
2 2
2
1 tan . tan
2 2
B C
B C
( )( ) ( )( )
1 .
( ) ( )
( )( ) ( )( )
1 .
( ) ( )

+

s a s c s a s b
s s b s s c
s a s c s a s b
s s b s s c
= 2
( )
1
2
1
+
=
s a
s
s a
s
2
2
=
s a
a
+
= 2
b c
a
+ = 2 b c a
and also b + c = 2a
AC + AB = 2BC
AC + AB > BC, which shows that the locus of point A is an ellipse.
66. Answer (2)
In a hyperbola |SP SP| = 2a, 2a < SS
0 < |k| < 2
67. Answer (3)
4
1
30 sin
2
1
= = OAB
4
3
120 sin
2
1
= = OBC
4
1
150 sin
2
1
= = OAC
30
120
B
C
A i
O
4
3
= ABC
68. Answer (3)
3
cis . 2 3 1

= + i
= +
6
sin
6
cos 2 ) 3 1 (
2 / 2 /
n
i
n
i
n n
0
6
sin =
n
n = 6 (integer)
Least value is 6.
69. Answer (2)
z = x + iy
x
2
+ y
2
+ (4 3i) (x + i y) + (4 + 3i ) (x i y) + 5 = 0
x
2
+ y
2
+ 8x + 6y + 5 = 0, a circle of radius =
5 2 5 3 4
2 2
= +
.
70. Answer (1)
Let z = x + iy
|x| + |y| = 8, |x| |y| = k
Applying A.M. G.M.
| | | |
| | | |
2
x y
x y
+

4 k
k 16
71. Answer (2)
AOB = AOC =
If z
1
= re
i
, then
z
2
= re
i
. e
i
and
A z
1
C z
3
B z
2
O
z
3
= re
i
. e
i
z
2
z
3
= r
2
e
2i
= z
1
2
72. Answer (1)
Let PQ be the diameter AB and CD

O
Pz
B z
2
D z
4
A
z
1
C
z
3
zQ
z
1
= ze
i
, z
2
= ze
i
z
3
= ze
i
, z
4
= ze
i
z
1
z
2
= z
3
z
4
73. Answer (1)
OB = OA cos, O C = OA cos 2.
z
2
= (z
1
e
i
) cos
z
3
= (z
1
e
2 i
) cos2
z
2
2
= z
1
2
. e
2 i
. cos
2
= z
1
2
cos
2
.
2 cos
1
3
z
z
O

A
B
C
z
3
z
2
z
1

=
2 cos
cos
2
1 3 2
2
z z
z
or z
2
2
cos 2 = z
3
z
1
cos
2
.
74. Answer (2)
Let B corresponds to z.
Rotation about E, we get
z (6 i ) = [(1 2i ) (6 i )] i
= 1 5i
z = 7 6i
By mid-point formula
D C
B A
E
1 2i
z
6 i
C is 2(6 i ) (1 2i ) = 11
D is 2(6 i ) (7 6i ) = 5 + 4i.
75. Answer (3)
z = re
i
, from triangle inequality, we have,
2
1 1
| | = +
z
z
z
z
2
1

r
r
or 2 r
r
1
2 2r r
2
1 2r
2r r
2
1 (r + 1)
2
2 0 1 2 r
r
2
1 2r (r 1)
2
2 0 1 2 + r
] 1 2 , 1 2 [ + r
] 1 2 , 1 2 [ | | + z
76. Answer (2)
2 2
| 1 | | | + = + z z
) 1 ( ) 1 ( ) ( ) ( + + = + + z z z z
|z|
2
+ ||
2
= ||
2
|z|
2
+ 1
(||
2
1) (|z|
2
1) = 0
|z| = 1 since || 1.
77. Answer (3)
2 2
| 1 | | | + > + z z
) 1 ( ) 1 ( ) ( ) ( + + > + + z z z z
|z|
2
+ ||
2
||
2
|z|
2
1 > 0
(|z|
2
1) (1 ||
2
) > 0
|z|
2
1 < 0 since 1 ||
2
< 0
|z| < 1
78. Answer (3)
i
z
z =
1
z = i, i
2
,
i i
z
z = + = ) (
1 2
2005
2005
79. Answer (4)
( ) ( )

=

=

+ =
6
1
7
2
7
2
6
1
7
2
7
2
sin cos cos sin
r
r r
r
r r
i i i
= i ( +
2
+
3
+
4
+
5
+
6
) ( )
7
2
cis , say
r
=
= i (1) = i
80. Answer (4)
z = a + ib
|z| = 1 a
2
+ b
2
= 1
ib a
ib a
z
z
+ +
+
=
+ 1
1
1
1

2 2
) 1 (
) 1 ( ) 1 (
b a
ib a ib a
+ +
+ +
=
0
) 1 (
1
1
1
Re
2 2
2 2
=
+ +
+
=
b a
b a
z
z
, [since a
2
+ b
2
= 1]
81. Answer (1)
n = 1 i
n
+ i
n
= i +
i
1
= i i = 0
n = 2 i
n
+ i
n
= i
2
+ i
2
= 1 +
1
1
= 2
n = 3 i
3
+ i
3
= i +
i
1
= i + i = 0
n = 4 i
4
+
4
1
i
= 1 + 1 = 2.
After that the values repeat. Hence the number of element is 3.
82. Answer (3)
, ik
i z
i z
=
+
k R
using componendo and dividendo
1
1
+
=
ik
ik
i
z
1
1
+
=
ik
ik
i z
Taking modulus of both sides 1 | 1 | | 1 |
1
1
| | | | = =
+
=
ik
ik
i z
|z| = 1 is the locus a circle.
83. Answer (2)
4
1 1
Re =
4
1
Re =
z z
z
4
1
Re
2 2
=
y x
iy x
4
1
2 2
=
+ y x
x
x
2
+ y
2
= 4x
(x 2)
2
+ y
2
= 2.
The locus is a circle of radius 2.
84. Answer (4)
The locus is a circle with its interior.
OP is tangent to the circle at P.
5
3
25
15
cos = = =
CO
CP

< < =
2
0 0
5
4
sin . Also PO = 20 15 25
2 2
=
C
O

P
25 i
15
25
Now the coordinates of P in the argand plane is 20 (cos + i sin )
=
+
5
4
5
3
20 i
= 12 + 16 i
85. Answer (3)
z
2
=
2
|z| = ||
B A
Also (1, i ) A |1| = |i |
But (1, i ) B 1
2
i
2
86. 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.
Let z = x + iy
Set A corressponds to the region y 1 ...(i)
Set B consists of points lying on the circle, centred at (2, 1) and radius 3, i.e. x
2
+ y
2
4x 2y = 4 ...(ii)
Set C consists of points lying on the x + y =
2
...(iii)
P
y = 1
x
y
2 , 0
(2, 1)
0 , 2
Clearly, there is only one point of intersection of the line 2 = + y x , and circle x
2
+ y
2
4x 2y = 4
86b. Answer (3)
2 2
5 1 i z i z + +
= (x + 1)
2
+ (y 1)
2
+ (x 5)
2
+ (y 1)
2
= 2(x
2
+ y
2
4x 2y) + 28
= 2(4) + 28 ( ) 4 2 4
2 2
= + y x y x
= 36
86c. Answer (4)
( ) 3 2 < + i w
| 2 | | | i w + < 3
5 3 5 3 + < < + w
5 3 5 3 < < w ...(i)
Also, ( ) 3 2 = + i z
5 3 5 3 + + z ...(ii)
3 < |z| |w| +3 < 9
87. Answer (2)
M the midpoint is
2
2 1
z z +
Now the vertices P and Q, i.e. z
p
and z
Q
are given by
z
P, Q
=
+
2 2
2 1
2
2 1
z z
z i
z z
=
+
2 2
1 2 2 1
z z
i
z z
M
B z ( )
2
A z ( )
1
Q
P
=
+
2 2
2 1 2 1
z z
i
z z
= ) (
2
1
) (
2
1
2 1 2 1
z z i z z + + and ) (
2
1
) (
2
1
2 1 2 1
z z i z z +
88. Answer (1)
| | 3 z z +
3
| |
2
x
The circle is having centre origin & radius 1
Area of shaded portion
=
4 [Area of Area of ] OAB OCD

O
C
A
B
3
2
x =
3
2
x =
D
2
1 1 3 1 3
4 . (1) . .
2 3 2 2 2 3 2

= =

89. 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.
90. Answer (4)
Area of shaded region
2
(3)
4 9
4
= =

3 + 3i 3 + 3i

3 3i 3 3i
x = 3 x = 3
real
axis
y = 3
y = 3
Imaginary axis
91 Answer (4)
f(x) is divisible by x
2
+ 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) +
2
h(1) = 0
g(1) = h(1) = 0
92. Answer (4)
Let
1
3 1
3
1

+
=
+
= z
z
z
As |z| = 1 | 1| |1 + 3|
( 1) =
3
1
3 +
The locus of is a circle, the radius being
3
1
3
3
1
1

=
2
1
8
4
3 / 8
3 / 4
= =
93. Answer (2)
3 2
2
=
z
z
This will denote part of the circle.
94. Answer (2)
n
n
n n
z z
z
z z
/ 1
) 1 (
1
1 1
1
) 1 ( = + =
+
= +
n
k
i
n
k
z

+
= +
2
sin
2
cos
1
1 ; k = 0, 1, 2, ........ n 1.
But k = 0, 0
1
=
z
, impossible.
z =
n
k
i
n
k
+
+
2
sin
2
cos 1
1
=
n
k
n
k
n
k
i
n
k

+
2
sin
2
cos 1
2
sin
2
cos 1
2
=

n
k
n
k
i
n
k
2
cos 1 2
2
sin
2
cos 1
=
n
k i
n
k
n
k
n
k
i

cot
2 2
1
sin 2 . 2
cos . sin 2 .
2
1
2
Thus,
2
1
) Re( = z or
2
1
= x , show that the roots of the equation (z + 1)
n
= z
n
lie on the line
2
1
= x .
95. Answer (1)
1 = +
A
B
B
A
A
2
AB + B
2
= 0
2
3
2
4
2 2
Bi B B B B
A

=
+
=
B
i
A

=
2
3 1
= B,
2
B
|A| = |B|
Now A B = B B =
2
B
or A B =
2
B 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.
96. Answer (4)
The least value of PA
2
+ PB
2
+ PC
2
, A, P, C non-collinear occurs at the centroid of the triangle ABC centroid
3 1 5 2 9 3
3
3 3
i i i
Z i
+ +
= = =
P
A
C B
1 i 5 2i
3
Least value = 10
97. 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.
+ + +
+ =
+
zx x
y
yz
y
x
x
z
z
y
y
x
1
1
1 1 1 1
=
+ +
+ + + + +
xyz
xyz
z y x
z y x
1 1 1 1
) (
=
xyz
xyz
x
z
z
y
y
x
1 1 1 1
+ +
+ +
+ +
+
xyz
xyz
1
1 4
3
7
) 1 )( 4 (
3
7
+ + + + =
2
1
= +
xyz
xyz
(xyz)
2
2(xyz) + 1 = 0
(xyz 1)
2
= 0 xyz = 1
98. 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.
So number of three digit numbers =
3
1809
= 603, since each takes three digits to write. And a three digit
number starts with 100.
Number of numbers = one digit numbers + two digit numbers + three digit numbers
= 9 + 90 + 603 = 702.
99. Answer (3)
The greatest power of a prime p in n! is
.......
3 2
+
p
n
p
n
p
n
Number of zeros at the end of n! = greatest power of 5 in n!
=
.......
125 25 5
.......
25 5
+ + + < +
n n n n n
=
4
5
1
1
1
5
.......
25
1
5
1
1
5
n n n
=
+ + +
as
4
n
> 1998 n > 7992
For n = 7995, the number of zeroes at the end
=
3125
7995
625
7995
125
7995
25
7995
5
7995
= 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.
100. Answer (2)
a
3
= a
2
+ a
1
a
4
= a
3
+ a
2
= 2a
2
+ a
1
a
5
= a
4
+ a
3
= 3a
2
+ 2a
1
a
6
= a
5
+ a
4
= 5a
2
+ 3a
1
a
7
= a
6
+ a
5
= 8a
2
+ 5a
1
a
8
= a
7
+ a
6
= 13a
2
+ 8a
1
We are given that 8a
2
+ 5a
1
= 120, a
1
< a
2
Clearly 5 divides a
2
since
8
) 24 ( 5
1
2
a
a

= and a
1
is a positive integer.
a
1
can take values 8 and 16 where a
1
= 8, a
2
= 10.
When a
1
= 16, a
2
= 5 which is not possible since a
2
> a
1
.
a
1
= 8, a
2
= 10.
Hence a
8
= 13a
2
+ 8a
1
= 13(10) + 8(8) = 194.
101. Answer (2)
Let
] ) 1 ( 2 [
2
], ) 1 ( 2 [
2
d n a
n
S d m a
m
S
n m
+ = + =
2
2
] ) 1 ( 2 [
2
] ) 1 ( 2 [
2
n
m
d n a
n
d m a
m
S
S
n
m
=
+
+
=
nd
md
nd d a
md d a
n
m
d n a
d m a
=
+
+
=
+
+
) 2 (
) 2 (
) 1 ( 2
) 1 ( 2
If 2a = d, then in this case the rate can be m
2
and n
2
.
Note that,
36
25
144
100
12
10
2
2
= =
1 2
1 2
2 ) 1 (
2 ) 1 (
) 1 (
) 1 (
=
+
+
=
+
+
=
n
m
a n a
a m a
d n a
d m a
T
T
n
m
57
61
1 2 29
1 2 31
29
31
=

=
T
T
102. Answer (2)
Let S = 1
2
+ 2
2
x + 3
2
x
2
+ 4
2
x
3
+ ....... to ....(1)
xS = 1
2
x + 2
2
x
2
+ 3
2
x
3
+ ...... ....(2)
(1) (2); (1 x)S = 1
2
+ 3x + 5x
2
+ 7x
3
+ ........ ....(3)
x(1 x)S = x + 3x
2
+ 5x
3
+ ....... ....(4)
(3) (4); (1 x)
2
S = 1 + (2x + 2x
2
+ 2x
3
+ ..........)
=
x
x
x
x
+
=
+
1
1
1
2
1
3 3
7
1
1
7
1
1
) x 1 (
x 1
S

+
=
+
=

=
7
1
Set x
=
27
49
103. Answer (4)
=
4 . 3 . 2
1
3 . 2 . 1
1
3
1
4 . 3 . 2 . 1
1
=
5 . 4 . 3
1
4 . 3 . 2
1
3
1
5 . 4 . 3 . 2
1
.................................
.................................
=
12 . 11 . 10
1
11 . 10 . 9
1
3
1
12 . 11 . 10 . 9
1
Adding, vertically
= + + +
12 . 11 . 10
1
3 . 2 . 1
1
3
1
12 . 11 . 10 . 9
1
........
5 . 4 . 3 . 2
1
4 . 3 . 2 . 1
1
=
1320
73
11 20
1
1
6
1
3
1
=

104. Answer (1)
Observed that 100
25
25 = 10
50
25
=
75 9 ......... 999 25 00 ......... 1000
9'S 48 zeroes 50

=
So the sum of its digits = 9 48 + 7 + 5 = 432 + 12 = 444.
105. Answer (3)
We embed the problem in a more general one and look at the expression.
f(h) = h
2
+ (h + 1)
2
+ {h(h + 1)}
2
= h
2
+ h
2
+ 2h + 1 + h
2
(h
2
+ 2h + 1)
= h
4
+ 2h
2
+ h
2
+ 2h + 1 + 2h
3
= (h
2
)
2
+ (h)
2
+ (1)
2
+ 2h
2
h + 2h 1 + 2h
2
1
= (h
2
+ h + 1)
2
= {h(h + 1) + 1}
2
i.e. f(h) = h
2
+ (h + 1)
2
+ {h(h + 1) 1}
2
= {h(h + 1) + 1}
2
Now 40 41 = 1640, 27 28 = 756, 32 33 = 1056, 30 31 = 930
The true equality is
2 2 2
) 33 32 ( 33 32 + + = 32 33 + 1
= 1057.
106. Answer (3)
Let 2
4
+ 2
7
+ 2
n
= m
2
, m being an integer
16 + 128 + 2
n
= m
2
.
2
n
= m
2
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, 2
1
= 2, 2
2
= 4, 2
3
= 8, 2
4
= 16, 2
5
= 32, 2
6
= 64, 2
7
= 128.
We have 2
5
2
3
= 24 and as 2
n
grows rapidly, we cant have a pair other than (2
5
, 2
3
) having a difference of 24.
Consequently m 12 = 8 and m + 12 = 32
m = 20 and 2
n
= 32 8 = 256 = 2
8
n = 8.
There is only one value of n that makes 2
4
+ 2
7
+ 2
n
a perfect square.
107. 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
108. Answer (1)
The divisors will be 2, 6, 10, 30
109. Answer (3)
223355888
1 2 3 4 5 6 7 8 9
number of odd digits = 4
number of even digits = 5
Total number of ways = 60.
110. Answer (4)
n
C
r
+ 2
n
C
r1
+
n
C
r2
=
n
C
r
+
n
C
r 1
+
n
C
r 1
+
n
C
r2
=
n+1
C
r
+
n+1
C
r1
=
n+2
C
r
111. Answer (2)
T
n
=
n
C
3
T
n + 1
T
n
= 21
n+1
C
3

n
C
3
= 21 n = 7
112. Answer (1)
The number of arrangements = 60
! 2 ! 3
! 6
=
The number of arrangements when two N come together =
20
! 3
! 5
=
The number of arrangements when two N do not come together = 40
113. Answer (2)
n+1
C
n 2
n + 1
C
n1
100 n 8
114. Answer (3)
Let the number of sides be n then
n
C
2
n = 44 n = 11
115. Answer (2)
Exponent of 2 in 20! is 18 and is 10! in 8 exponent of 2 in x is 10
116. Answer (3)
The number of ways to painting the cube = 5 3 1 1 1 1 = 15.
117. 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
4
t
2
= 5 9 5 = 225.
118. Answer (4)
The total number of rectangles with odd length and breadth
= (1 + 3 + 5 + 7 + .....+ 2m 1) (1 + 3 + 5 + 7 + .....+ 2n 1)
= m
2
n
2
119. Answer (2)
The number of ways to forming first team = 9 8 = 72
The number of ways to forming second team = 7 6 = 42
Total number of ways 1512
2
) 3024 (
2
42 72
= =
120. Answer (2)

The total number of wrong answers = n.2
0
+ (n 1)2
1
+ (n 2)2
2
+ .....+ 12
n 1
= 2047
n = 11
121. 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
122. Answer (3)
The number of point of intersection =
! 2
) 1 (
2

=
n n
C
n
The number of fresh lines =
8
) 3 )( 2 )( 1 (
2
2
) 1 (

=
n n n n
n C
n n
123. Answer (3)
Total number of handshakes possible =
2n
C
2
This will include n handshakes in which a person shakes hand with her or his spouse
Required number =
2
2
2 ( 1)
n
C n n n =
124 Answer (1)
m =
2
( 1)
2
n
n n
C

=
a
2
=
2
( 1)
2
m
m m
C

=
=
1 ( 1) ( 1)
. 1
2 2 2
n n n n

=
( 1)( 2)( 1)
8
n n n n +
1
4
n
C
+
=
( 1) ( 1)( 2)
24
n n n n +
Required ratio = 1 : 3
125. Answer (1)
The number of ways to select 1
st
station = 10
The number of ways to select 2
nd
station = 7
The total number of ways =
! 3
] 5 2 4 5 [ 10 +
1
2
3
4
5
6
7
8
9
10
= 50
126. Answer (3)
The total number of ways
! 3
1
1
17
18
17
35
17
52
C C C C
=
) ! 3 ( ) ! 17 (
! 52
3
=
127. Answer (1)
The total number of words with no word is repeated =
10
P
5
The total number of words if any letter can be taken any number of times = (10)
5
The total number of required words = (10)
5

10
P
5
= 69760
128. Answer (1)
8! = 2
7
3
2
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.
129. 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 + 3
C
3
130. Answer (1)
Obviously the LCM is got by taking the greater of a
i
and b
i
. Hence choice (1) is correct.
131. 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.
132. Answer (1)
For n = 3, the numbers n, n + 4, n + 14 yield 3, 7, 17 and they are all prime. We claim that for No other
value of n are n, n + 4, n + 14 all prime.
Recall that any prime p 5 can be written in the form of 6K 1, K 1
When n = 6K + 1
n, n + 4, n + 14 = 6K + 1, 6K + 5, 6K + 5, 6K + 15 of which 6K + 15 = 3(2K + 5) is composite.
when n = 6K 1
n, n + 4, n + 14 = 6K 1, 6K + 3, 6K + 13, of which
6K + 3 = 3(2K + 1) is composite.
Hence only for n = 3, the number n, n + 4, n + 14 are all prime.
133. Answer (1)
Rewrite as
= 4
673
+ 673
4
= 44
672
+ 673
4
= 4(4
168
)
4
+ 673
4
= 4a
4
+ b
4
, (say), where a = 4
168
, b = 673.
Observed that 4a
4
+ b
4
can be factorized
4a
4
+ b
4
= (2a
2
+ b
2
)
2
4a
2
b
2
= (2a
2
+ b
2
2ab) (2a
2
+ b
2
+ 2ab)
is composite,
Similarly is composite
+ =
+ =
4 4 232
4 929
929 ) 4 ( 4
929 4
134. Answer (2)
P (GBB or BGB or BBG)
3 2 3 1 2 3 1 2 1 13
. . . . . .
4 4 4 4 4 4 4 4 4 32
x = + + =
135. Answer (4)
Let n = (a
m
a
m1
...a
1
a
0
)
10
where a
0
, a
1
,.....a
m
are digits of positive integer n, be the decimal representation of
n.
n S
n
= (a
m
10
m
+ a
m1
10
m1
+........+ a
1
10 + a
0
) (a
m
+ a
m1
+ ........ + a
1
+ a
0
)
= a
m
(10
m
1) + a
m 1
(10
m 1
1) + .........+ a
1
(10 1) ...(i)
As every number of the form 10
K
1 is divisible by 10 1 = 9,
n S
n
is divisible by 9.
But n S
n
= 1234
which is not divisible by 9.
Hence no such n exists.
136. Answer (4)
10
999
= (2 5)
999
= 2
999
5
999
has been written in prime factorisation form.
Number of divisors of 10
999
is (999 + 1) (999 + 1) = 1000
2
.
Again, 10
998
= 2
998
5
998
So, number of divisors of 10
998
= (998 + 1)(998 + 1)
= 999
2
All the divisors of 10
998
also divide 10
999
Hence the number of divisors that divide 10
999
but not 10
998
= 1000
2
999
2
= (1000 999) (1000 + 999) = 1999.
137. Answer (4)
Let 1 2 and 1 2
21
2
35
2
+ = + = b a
( )
22 13 213
235 2 2 222
2 2 1 2 1 2 1 a

= = =
13
22
2
2 , 1 2 =
= K
K
But 1 2
22
2
K
is divisible by , 1 2
22
2
So we can write N m m a
= , 1 2 2
22
2
m m
=

1 2 1 2
2
21
2
21
2 2
bm m . 1 2 1 2 1 2
21
2
21
2
21
2
=
a 2 = bl, where

= 1 2
21
2
m l
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.
138. Answer (3)
2
2
1 1
4
( 1) ( 1)
lim
2
n n
i i
n
i i
p
n
= =

+ +

=

2
4
( 2)( 1) ( 1)( 2)(2 3)
1
2 6
lim
2
n
n n n n n
n
+ + + + +

=

4 3
4
1
.... decreasing powers of
4
lim
2
n
n n n
n

+ +

=

1
8
= .
139. Answer (1)
We have,
2
2n
= 2(
2n
C
0
+
2n
C
1
+ .......+
2n
C
n 1
) +
2n
C
n
+
2n
C
n

2n
C
n
.
)! 1 ( !
)! 1 2 (
2 . ..........
1 2
1
2
1
2
0
2
+ = + + +

n n
n
C C C
n n n n
140. Answer (3)
Set x = 1, ,
2
and then add the results.
141. Answer (3)
We have,

=
= + = +
n
r
r
r
n
r
n n r
r
n n
x C r x n x C x
0
1
1
1
) 1 ( ) 1 (

=
= +
n
r
r
r
n n
x C r x x n
1
1
. ) 1 )( (
Differentiating it w.r.t. x, we get,
1
1
2 2 1
) 1 ( ) 1 ( ) 1 (

=

= + + +
r
r
n
n
r
n n
x C r x x n n x n
Set x = 1 to get,
r
2
C
r
= n(n + 1)2
n 2
142. Answer (1)
We have,
(1 x
2
)
n
= C
0
C
1
x
2
+ C
2
x
4
C
3
x
6
+ C
4
x
8
...........+ (1)
n
C
n
x
2n
.
Multiply both sides by x and then differentiate w.r.t. x.
Set x = 1 to get the desired result.
143. Answer (1)
Differentiate the determinant w.r.t. x and put x = 0.
144. Answer (3)
We have,
(x
2
x 2)
5
= [2 + x (1 x)]
5
expand it and then equate the coefficient of x
5
.
145. Answer (2)
According to the question ( 1)
35
= (1 )
35
= 1
146. Answer (1)

= = = = =
= =
= =
n
r
n
r
n
r
n
r r
n
r
n
r
n
r n
n
n
r r
n
a
C
n
C
r
C
n
C
r n
C
r
a
0 0 0 0 0
.
1

=
=
n
r r
n
n
a
C
0
2 1
147. Answer (3)
Given
( )
1 2
1 2
+
+ =
n
R
Let
( )
1 2
1 2
+
=
n
F
RF = 1 ....(i)
Next,
( ) ( )
1 2 1 2
1 2 1 2
+ +
+ =
n n
F R
= an even number = 2m (say)
[R] + f F = 2m
f F must be an integer
Clearly f F = 0 F = f .....(ii)
Now f
f
f
F
f R R = = =
1 1
] [
148. Answer (4)
Greatest coefficient in
3 3 3 4
15
) ! 4 ( ! 3
! 15
) ! 4 ( ) ! 3 (
! 15
) ( = = + + +

t z y x
149. Answer (2)
We have
<
+ + + + + =
n j i
n n j i
C C C C C C C C C C C C
0
2
1
2
2 1
2
0
2
2 0
2
1 0
2
) .....( ) ( ) ( ..... ) ( ) ( ) (
+......+ (C
n 1
C
n
)
2
<
+ + + =
n j i
j i n
C C C C C C n
0
2 2
2
2
1
2
0
2 ) ...... (
2 2 2
2 .
n n n
n n
n C C = +
= (n + 1)
2n
C
n
2
2n
150. Answer (3)
We have
(1 + x)
n
1 =
n
C
1
x +
n
C
2
x
2
+
n
C
3
x
3
+.....+
n
C
n
x
n
.
The n
th
root of unity are given by
. 1 ,......., 3 , 2 , 1 , 0 ,
2
=
n K e
n
i K
Put x = any one of the non real complex n
th
root.
151. Answer (1)
We have,
3 1 2 4
10 10 10 10 10
1 2 3 4
10!
{ ( ) ( )} .
! ! ! !
n n n n
xy z t zt x y x y z t x y z t
n n n n
+ + + =

Required coefficient of . 12600
! 4 ! 3 ! 2 ! 1
! 10
9 8 7 6
= = t z y x
152. Answer (1)
Equate the coefficients of like terms in the expansion.
153. Answer (4)
We have,
10
2
1
3
1
10
2
1
3
1
3
2
1 1
1
1
1
+ =
+
+

x x
x x
x
x x
x

10
2
1
3
1
=

x x
Required independent term =
10
C
4
= 210
154. Answer (2)
We have,
n
C
1
a
n1
b = 240,
n
C
2
a
n 2
b
2
= 720,
n
C
3
a
n 3
b
3
= 1080.
To find n eliminate a & b .
155. Answer (1)
We have
3 2 1
10 3 6
3 6 2
1 2 3
10!
( 2 3 5) 2 3 5
! ! !
n n n
n n n
+ + =
156. Answer (2)

,
2
are roots are
1
1 x
x
+ =
a = 1, b = 7
a b = 1 7 = 8.
157. Answer (2)
n
n
n n n n n n
n
n
C
n
C
n
C
n
C
n
C C a
1
..........
1 1 1 1
4
4
3
3
2
2 1 0
+ + + + + + =
+ +
+ + =
n
n
n n n n n n
1
1 ......
2
1
1
1
!
1
.....
2
1
1
1
! 3
1 1
1
! 2
1
1 1
+
+ +
+
+
+
+ + =
+
1
1 ......
1
2
1
1
1
1
)! 1 (
1
....
1
2
1
1
1
1
! 3
1
1
1
1
! 2
1
1 1
1
n
n
n n n n n n
a
n
Clearly, a
n + 1
> a
n
, n 2
158. Answer (2)
We have, (1 + x + x
2
)
n
= a
0
+ a
1
x + a
2
x
2
+ a
3
x
3
+ ...... + a
2n
x
2n
.
Let us put x = i
i
n
= (a
0
a
2
+ a
4
a
6
+.....) + i(a
1
a
3
+ a
5
a
7
+ .....)
n
i
=
2
sin
2
cos
Equate real & imaging parts and then divide.
159. Answer (3)
We have
) 1 ( 3
) 1 ( .........
3 . 4 3 . 3 3 . 2 3 . 1
3 2 1 0
+
+ + +
n
C C C C C
n n
+
+ + + =
1
) 1 ( . ..........
4 3 2 3
1
3 2 1
0
n
C C C C
C
n n
Now, (1 x)
n
= C
0
C
1
x + C
2
x
2
C
3
x
3
+....+ C
n
(1)
n
x
n
.
Integrate it within limits 0 to 1 we get,
1
1
1
) 1 .......(
4 3 2
3 2 1
0
+
=
+
+ +
n n
C C C C
C
n n
160. Answer (2)
Equate the coefficients of x
n + 1
from both sides of
( )
n
n
n n n
n
n n
n
x C x C x C x C
n
x C x
C
x
C x C x
n
x
+ + + +
+
+ + + + = +
+
+

+ +
.....
1
......
3 2
) 1 .(
1
) 1 (
2
2
1
1 0
1 3
2
2
1 0
1
161. Answer (3)
We have,
1
) (
)! ( !
!
)! 1 ( )! 1 (
!
1
+
+
=
+
K
K n
K n K
n
K n K
n
C
C
K
n
K
n
Now,
(C
0
+ C
1
) (C
1
+ C
2
) + (C
2
+ C
3
).......(C
n1
+ C
n
)
+ =
1 2
3
1
2
0
1
1 3 2 1 0
1 ..... 1 1 1 .......
n
n
n
C
C
C
C
C
C
C
C
C C C C C
+ =

n
n n n
C C C C C
n
1
1 .........
3
2
1
2
1
1
1
1 .....
1 3 2 1 0
!
) 1 (
.....
1 3 2 1 0
n
n
C C C C C
n
n
+
=

162. Answer (2)
Set x = y = z = t = 0
163. Answer (3)
Expand the expression.
164. Answer (2)
Use the well known inequality
n n
n
n
n
> >
3
!
2
for n 6.
165. Answer (1)

< <

+
n j i j
n
i
n
n j i j
n
i
n
C
j n
C
i n
C
j
C
i
0 0
2
2
0
K n
C
j
C
i
n j i j
n
i
n
=
+

<
166. Answer (1)
Expand the expression.
167. Answer (2)
Here K
th
term
t
K
= (K
2
+ K + 1)K!
= [(K + 1)
2
K] K!
= (K + 1)(K + 1)! KK!
Putting K = 0, 1, 2, 3, ...... n 1, n is succession and then add the results.
Tr(A) = 2a will be divisible by p if and only if a = 0.
We want to find all matrices
a b
c a

with a = 1, 2, ....., p 1 for which a
2
bc 0 (mod p).
There are exactly p 1 ordered pairs (b, c) for any value of a.
Required number is (p 1)
2
168. Answer (1)
We have
(1 + x)
n
= C
0
+ C
1
x + C
2
x
2
+ C
3
x
3
+ ....+ C
n
x
n
.
x(1 + x)
n
= C
0
x + C
1
x
2
+ C
2
x
3
+ C
3
x
4
+ ...... + C
n
x
n + 1
Differentiating it w.r.t x we get,
(1 + x)
n
+ n(1 + x)
n 1
x = C
0
+ 2C
1
x + 3C
2
x
2
+ 4C
3
x
3
+ ......+(n + 1)C
n
x
n
.
Also, (1 + x)
n
= C
0
x
n
+ C
1
x
n1
+ C
2
x
n2
+ ..... + C
n 1
x + C
n
.
(1 + x)
2n
+ n(1 + x)
2n1
.x = {C
0
+ 2C
1
x + 3C
2
x
2
+ 4C
3
x
3
+....(4 + 1)C
4
x
n
} {C
0
x
n
+ C
1
x
n1
+ C
2
x
n2
+ ....+ C
n1
x + C
n
}.
Equating the coefficient of x
n
from both sides we get
1
1 2 2 2 2
2
2
1
2
0
) 1 ( 3 2

+ = + + + +
n
n
n
n
n
C n C C n C C C
169. Answer (2)
Use the result .
1
1
=
r
n
r
n
C
r
n
C
170. Answer (2)
E = {3, 6, 7, 9, 12, 14, 15, 18}
n(E) = 8, n(S) = 20
5
2
) ( = E P
171. Answer (3)
Let P
r
denotes the probability that number greater than 4 appears first time at r
th
trial. Then P(E) = P
2
+ P
4
+ P
6
+ P
8
+ ..................
3
1
6
4
1
=
r
r
P
5
2
5
9
9
2
.......
9
4
9
4
1
3
1
3
2
) (
2
= =
+ + = E P
172. 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
n
S n
) 2 (
) (

=
173. Answer (3)
8 . 0 ) ( , ) ( , 7 . 0 ) ( = = = B A P p B P A P
P(A B) = P(A) + P(B) P(A)P(B)
0.8 = 0.3 + (1 p) (0.3)(1 p)
0.5 = 1 p 0.3 + 0.3p = 0.7 0.7p
7
2
= p
174. Answer (2)
1 1 1 1 1 11
( ) . .1 .
3 2 3 3 3 18
P H = + + =
1 1 1 2 7
( ) . .
3 2 3 3 18
P T = + =
1
3
1
3
1
3
1
2
1
2
H
T A
B
C
H
T
1
0
H
T
1
3
2
3
1 2
.
4
3 3
7 7
18
C
P
T

= =

1 1
.
3
3 2
11 11
18
A
P
H

= =

175. Answer (1)
Suppose stations are on linear path

s
1
s
2
s
10
Number of ways of selection =
10 4 + 1
C
3
=
7
C
3
= 35
Pairs of following stations are on circular path those are not counted
s
1
s
2
s
3
s
4
s
5
s
6
s
7
s
8
s
9
s
10
1 10 3 5 4 6 5 7 6 8
3 6 4 7 5 8
3 7 4 8
3 8
, s s s s s s s s s s
s s s s s s
s s s s
s s
Number of ways of selection = 35 10 = 25.
176. Answer (2)
n(E) =
4
C
1
13
C
8
39
C
5
n(S) =
52
C
13
13
52
5
39
8
13
) 4 (
) (
C
C C
E P

=
177. Answer (3)
Either all 5 are safe or 4 out of 5 are safe.
Probability that all 5 all safe =
5
5
4
Probability that four are safe

4 4
1
5
5
4
5
4
5
1
= C
5
9
5
4
) (
4

= E P
178. Answer (2)
P(no one among A
1
, A
2
,... A
n
dies within a year) = (1 m)
n
P(atleast one among A
1
, A
2
,... A
n

dies within the year
= 1 (1 m)
n
P(A dies within a year and is first to die) =
1
[1 (1 ) ]
n
m
n

179. Answer (1)
n(E) = 2
n(S) = 11
P(E) =
11
2
S = {(4,1), (4, 2), (4, 3), (4, 4), (4, 5), (4, 6); (6, 4), (5, 4), (3, 4), (2, 4), (1, 4)}
E = {(4, 6), (6, 4)}
180. Answer (2)
) 1 (
) (
1
1
) (
+
=
+
=
i
i
E P
i
E P
i i
Probability that No event occurs
1
1
) ( ).... ( ) ( )) ( (
2 1
+
= =
n
E P E P E P E P
n
1
) (
+
=
n
n
E P
181. Answer (4)
Required probability = 1 P(A B) = P(AB) + P(A B) + P(AB)
182. 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 =
3n
C
3
The number of favourable ways = 3.
n
C
3
+
n
C
1
.
n
C
1
.
n
C
1
3 2
3 3 2
2
n n n +
=
The desired probability
3 2
3 3 2
(3 1)(3 2)
n n n
n n n
+
=

2
3 3 2
(3 1) (3 2)
n n
n n
+
=

183. Answer (2)
The last two digits must be divisible by 4.
n(S) = 9!
n(E) = 2(8)!
9
2
) ( = E P
184. Answer (2)
The probability that the question is not solved
4
1
4
3
3
2
2
1
) ( ( = = E P
4
3
4
1
1 ) ( = = E P
185. Answer (1)
B A S B P A P = = ); (
3
1
) (
and P(A B) = 0
P(S) = P(A) + P(B) 0 = 4P(A) = 1
4
1
) ( = A P
186. Answer (1)
Number of ways they sit together = 2(n 2)!
Number of ways they do not sit together = (n 1)! 2(n 2)! = (n 2)! (n 3)
187. Answer (4)
n(E
1
) = The number divisible by 6 = 15
n(E
2
) = The number divisible by 8 = 11
n(E
1
E
2
) = 3
.
90
23
) ( = E P
188. Answer (4)
The probability that he did not miss a test =
16
9
4
3
4
3
=
The probability that he missed atleast one test =
16
7
189. Answer (3)
Let the radius of the chord be 6r, then
2r length of chord () 5r
The maximum length = 12r and the minimum length = 0
4
1
0 12
2 5
) ( =
=
r
r r
E P
190. Answer (3)
P
r
= odd number come r times
1 2
1 2
1 2
1 2
2
1
+
+
+
+

=
n
i
n
i
C P
=
+
=
n
i
i
P
0
1 2
2
1
191. Answer (3)
P(A) = 0.59, P(B) = 0.3, P(A B) = 0.21
P(A B) = 0.59 + 0.3 0.21 = 0.68
P(A B) = 1 P(A B) = 0.32
192. Answer (4)
The probability that doublets never come =
3
6
5
The probability that doublets come at least once =

216
91
216
125
1 =
193. Answer (1)
The probability that atleast 4 will arrive safely = the probability that all 5 are safe + the probability that exactly
4 are safe.
92 . 0
10
9
10
9
4 5

=
194. 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
required probability =
.
625
16
5
2
4
=
195. Answer (4)

P(A) = 0.3, P(B) = 0.4, P(A B
C
) = 0.5
P(A) = 0.7, P(B
C
) = 0.6
P(A B
C
) = 0.7 + 0.6 0.5 = 0.8
4
3
) (
) (
) (
) (
=
C
C
C
C C
C
C
B A P
B P
B A P
B A B P
B A
B
P
25 . 0
4
1
1 = =
C
C
C
B A
B
P
B A
B
P
196. Answer (3)
210
1 2 3 4
7 8 9 10
) ( =

= A n
197. Answer (1)
x n x n nx
x n x n nx
a a
) 2 sin( ) 1 sin( ) sin(
) 2 cos( ) 1 cos( ) cos(
1
2
+ +
+ + =
= a
2
[sinx]a[sin2x] + [sinx]
= sinx(a
2
2acosx + 1)
198. Answer (1)
If A is an involutary matrix then A
2
= I and AA
1
= A
1
A = I A
1
= A
A
A
2
2
1
=

199. Answer (4)
c c
b b
a
c
b
a
+
= =
+
+
+
1 0
1
1 0
0
1 1 1
1 1 1
1 1 1
a[b + bc + c] + [bc] = 0
1
1 1 1
= + + = + +
c b a
abc ca bc ab
200. Answer (1)
A
T
= A and B
T
= B
(ABA)
T
= A
T
B
T
A
T
= ABA
201. Answer (2)
B = A
1
BA
Multiplying both sides by A
AB = AA
1
BA
AB = IBA
AB = BA
AB + BA = 0
(A + B)
2
= A
2
+ B
2
+ AB + BA
= A
2
+ B
2
202. Answer (3)
The given system has non-trivial solution then
0 1 1 0
1 1
1 1
1 1
= + + = b c a abc
c
b
a
abc ab + ab a + (1 c) + (1 b) = 0
ab(1 c) a(1 b) + (1 b) + (1 c) = 0 (1 c) (1 ab) + (1 b) (1 a) = 0
1
1
1
1
1
1
1
=
+
c b a
203. Answer (3)
Order of A = 3 3, order of A
T
= 3 3
Order of B = 3 2, order of B
T
= 2 3
Order of C = 3 1, order of C
T
= 1 3
Out of these four only three are defined.
204. Answer (1)
=
1 0
1
. ..........
1 0
3 1
1 0
2 1
1 0
1
3 2
na
A
a
A
a
A
a
A
n
205. Answer (3)
Clearly, (1), (2) and (4) are correct.
206. Answer (4)
=
d c
b a
A
and A
2
(a + d)A + K = 0
bc ad K K
a c
b d
A = = +
| | 0
207. Answer (2)
) ( or ) (
cos sin cos
sin cos sin
2 cos ) sin( ) cos(
=

+ +
g f
f() = 0 but g() 0
independent of .
208. Answer (1)
1 1 3
1 1 2
1 1 1
0
4 3
3 2
2 1
+
+
+
= =
+ + +
+ + +
+ + +
r a
q a
p a
r a a a
q a a a
p a a a
q p r q
r a
r q
q p
= =
+

0
1 1 3
0 1
0 1
209. Answer (1)
Let A be a square matrix such that AA
T
= I then A is called an orthogonal matrix.

2 6 3
6 3 2
3 2 6
7
1
is an orthogonal matrix.
210. Answer (3)
If A is idempotent then A
2
= A.
211. Answer (3)
Matrix A is called nilpotent if A
K
= 0 and A
K1
0.
212. Answer (3)

=
cos sin
sin cos
A
A AA
T

=
1 0
0 1
is orthogonal matrix.
213. Answer (3)
3 2
1 4
2 2
x
A y
z

=

, xyz = 60 and 8x + 4y + 3z = 20
|A| = 68
(adj A)A = A(adj A) = |A|I
214. Answer (4)
For non-trivial solutions
0
cos 1
sin cos
1 cos sin
=
+

+
0
cos 1 1 2
sin sin cos
1 ) cos (sin 0
0
cos 1
sin cos
1 ) cos (sin cos sin
=
+ +

+
=
+

+ +
2
) 1 2 ( 0 cos

+ = = n
, n I and R
Given equation can be written as
cos3 cos3
sin3 0 x
y z

=
...(i)
2cos3 2sin3
sin3 0 x
y z

=
...(ii)
2 1
sin3 cos3 (cos3 sin3 ) 0 x
y z
+ =
...(iii)
Equations (ii) and (iii) imply
2sin3 = cos3 + sin3
sin3 = cos3

5 9
tan3 1 3 , ,
4 4 4

= =
or
5 9
, ,
12 12 12

=
215. Answer (3)
A
2
+ A + 2I = 0 can be written (A
2
+ A) = 2I
. ) (
2
1
I I A A =
+
Thus A is invertible and inverse of A is ). (
2
1
I A +
216. Answer (2)
0 cos sin
cos 2 sin 2 2 sin
sin 2 2 sin cos 2
2
2

=
= 2cos
2
[2cos
2
] + sin2 [2cossin] + 2sin [2sincos
2
+ sin
3
]
= 4cos
4
+ sin
2
2 + 4sin
2
0
217. Answer (2)
|A I |= 0 det.
0 6 ) 2 )( 1 ( 0
2 2
3 1
= =

2
3 4 = 0
218. Answer (1)
2
( 1)
| adj (adj ) | | |
n
A A

= = (14)
4
218a. Answer (1, 4) (IIT-JEE 2012)
1 4 4
adj 2 1 7
1 1 3
P

=

|adj P| = 1(3 7) 4(6 7) + 4(2 1)
= 4 + 4 + 4 = 4
|adj P| = |P|
2
|P|
2
= 4
|P| = 2
219. Answer (2)
A
2r 1
= (A
2r1
)
T
(A
2r 1
)
2r 1
= [(A
2r 1
)
2r 1
]
T
(A
2r 1
)
2r 1
skew-symmetric (2r 1)(A
2r 1
)
2r 1
is skew-symmetric
B is a skew-symmetric.
220. Answer (1)
Use the definition of orthogonal matrix.
AA
T
= I for orthogonal matrix.
221. Answer (3)
Expand along any row/column and the result is straight.
222. Answer (1)
Let + = x, + = y and + = z, then the determinant reduces to

2 1
2 1
2 1
2
2
2
z z
y y
x x
which can be written as a sum of two determinants, one of which vanishes. The surviving one can then be
evaluated with ease.
223. Answer (1)
Apply first R
2
R
2
R
1
and R
3
R
3
R
1
to create two zeros in the first column and then expand along
first column.
224. Answer (4)
1 2 3 1 1 1
1 2 3 2 2 2
1 2 3 3 3 3
l l l l m n
m m m l m n
n n n l m n
= =
2 2 2
1 1 1 1 2 1 2 1 2 1 3 1 3 1 3
2 2 2 2
2 1 2 1 2 1 2 2 2 2 3 2 3 2 3
2 2 2
3 1 3 1 3 1 3 2 3 2 3 2 3 3 3
l m n l l m m n n l l m m n n
l l m m n n l m n l l m m n n
l l m m n n l l m m n n l m n
+ + + + + +
= + + + + + +
+ + + + + +

1 0 0
0 1 0 1
0 0 1
= =
= 1

Adfda PDF

Enviado por

Dados do documento

Título original

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

Adfda PDF

Enviado por

Direitos autorais:

Formatos disponíveis

Aakash Educational Services Ltd. Regd. Office: Aakash Tower, Plot No.-4, Sector-11, Dwarka, New Delhi-75 Ph.

30. Answer (4)

4 [Area of Area of ] OAB OCD

120. Answer (2)

156. Answer (2)

Probability that four are safe

The probability that doublets come at least once =

195. Answer (4)

Você também pode gostar