Professional Documents
Culture Documents
Solutions AMA-1B (Algebra)
Solutions AMA-1B (Algebra)
SOLUTIONS
illuminati - 2019
Advanced Mathematics Assignment-1B | Algebra
Section 1 Single Correct Answer Type
1 1.3.5...... 2n 1 2n 1
1.(B) Sn 2 S 1
2 2.4.6........... 2n 2n 2
2.(A)
n n n n
4. (A) r 1 P 1 r P 1 P 1
r P P 1C2 r P 1 ....... 1
r 1 r 1 r 1 r 1
1
a0
P 1
6.(A) For the given condition to be satisfied the vale of k must lie between the slopes of line OA and OB
for slope of line OA
( x 2 10 x 9) kx must have equal roots y
B
(k 10) 2 36 0 (k 10) 2 36 0
A
k 4, 16 k4
x
For slope of OB O 1 9
A(z)
B( z )
10.(D)
11.(A) Clearly DOB = COD = A
z eiA and zeiA z 2 1
z 1 (As A and D are on opposite side of BC).
(1, –1)
(–2, 0)
1 1 1
18.(D) S1 S2
2 k 1 6k 12 6k 12
1 1 1 1
2 S1 S2 1 2
2
2
........ ..........(1)
1 5 7 112
2 1 1 1
Let 2 2 2 ....... ..........(2)
6 1 2 3
1 1
2
2 2 ....... ..........(3)
2 2 4
1 1
2
2 2 ....... ..........(4)
3 3 6
1
2
2 ....... ..........(5)
6 6
Now, (2) – { (4) – (5) + (3)} gives
2
2 S1 S2 1
3
1
19.(B) 1 < 2 2 cos x <.
cos 1 x
1 1
Hence 2 should lie between the roots of t 2 a t a 2 0 where t 2 cos x .
2
a 2 2a 3 0 a ( , 3] [1, )
c
20.(A) Multiplying the given equation by , we get
a3
b2c 2 b2c
x2 xc0
a3 a2
2
bc bc bc
a 2 x b 2 x c 0 x ,
a a a2
1 1
( ) x , x , .
( ) ( )
m
23.(C) let coefficient of y m in e xy e y 1
= coefficient of y m in e xy emy mC1e m1 y .... 1 .m Cm
m
m
m xy
y y2
Coefficient of y in e 1 .... 1
1! 2!
e x m y
mC1e
y m x 1 m
..... 1 mCm .e xy
x m m x m 1m m
m
Cm . x m
1 m C1. ........ 1
m! m! m!
m m
m! x m mC1. x m 1
m m
mC2 x m 2 ....... 1 .m Cm
(where 3 499 are the number of solutions when exactly two boxes have same number of balls and
there is only one solution when each box have same number of balls).
n
Now, n such solutions for distinct boxes will correspond to solutions if boxes are identical.
6
49002
Hence total number of solutions when boxes are identical (when each box have different
6
number of balls) + 500 (at least two box have same number of balls)
83667.
25.(D)
26.(A) Let there are r seats between A and B, p seats between B and
C and 2n r p seats between A and C.
Total number of ways of seating arrangements when there is no
restriction 2n !
Now we count the cases when two particular persons sit together.
Number of ways in which two persons sit together between A
and B r 1 2
Number of ways in which two persons sit together between B and
C p 1 2 and between
A and C these ways are 2n r p 1 2 so total number of ways of their sitting together
2n r p 1 r 1 p 1 2 2n 3 2
With each of such cases, remaining persons can sit in 2n 2 ! Ways
So total number of cases 2n 3 2. 2n 2 !
The number of ways in which two particular persons does not sit together
2n ! 2 2n 3 2n 2 ! 4n 2 6n 6 2n 2 !
27.(A) kx y z w kr
0 x r , 0 y kr , 0 z kr , 0 w kr
y z w k r x
Now taking x p, 0 pr
kr p 2
Then y z w k r p has C2 number of solutions.
Hence total solutions of equation
r
k (r p)2 C2
(kr 2 kp )(kr 1 kp ) ( r 1)
2
12
2k 2 r 2 k 2 r 9kr 12 .
p 0
28.(B) The prime digits are 2, 3, 5 and 7. As sum of two digits is also prime, this can be happen with 2, 3
and 2, 5 only. So the 2n digit number is comprising only these (2, 3, 5) digits and 2 occurs at every
alternate place.
Now,
CaseI:
The number starts with ‘2’
2 2 2 2 2
3 or 5 3 or 5 3 or 5 3 or 5 (two ways)
So no of numbers in this case 2 2 2.........n times 2n
Case II:
The number starts with 3 or 5
2 2 2
(two ways) 3 or 5 3 or 5 3 or 5 3 or 5
In this case also, number of numbers 2n so total number of such numbers
2 2 n 2 n 1.
n 1 k 1 k n 1 k 1 n 1
29.(A)
i 1
C j iC j
k 1
2
C j 1C j k 1
2
k 0 j 1 i 1 k 0 j 1 k 0
n 1 n 1
2k 1 2 1 2 2n 2 1 2 n 2 2n3 2n 6.
k 0 k 0
m
30.(A) Cn is the coefficient of x n in the binomial expansion of
(1 x ) m
1 x m . Hence, for 1,
2
m m 1
Cn Cn
2
……… to the coefficient of x n in
2 2
m
(1 x) (1 x)m1 (1 x)m 2
……… to .
2 22 23
(1 x ) m
2 (1 x ) m
= The coefficient x n in
1 x 1 x
1
2
= the coefficient of x n in
1 x m ( 1 x x 2 x 3 ……………to )
n
31.(B) We have, 1 px x 2 1 a1 x a2 x 2 ............ a2 n x 2 n
Differentiate with respect to x, we get
n p 2 x 1 a2 x a2 x 2 ...... a2 n x 2 n 1 px x 2
a1 2a2 x 3a3 x 2 ...... r 1 ar 1x r 1 rar x r 1 r 1 ar 1x r
Equating the coefficient of xr , we get
nPar 2nar 1 r 1 ar 1 prar r 1 ar 1
npar prar r 1 ar 1 r 1 ar 1 2nar 1
np pr ar r 1 alr 1 r 1 2n ar 1
Hence, option (B) is correct
n
32.(C) We have, 1 px x 2 1 a1 x a2 x 2 a3 x 3 ..... a2n x 2n
On replacing x by x 4 , we get
1 px4 x8
n
1 a1 x 4 a2 x8 a3 x12 ...... a2n x8n
1 px4 x8
n
1
3
a1 x a2 x5 a3 x 9 ...... a2n x8n 3
x x3
[on differentiate w.r.t x, we get]
n 1 n
nx 3 4 px 3 8 x 7 1 px 4 x8 3x 2 1 px 4 x 8
x6
3
4
a1 5a2 x 4 9 a3 x 8 ..... 8n 3 a 2 n x 8n 4
x
Put x 1 both side, we get
n 1 n
n 4 p 8 2 p 3 2 p 3 a1 5a2 9a3 ..... 8n 3 a2n
n
33.(D) We have, 1 px x 2 1 a1 x a2 x 2 a3 x 3 ...... a2n x 2n
On replacing x by x 2 , we get
1 px2 x4
n
1 a1 x 2 a2 x 4 a3 x 6 ...... a2n x 4n
On dividing by x, we get
1 px2 x4
n
1
a1 x a2 x 3 a3 x 5 ..... a2 n x 4 n 1
x x
On differentiating w.r.t. to x. we get
n 1 n
nx 2 px 4 x 3 1 px 2 x 4 1 px 2 x 4
x2
1
a1 3a2 x 2 5a3 x 4 .... 4 n 1 . x 4 n 2 .a 2 n
x2
Put p 3 and x 1
n 1 n
n 6 4 1 3 1 1 3 1
zx 1 a sin b sin
area of CAP = CPA sin A
2 2 sin C sin A
ab sin C sin 2 sin 2
2
2 sin C sin 2 C
sin 2
Similarly area of ABP =
sin 2 A
sin 2
area of BCP =
sin 2 B
adding cosec2 = cosec2A + cosec2B + cosec2C
9
sin2A + sin2B + sin2C
4
cosec2 4 0 < 30.
40.(ABC)
Number of all possible triangles n C3 .
Out of these n triangles have two sides common with polygon and
n n 4 triangles have exactly one side common with polygon.
So, desired number of triangles
nC 3 n n n 4
n n 1 n 2
n n n 4
6
n n n3
n 4 n 5 C3
6 n3
ALTERNATIVELY:
If we consider a particular vertex, say A i . If Ai is not included in the selection then we have to
select 3 vertices from remaining n 1 vertices on a circle such that no two are consecutive, which
can be done in
n 1 31
C3 ways = n 3C3 ways.
If Ai is included, then A i 1 and Ai 1 can not be included, so we can choose 2 points from remaining
n 3 21
n 3 points such that they are not adjacent in C2 n 4C2 ways So, desired number of
triangles n3C3 n4
C2
41.(AB)
The number of ways of selecting r persons from n is n Cr . Out of these r persons 3 have to selected
for the post of a treasurer, secretary and chair person with repetition. This can be done in r. r. r ways
Number of ways r 3 n Cr
n
Since r can vary from 1 to n, total number of ways r 3 n Cr
r 1
n n n
n r 2 n 1Cr 1 n r (r 1 1) n1Cr 1 n r (n 1) n2Cr 2 n1Cr 1
r 1 r 1 r 2
n n
n(n 1) (r 2 2) n2Cr 2 n (r 1 1) n1Cr 1
r 2 r 1
n n n n
n(n 1)(n 2) n 1
Cr 3 2n(n 1) n2
Cr 2 n(n 1) n2
Cr 2 n n1Cr 1
r 3 r 2 r 2 r 1
= n(n 1) (n 2). 2n3 + 3n (n 1).2n2 + n. 2n1.
Otherwise (Alternative):
The three posts can be allocated as per the cases:
Case I: Same person gets all the three posts.
When a person is having a post then the size of fellow group members in all possible cases will vary
from 0 to n 1 and every person is equally likely to get all the three posts. So if a person is selected
first for the three posts and then the team is constituted this will be equivalent to selecting a team
and then giving all the three posts to any one of them (In all possible cases) this can be done in
n
C1 2n 1 ways.
Case II: One person gets two posts and one gets one post.
Similarly this can be done in n C2 2n 2 3! ways.
Case III: All the three posts go to different person.
Similarly this can be done in n C3 2n 3 3! ways.
Hence the total number of ways n C1 2n 1 n C2 2n 2 3! n C3 2n 3 3!
2n 1 3n(n 1) 2n 2 n(n 1)(n 2) 2n 3.
42.(AB)
Tn
r r 1 r ! r 1 r 2 r ! r 1 ( r 1)! r !(r 2)
2
2
r 3r 2
2
r 3r 2 2
( r 1)( r 2)
Tr
r 1! r!
Tr Vr Vr 1
r2 r 1
T1 V1 V0
T 2 V2 V1
.
.
.
T n Vn Vn 1
Sn T1 T2 ..... Tn
Sn Vn V0
Sn
n 1! 1 Sn
2 n 1! (n 2)
n2 2 2(n 2)
VMC | Solutions 10 AMA-1B | 2019
Vidyamandir Classes
43.(ABD)
44.(AC)
100
We have C6 4.100 C7 6.100 C8 4.100 C9 100C10
4
C0100C94 4 C1 100C93 ............... 4C4 100C90
n C1 n C2 n Cn 2n !
2 2 2
......
n ! n !
20 10
(C) Coefficient of x10 , in 1 x 20C10 1 20C10
(D) Number of linear arrangement of 20 things of which 10 alike of one kind and rest all are
20!
different, taken all at a time =
10!
46.(BCD)
We know that, distribution of n distinct objects in to r different boxes, if empty boxes are not
allowed or in each box atleast one object is put n r .
The number of ways
n n r 1 n
r n r C1 r 1 r C2 r 2 ...... 1 Cr 11 ….(i)
Hence, n 5, r 3
number of ways in which the different books be distributed in 3 persons, so each gets atleast
5 5
one is 3 3C1 2 3C2 243 3 32 3 150
(B) Number of parallelogram formed by one set of 6 parallel line and other set of 5 parallel lines
6 C2 5 C2 15 10 150
(C) 5 different toys to be distributed among 3 children, so each gets atleast one
5 5
3 3C1 2 3C2 243 3 32 3 150
(D) 3 mathematics professors are assigned five different lectures, so that each professor get at
least one lecture.
5 5
3 3C1 2 3C2 243 3 32 3 150
47.(BCD)
Let = 2tan–1(–3) – < < 0
2 tan / 2
3
tan = – 3 tan = 2
–<<–
2 1 tan / 2 4 2
3
Let = tan 1 (principal value) then
4
=–
4 4 4 4
now cos = = cos 1 sin 1 sin 1
5 5 2 5 5 2
4 4 4 4
cot = = cot 1 ta n 1 ta n 1 .
3 3
2 3
2
3
48.(BCD)
a b c d
tan 1 tan 1 tan 1 tan 1
x x 2 x x
a b c d
tan 1 x x tan 1 x x
1 ab 2 1 cd
2
x x2
a b x 1 c d x a b x x 2 cd
tan 1 2 cot 2 2
x ab x cd x ab c d x
x 4 (ab ac ad bc bd cd ) x 2 abcd 0
its roots are x1 , x2 , x3 , x4
x1 0 , x1x2 ab , x1x2 x3 0 and x1x2 x3 x4 abcd
1
x1 0 and ( x2 x3 x4 )( x3 x4 x1 )( x4 x1 x2 )( x1 x2 x3 ) x1x2 x3 x4
49.(ABC)
sin 1 ( a 2 x 2 b 2 y 2 ) cos 1 | ax by |
a 2 x 2 b 2 y 2 1 and | ax by | 0 2abxy 1
50.(ABD)
t2 t1 t3
t3 t2 t4
t9 t8 t10
t1 t3 t4 t5 ....... t8 t10 0
51.(AB)
x can not be odd integer for if x is odd, x2 is odd but 2px + 2q is even;
so x2 + 2px + 2q 0
x can not be even integer for if x is even, x2 + 2px is a multiple of 4 but 2q is not.
So x2 + 2px + 2q 0
Also (x + p)2 = p2 – 2q
If x is fraction then (x + p)2 is also a fraction but p2 –2q is an integer. So, roots cannot be integer
or rational numbers.
52.(ABC)
Let f (x) = ax2 + bx + c
–3 and 3 are lying between the roots of f (x) = 0
f ( 3) > 0 and f (3) > 0
9a + 3|b| + c > 0
Also, 0, 2, 2 are lying between the roots
therefore c 0 and 4a 2 | b | c 0
53.(ABC)
sin 2 x a sin x b 0 has only one solution in (0, )
sin x 1 gives one solution and sin x gives other solution such that > 1 or 0
(sin x 1)(sin x ) is the same equation as sin 2 x a sin x b 0
1 a and b
1 b a and b 1 or b 0
b ( , 0] [1, )
and a ( , 1] [2, )
54.(AD)
1 n n n 1
C
2 r 1
r
4
B B C
1 1 n n 1
n n 1 n 2 n n 1 2n 1
6 4 12
A
2
B
b c c a a b
6; (by A.M. GM )
c b a c b a
2 x2 2 y 2 2z 2
1
1 x 1 y 1 z
By A.M G.M
1
x yz
xyz 3
3
3
x yz
xyz
3
x yz
From given condition xyz
3
2
x yz
1 x yz3
3
(n 2) (n 2) 2
61.(7) an
n(n 1)(n 3) n(n 1)(n 2)(n 3)
A B C
(say)
(n 2)(n 3) (n 1)(n 2)(n 3) n(n 1)(n 2)(n 3)
(n 2) 2 An (n 1) Bn C
n 2 4 4n An3 An Bn C
Now comparing the coefficient of powers of n,
A=1 A+B=4 C=4 B=3
1 3 4
So, an
(n 2)(n 3) (n 1)(n 2)(n 3) n(n 1)(n 2)(n 3)
n n n
1 1 3 1 1
So, Sn an n 2 n 3 2 (n 1)(n 2) (n 2)(n 3)
1 1 1
n
4 1 1
3
n(n 1)(n 2) (n 1)(n 2)(n 3)
1
1 1 3 1 1 4 1 1
3 n 3 2 6 ( n 2)( n 3) 3 6 ( n 1)(n 2)(n 3)
29 1 3 4
36 n 3 2(n 2)(n 3) 3(n 1)(n 2)(n 3)
1999 1999
1 1 a 4 2a3 3a 2 2a 1
62.(1) S 1
a2
(a 1) 2
a 2 (a 1)2
a 1 a 1
1999
a 2 a 1 1999 1 1999
1 1
a(a 1)
1 1999
a(a 1)
a (a 1)
a 1 a 1 a 1
1 1999
1999 1 1999
2000 2000
Hence p 1999 and q 2000
ab b 1 | a |2
1 | a |2 ab b
3
| ab b | 1 | a |2
4
x
(-1, -1) (1, -1)
(-2, -1) (2, -1)
AA BB
n n n n 1
Cr Cr
65.(2) lim
n
n r r 3 lim
n
nr
. x r 2 dx.
r 0 r 0 0
1 n r 1 n
x x 1
x 2 lim
0 x
n
Cr
n
dx
x 2 lim 1
0 n n
dx
0 x .e .dx e 2
2 x
r 0
But e2 e x x2
1
n x
nr r
66.(3) We have lim 1r n Cr
x 0 nr k
k
Ck . x .2 x 2 x
r 0 k 0
1
n r x
r
lim 1 n Cr 1 2 x
x 0
nr
x2 x
r 0
1 n
n x
lim 1 2 x x 2 x lim 1 3 x x 2 x
x 0
x 0
2 2
1 1 1
67.(2) Here, S 2
12 .......
2 3
k 1 K
1 K 1 2 1 1
2 2
t K2
1 ...................
3
2
k 1
1 2 1 2 1 2 S S
S t 2. ........ 2.
2 4 6 4 2
S S
t 2
2 t
68.(2) Number 777 777 is divisible by 7 so 555555 666666 888888 999999 should be written as
999 999
555555 888888 666666
999999 2999 555555 2555 2999 2555 888888 6888 666666 6666 6888 6666
999999 2999 is divisible by 1001 and 1001 is divisible by 7.
Hence it is divisible by 7.
888888 6888 is divisible by 882 and 882 is divisible by 7. Hence it is divisible by 7.
2999 2555 2555 2444 1 2555 23148 1 2555 8148 1 . Hence it is divisible by 7,
6888 6666 6666 6222 1 6666 36111 1 . Hence it is divisible by 35. So it is also divisible by 7.
666 666
666666 6666 665 1 7 1 is divided by 7 we get remainder 1666 1666 2.
Hence the remainder of number divided by 7 is 2.
69.(9) All the possible number are 9 C5 (none containing the digit 0)
= 126.
Total numbers starting with
1 8C4 70
(using 6,7,8,9)
97th number =
1 t2
4l 2t 4l 2
9t 2 1 1
9t
t
1
2l 2 1 1
Since 9t 2 9t 2 6
3 t t
2l 2
Hence maximum area
3
1 1 4
Equality holds when 9t t [since t > 0] cos A
t 3 5
VMC | Solutions 17 AMA-1B | 2019
Vidyamandir Classes
n
r 2 1 r 1 n 2r r 1 r 1 n
71.(6) Sn 2 2 2n
r 1
r r 1 r 1
r 1 r n 1
n1 n1
n a
72.(4) bn a r
n 2 ar 2
1 r
32
n 1
n 2 4 I2
Now n is an integer 4 I 2 should be an integer.
4 I 2 k 2 where k is an integer.
k2 I 2 4
which is possible only when k 2, I 0.
putting I 0 in (1),
n 2 4n 0 n 0, 4. For both these values,
x 2 nx n 0 has integral roots.
n 0, 4 n 2 4n 0
74.(2) Let f ( x) x ax 2
f ( x) 1 2ax 3 0 x (2a )1/ 3
f ( x) 6ax 4 0 x (0, ) (as ‘a’ is a natural number)
so x (2a )1/ 3 is a point of global minima
Thus (2a )1/ 3 a (2a ) 2 / 3 2
32
a a 2. As ‘a’ is a natural number.
27
Alternative solution
x ax 2 2 x3 2 x 2 a 0
Let f ( x) x3 2 x 2 a
Since f ( x) 0 x (0, ), f (0) 0 and min f ( x) 0
a 0 and for minimum f ( x)
f ( x) 3 x 2 4 x x 0, 4 / 3
32
f (4 / 3) 0 a .
27
75.(9) Let roots of x3 ax 2 bx c 0 be , ,
a , b , c
Now, ( 1), ( 1), ( 1) are the roots of x3 px 2 qx 9 0
( 1)( 1)( 1) 9
1 9 abc 8