INDIAN OLYMPIAD QUALIFIER

IN MATHEMATICS
Date: 30/10/2022 (IOQM) - 2022-23
Max. Marks: 100 SOLUTIONS Time allowed: 3 hours

1. A triangle ABC with AC = 20 is inscribed in a circle w. A tangent t to w is drawn through B. The distance
of t form A is 25 and that from C is 16. If S denotes the area of the triangle ABC, find the largest integer

S
not exceeding .
20
Ans. (10)

Sol.
25 A
M

ÐC
B ÐA C
N 16

ÐMBA = ÐBCA = ÐC
ÐCBN = ÐCAB = ÐA
In DAMB

AM 25
sinC = =
AB AB

25
AB =
sin C
In DBCN

16
sinA =
BC

16
BC =
sin A
In DABC
By Sin rule

AB BC
=
sin C sin A

25 16
=
(sin C)(sin C) (sin A)(sin A)

1
 sin 2 A 16
=
sin 2 C 25

sin A 4
=
sin C 5
In DABC

1
Area of DABC = × AC × AB × sinA
2

1 25
= × 20 × × sinA
2 sin C

sin A
= 10 × 25 ×
sin C

4
= 10 × 25 ×
5
S = 200

S 200
= = 10
20 20

AP 61
2. In a parallelogram ABCD, a point P on the segment AB is taken such that = and a point
AB 2022

AQ 61 AC
Q on the segment AD is taken such that = . If PQ intersects AC at T, find to the nearest
AD 2065 AT
integer.
Ans. (67)
B C
Sol.

P
T

A Q E D F
Let AQ = 61x and AD = 2065x
and AP = 61y and AB = 2022y
Draw CF || PQ and BE || PQ

AP AQ 61
= =
PB QE 1961

61x 61
Þ =
QE 1961
QE = 1961x

2
 BCFE is a parallelogram.
So, EF = BC = 2065x
Now, DAQT ~ DAFC

AQ AT 61x 61 1
= = = =
AF AC 61x + 1961x + 2065x 4087 67

AC
= 67
AT
3. In a trapezoid ABCD, the internal bisector of angle A intersects the base BC (or its extension) at the
point E. Inscribed in the triangle ABE is a circle touching the side AB at M and side BE at the point
P. Find the angle DAE in degrees, if AB : MP = 2.
Ans. (60°)

Sol. A D
x
2a – y x
2a – y
M F
y a 2a – y
x
B C
y P 2a – y E

Let AB = 2a, MP = a
ÐBAE = ÐDAE = x (AE is angle bisector)
ÐAEB = ÐEAD = x (A. I. A)
Þ AB = BE = 2a
BM = BP (Length of tangents are equal)

BP BM
as = Þ MP||AE
BE BA
So, DBMP ~ DBAE

BM MP
=
BA AE

y a
=
2a 4a - 2y
y2 – 2ay + a2 = 0
(y – a)2 = 0
y=a
So, DABE is equilateral triangle
So, x = 60 = ÐDAE
4. Starting with a positive integer M written on the board, Alice plays the following game: in each move,
if x is the number on the board, she replaces it with 3x + 2. Similarly, starting with a positive integer
N written on the board, Bob plays the following game: in each move, if x is the number on the board,
he replaces it with 2x + 27. Given that Alice and Bob reach the same number after playing 4 moves
each, find the smallest value of M + N .

3
Ans. (10)
Sol. M ® 3M + 2 ® 9M + 8 ® 27M + 26 ® 81M + 80
N ® 2N + 27 ® 4N + 81 ® 8N + 189 ® 16N + 405
81M + 80 = 16N + 405
81M – 405 = 16N – 80
81(M – 5) = 16(N – 5)
Above equation is valid only when M = N = 5
M + N = 10
5. Let m be the smallest positive integer such that m2 + (m + l)2 +......+ (m + 10)2 is the square of a positive
integer n . Find m + n.
Ans. (95)
Sol. m2 + (m + 1)2 + (m + 2)2 + ........(m + 10)2 = n2
11m2 + (2m + 4m +......+20m) + (12 + 22 +......+102) = n2
11m2 + 110m + 385 = n2
11(m2 + 10m + 35) = n2
11[(m + 5)2 + 10] = n2
m and n are positive integer for satisfying above equation [(m + 5)2 + 10] should be in form 11k2 here
k is any positive integer. It is possible when m = 18,
n2 = 11[232 + 112] = 772
Þ n = 77
m + n = 18 + 77 = 95
6. Let a,b be positive integers satisfying a3 – b3 – ab = 25. Find the largest possible value of a2 + b3.
Ans. (43)
Sol. a3 – b3 – ab = 25
a3 – b3 = ab + 25
\ a > b, let a = b + k
(b + k)3 – (b)3 = (b + k)(b) + 25
b3 + k3 + 3b2k + 3bk2 – b3 = b2 + bk + 25
(3k – 1)b2 + (3k2 – k)b + k3 = 25
So, k3 < 25, hence k = 1,2
If k = 1, 2b2 + 2b + 1 = 25
2b2 + 2b – 24 = 0
b2 + b – 12 = 0
b2 + 4b – 3b – 12 = 0
b(b + 4) –3(b + 4) = 0
b = –4 rejected
b=3
So, b = 3, hence a = 3 + 1 = 4
So (a,b) = (4, 3)
If k = 2, 5b2 + 10b + 8 = 25
5b2 + 10b – 17 = 0
No integer solution
So, (a2 + b3) = 42 + 33 = 16 + 27 = 43

4
7. Find the number of ordered pairs (a, b) such that a, b Î {10, 11,....,29,30} and GCD(a,b) + LCM(a,b)
= a + b.
Ans. (35)
Sol. GCD(a, b) + LCM(a, b) = a + b
Let, GCD(a, b) = g then

ab
g+ =a+b
g

Þ ab + g2 = g(a + b)
Þ (a – g)(b – g) = 0
Either a = g or b = g
Hence one of the two numbers is divisible by other. So in a, b Î{10, 11, 12,......30}. Pairs of (a, b)
which are divisible by each other is.
{10, 20}, {10, 30}, {11, 22}, {12, 24}, {13, 26}, {14, 28}, {15, 30} ® 14 ordered pairs
Also {10, 10} ; {11, 11} ; .......{30, 30} ® 21 ordered pairs
So, total 14 + 21 = 35

q
8. Suppose the prime numbers p and q satisfy q2 + 3p = 197p2 + q. Write as l + m , where l, m, n
p n
are positive integers, m < n and GCD(m, n) = 1. Find the maximum value of l + m + n.
Ans. (32)
Sol. q2 + 3p = 197p2 + q
q2 – q = 197p2 – 3p
q(q – 1) = 197p2 – 3p
q – 1 is multiple of p
q – 1 = pk
(pk)(pk + 1) = 197p2 – 3p
pk(pk + 1) = p(197p – 3)
k(pk + 1) = 197p – 3
pk2 + k = 197p – 3
k + 3 = 197p – pk2

k+3
=p
197 - k 2

p is positive
So, 197 – k2 > 0
k2 < 197
k £ 14

5
 So only one value is satified
k = 14
So, p = 17
q = pk + 1 = 17 × 14 + 1

q m
=l+
p n

17 ´ 14 + 1 1
= 14 +
17 17

l = 14
m=1
n = 17
l + m + n = 14 + 17 + 1 = 32
9. Two sides of an integer sided triangle have lengths 18 and x . If there are exactly 35 possible integer
values y such that 18, x, y are the sides of a non-degenerate triangle, find the number of possible integer
values x can have.
Ans. (Bonus)
Sol.

18 x

If we take x = 18 then x – 18 < y < 18 + x

0 < y < 36
So y can take 35 integral values.
If we take x = 19, then 1 < y < 37
So, y can take 35 integral value
Þ If we take x ³ 18 we always get 35 integral value of y or in general
y = x – 17, x – 16, ........., x + 17
So we can take any value of x ³ 18
10. Consider the 10-digit number M = 9876543210. We obtain a new 10-digit number from M according
to the following rule: we can choose one or more disjoint pairs of adjacent digits in M and interchange
the digits in these chosen pairs, keeping the remaining digits in their own places. For example, from
M = 9876543210, by interchanging the 2 underlined pairs, and keeping the others in their places, we
get M1 = 9786453210 . Note that any number of (disjoint) pairs can be interchanged. Find the number
of new numbers that can be so obtained from M.

6
Ans. (88)
Sol. 9 8 7 6 5 4 3 2 1 0
Total number of pairs = 9

Number of Equation Number of solution

pairs exchange
2 9
x1 + x2 = 8 c1 = 9
3 8
x1 + x2 + x3 = 6 c2 = 28
4 7
x 1 + x 2 + x 3 + x4 = 4 c3 = 35
5 6
x 1 + x 2 + x 3 + x4 + x 5 = 2 c4 = 15
6 one way 1
Total = 88
11. Let AB be a diameter of a circle w and let C be a point on w, different from A and B. The perpendicular
from C intersects AB at D and w at E(¹ C). The circle with, centre at C and radius CD intersects w
at P and Q. If the perimeter of the triangle PEQ is 24, find the length of the side PQ.
Ans. (8)
Sol. E

A B
D
r
P
r
r Q

Let CD = r = radius of smaller circle

PCQE is cyclic quadrilateral
In PCQE by ptolmy's theorem :
PE × CQ + PC × QE = CE × PQ
r × PE + r × QE = 2r × PQ
2PQ = PE + QE .....(1)
Perimeter of DPEQ = 24
PE + QE + PQ = 24
PE + QE = 24 – PQ
From equation (1)
2PQ = 24 – PQ
3PQ = 24
PQ = 8

7
12. Given DABC with ÐB = 60° and ÐC = 30°, let P,Q,R be points on sides BA,AC,CB respectively such
that BPQR is an isosceles trapezium with PQ || BR and BP = QR. Find the maximum possible value
2[ABC]
of where [S] denotes the area of any polygon S.
[BPQR]
Ans. Bonus
Sol. A
90° b
3
b/2 2
60° b 30° Q
P
3a
a a a
60° 30°
B D Ra C
b E
a
Draw a line QD || AB
Let BD = b and BP = a
QC = (2a)2 – (a)2 = 3a2
QC = 3a
3
Þ QE = a
2
1 æ bö æ bö
2 ´ ´ ça + ÷´ 3 ça + ÷
2ar( DABC) 2 è 2ø è 2ø
=
ar(DBPQR) 1 3
´ (b + a + b) ´ a
2 2
2 2
æ bö 2æ b ö
4ça + ÷ 4a ç 1 + ÷
è 2ø è 2a ø
= =
a(a + 2b) æ 2b ö
a2 ç1 + ÷
è a ø
2
æ b ö
4 ç1 + ÷
è 2a ø = x
=
æ 2b ö
ç1 + ÷
è a ø
b
Let =y
a
2
æ yö
4 ç1 + ÷
è 2 ø = x Þ (2 + y) = x
2

(1 + 2y) (1 + 2y)
2
y + 4y + 4 = x + 2xy
y2 + y(4 – 2x) + 4 – x = 0
for y Î R D ³ 0
(4 – 2x)2 – 4(4 – x) ³ 0
16 + 4x2 – 16x – 16 + 4x ³ 0
4x2 – 12x ³ 0
x³3
2[ABC]
Minimum value of =3 [question must have asked for minimum value]
[BPQR]

8
13. Let ABC be a triangle and let D be a point on the segment BC such that AD = BC. Suppose ÐCAD
= x°, ÐABC = y° and ÐACB = z° and x, y, z are in an arithmetic progression in that order where the
first term and the common difference are positive integers. Find the largest possible value of ÐABC
in degrees.
Ans. (59)
Sol. A

y x+z z
B D C
In DABD, by sine rule :
AD sin y
=
AB sin ( x + z )
Q x, y, z are in A.P. so x + z = 2y
AD sin y sin y
= =
AB sin ( x + z ) sin 2y
In DABC by sine rule
BC sin (180 - ( y + z ) ) sin ( y + z )
= =
AB sin z sin z
Q AD = BC
sin y sin ( y + z )
\ =
sin 2y sin z
sin y sin ( y + z )
=
2sin y cos y sin z
sin z = 2sin (y + z) cosy
sin z = sin (2y + z) + sinz
sin (2y + z) = 0
2y + z = 180°
Q y<z
2y + y < 180
y < 60 largest value of ÐABC = 59°
14. Let x, y, z be complex numbers such that

x y z
+ + =9
y+z z+x x+y

x2 y2 z2
+ + = 64
y+z z+x x+y

x3 y3 z3
+ + = 488
y+z z+x x+y

x y x m
If yz + zx + zy = n where m, n are positive integers with GCD (m, n) = 1, find m + n.

9
Ans. (16)
Sol. Let x + y + z = s
x y z
+ + =9 ....(1)
y+z z+x x+y

x2 y2 z2
+ + = 64 ....(2)
y+z z+ x x +y

x3 y3 z3
+ + = 488 .....(3)
y+z z+ x x +y

æ 1 ö
çå ÷s = 9 + 3
è x+yø

1 12
å = .....(4)
x+y s
(1) × s
x
så = 9s
y+z

x2
å + s = 9s
y+z
64 + s = 9s
s=8=x+y+z ......(5)
(2) × s

x2
så = 64s
y+z

x3
å + x 2 + y 2 + z 2 = 64s
y+z
488 + x2 + y2 + z2 = 64 × 8
x2 + y2 + z2 = 24 ......(6)
From (5) and (6)
2 å xy = 82 – (24) = 64 – 24 = 40
å xy = 20

1 1 1 12 3
from (4) + + = =
x+y y+z z+x 8 2

1 1 1 3
+ + =
8-z 8-x 8-y 2

å(8 - x)(8 - y) 3
=
(8 - x)(8 - y)(8 - z) 2

10
 64 ´ 3 - 16(8) + 20 3
=
512 + 8(20) - 64(8) - xyz 2
xyz = 104
x y z
+ +
yz zx xy

x2 + y2 + z2
=
xyz

24 6 3 m
= = = =
104 26 13 n
m + n = 3 + 13 = 16
15. Let x, y be real numbers such that xy = 1. Let T and t be the largest and the smallest values of the
expression.
( x + y) - ( x - y) - 2
2

(x + y) + (x - y) - 2
2

m
If T + t can be expressed in the form where m, n are nonzero integers with GCD(m, n) = 1, find
n
the value of m + n.
Ans. (25)
Sol. (x + y)2 = (x – y)2 + 4xy
= (x – y)2 + 4

(x + y) - (x - y) - 2 ( x - y ) - ( x - y) + 2
2 2

So K= =
( x + y ) + ( x - y) - 2 (x - y) + (x - y) + 2
2 2

Let x – y = a
a2 - a + 2
K=
a2 + a + 2
(K + 1)a2 + (K + 1)a + 2(K – 1) = 0
as a is real, so D ³ 0
(K + 1)2 – 4(K – 1) 2(K – 1) ³ 0
(K + 1)2 – 8(K – 1)2 ³ 0

ë ( ) ( ûë ) ( û )
éK 1 + 2 2 + 1 - 2 2 ù éK 2 2 - 1 - 1 - 2 2 ù £ 0

2 2 +1 2 2 -1
T= t=
2 2 -1 2 2 +1
2 2 +1 2 2 -1
T+t= +
2 2 -1 2 2 +1
8 +1- 8 2 + 8 +1+ 8 2
=
8 -1
18 m
= =
7 n
m + n = 18 + 7 = 25

11
16. Let a, b, c be reals satisfying
3ab + 2 = 6b, 3bc + 2 = 5c, 3ca + 2 = 4a.

r
Let ¤ denote the set of all rational numbers. Given that the product abc can take two values Τ
s

t
and Î ¤ , in lowest form, find r + s + t + u.
u
Ans. (18)
Sol. 3ab + 2 = 6b
6b - 2
a=
3b
3bc + 2 = 5c
2
c=
5 - 3b
3ca + 2 = 4a
æ 6b - 2 öæ 2 ö æ 6b - 2 ö
3ç ÷ç ÷ + 2 = 4ç ÷
è 3b øè 5 - 3b ø è 3b ø
27b2 – 39b + 14 = 0
27b2 – 18b – 21b + 14 = 0
(3b – 2) (9b – 7) = 0
2 7
b= ,
3 9
7 8 3
When b= a= and c =
9 7 4
7 8 3 2 r
abc = ´ ´ = =
9 7 4 3 s
2 2
When b= a = 1 and c =
3 3
2 2 4 t
abc = ´ 1´ = =
3 3 9 u
\ r+s+t+u=2+3+4+9
= 18
17. For a positive integer n > 1, let g(n) denote the largest positive proper divisor of n and ƒ(n) = n – g(n).
For example, g(10) = 5, ƒ(10) = 5 and g(13) = 1, ƒ(13) = 12. Let N be the smallest positive integer
such that ƒ(ƒ(ƒ(N))) = 97. Find the largest integer not exceeding N.
Ans. (19)
Sol. ƒ(n) = n – g(n)
If n is even
n = 8, g(8) = 4 n = 12, g(12) = 6
ƒ(8) = 4 ƒ(12) = 6
n = 50, g(50) = 25 hence If n = x, where
x
ƒ(50) = 25 x is even, then ƒ(n) = .
2

12
 If n is prime.
n = 5, g(5) = 1 n = 13, g(13) = 1
ƒ(5) = 4 ƒ(13) = 12
n = 17, g(17) = 1 hence If n = p, where p is
ƒ(17) = 16 prime, then ƒ(n) = p – 1

If n is odd but not prime,

n = 9, g(9) = 3 n = 15, g(15) = 5
ƒ(9) = 6 ƒ(15) = 10
n = 21, g(21) = 7 hence If n = y, where y is
ƒ(21) = 14 odd composite, then ƒ(n) = 2.g(n)

n
In all above cases, we observe that ƒ(n) can be odd only when n is even, and that to when ƒ(n) = or
2
n = 2ƒ(n).
Now checking certain value of N
f(f(f(N)))
N = 389
f(N) = 389 – g(389) = 388
f(f(388))
f(388) = 388 – 194 = 194
f(194) = 194 – 97 = 97

So, N = 389 and N @ 19

So answer is 19
18. Let m, n be natural numbers such that
m + 3n – 5 = 2LCM(m, n) – 11 GCD(m, n).
Find the maximum possible value of m + n.
Ans. (70)
Sol. Let m = ga, n = gb, where gcd (m, n) = g
\ LCM (m, n) = gab also gcd(a, b) = 1
Now, m + 3n – 5 = 2(LCM) – 11(GCD)
ga + 3gb – 5 = 2gab – 11g
ga + 3gb + 11g – 2gab = 5
g(a + 3b + 11 – 2ab) = 5 = 5 × 1
= 1 × 5 (Q LHS is product of 2 integers)

13
 Case 1 : If g = 1, then a + 3b + 11 – 2ab = 5
2ab – a – 3b – 11 = –5
(2b – 1)(2a – 3) = 15 =5×3
=3×5
= 15 × 1
= 1 × 15
(a) 2b – 1 = 5, 2a – 3 = 3
b = 3, a = 3 (rejected as a & b should be coprime)
(b) 2b – 1 = 3, 2a – 3 = 5
b = 2, a = 4 (rejected)
(c) 2b – 1 = 15, 2a – 3 = 1
b = 8, a = 2 (rejected)
(d) 2b – 1 = 1, 2a – 3 = 15
b = 1, a = 9
So m = 9, n = 1 (m, n) = (9, 1)
Case 2 : If g = 5, then a + 3b + 11 – 2ab = 1
Simplifying it same way we get
(2b – 1)(2a – 3) = 23 = 23 × 1 = 1 × 23
(a) 2b – 1 = 23, 2a – 3 = 1
b = 12, a = 2 (rejected)
(b) 2b – 1 = 1, 2a – 3 = 23
b = 1, a = 13
so m = 65, n = 5
(m, n) = (65, 5)
So maximum possible value of m + n is 65 + 5 = 70.
19. Consider a string of n 1's. We wish to place + signs in between so that the sum is 1000. For instance,
if n = 190, one may put + signs so as to get 11 ninety times and 1 ten times, and get the sum 1000.
If a is the number of positive integers n for which it is possible to place + signs so as to get the sum
1000, then find the sum of the digits of a.
Ans. (09)
Sol. Let there be a 111's, b 11's, and C 1's
thus 111a + 11b + c = 1000 and 3a + 2b + c = n
Hence 111a + 11b + n – 3a + 2b = 1000
Þ 108a + 9b = 1000- n
So n º 1 (mod 9)

1000 - n
and 12a + b = and 3a + 2b £ n
9

14
 We claim only n that work are n ³ 46, and n = 28 and n º 1 (mod 9)
checking from n = 1, 10, 28, 37, we see only 28 works
if n ³ 46

1000 - 46
then 12a + b £ = 106
9

hence either a = 8 and b £ 10

or a £ 7 and b £ 11
in the first case we get 3a + 2b £ 24 + 20 = 44 £ n
in the second case we get 3a + 2b £ 21 + 22 = 43 £ n

1000 - n
therefore by choosing b as remainder when is divided by 12 & a as quotient works for n ³ 46
9
& n º 1(mod 9).
no. of n = 108
So a = 108 and sum of digits = 9
20. For an integer n ³ 3 and a permutation s = (p1,p2....,pn) of {1, 2,....,n}, we say pt is a landmark point
if 2 £ l £ n – 1 and (pt – 1 – pt)(pt + 1 – pt) > 0. For example, for n = 7, the permutation (2, 7, 6, 4,
5, 1, 3) has four landmark points : p2 = 7, p4 = 4, p5 = 5 and p6 = 1. For a given n ³ 3, let L(n) denote
the number of permutations of {1, 2,.....n} with exactly one landmark point. Find the maximum n ³
3 for which L(n) is a perfect squares.
Ans. (3)
Sol. Let us assume we are setting one peak then it must be 'n' and rest of the number can be arranged left
right of it in 2n – 1 ways !!
Removing strictly increasing (decreasing) arrangement we set 2 n – 1 – 2 ways.
If we get n valley then it must be '1' and again we get 2n – 1 – 2 ways.
Similarly if we get a valley, then if must be 1 and again we get 2n–1 – 2 ways.
Total ways = 2n – 1 + 2n – 1 – 4
= 2n – 4 = 4(2n – 2 – 1)
L(n) = 4(2n–2 – 1)
L(n) is perfect square
Þ 2n – 2 – 1 must be square.
Þ 2n – 2 – 1 º 1 (mod 8)
Þ 2n – 2 º 2 (mod 8)
Þ 2n – 3 º 1 (mod 4)
Þ n=3
15
21. An ant is at a vertex of a cube. Every 10 minutes it moves to an adjacent vertex along an edge. If
N is the number of one hour journeys that end at the starting vertex, find the sum of the squares of
the digits of N.
Ans. (74)
Sol. Every cube have 4 Length, 4 Breadth and 4 Height. L
According to questions requirement B
B
Case I : all 6 L = 1 L
H H
Case II : all 6 B = 1 H H
Case III : all 6H = 1 L
B
6 B
Case IV : 2L 2B 2H = 2 2 2 = 90 L

6
Case V : 4L 2B = = 15
4 2

6
Case VI : 2L 4B = 4 2 = 15

Case VII & VIII : Similar to case V and case VI with L and H = 30
Case IX & X : Similar to V and VI with B and H = 30
So total = 183
ans = 12 + 82 + 32 = 74
22. A binary sequence is a sequence in which each term is equal to 0 or 1. A binary sequence is called
friendly if each term is adjacent to at least one term that is equal to 1. For example, the sequence 0,
1, 1, 0, 0, 1, 1, 1 is friendly. Let Fn denote the number of friendly binary sequances with n terms. Find
the smallest positive integer n ³ 2 such that F n > 100.
Ans. (11)
Sol. We note that each run of 1s is in friendly binary sequence has to have length two or more for n ³ 5, we
partition the sequence counted by Fn into three cases.
Case 1 : The first run of 1s has length atleast three. In this case, removing one of the 1s in the Ist run
leaves a friendly sequence of length n – 1.
Conversely every friendly sequence of length n – 1 can be extended to a friendly sequence of length
n by inserting a 1 into the Ist run of 1s.
For Eg : 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0 can be mapped to
0, 1, 1, 1, 1, 0, 0, 1, 1, 0.
so there are Fn – 1 sequences in this case.
Case 2 : The Ist run of 1s has length two and the Ist term in the sequence is 1. In this case, the sequence
begins with 1, 1, 0 and what follows is any one of the Fn – 3 friendly sequences of length n – 3.
Case 3 : The first run of 1s has length two and the Ist term in the sequence is 0. In this case, the sequence
begins 0, 1, 1, 0 and what follows is any one of the Fn – 4 friendly sequences of length n – 4. So from
case 1, 2 & 3, we conclude that Fn = Fn – 1 + Fn – 3 + Fn – 4
For n ³ 5, By checking small cases, we verify
that F1 = 0, F2 = 1, F3 = 3, F4 = 4.

16
 Now by above recurrence, F5 = F4 + F2 + F1 = 4 + 1 + 0 = 5
F6 = F5 + F3 + F2 = 5 + 3 + 1 = 9
F7 = F6 + F4 + F3 = 9 + 4 + 3 = 16
F8 = F7 + F5 + F4 = 16 + 5 + 4 = 25
F9 = F8 + F6 + F5 = 25 + 9 + 5 = 39
F10 = F9 + F7 + F6 = 39 + 16 + 9 = 64
F11 = F10 + F8 + F7 = 64 + 25 + 16 = 105 > 100
hence n = 11.
23. In a triangle ABC, the median AD divides ÐBAC in the ratio 1 : 2. Extend AD to E such that EB is
perpendicular AB. Given that BE = 3, BA = 4, find the integer nearest to BC2.
Ans. (29)
Sol. A

aaa

m 4
n

D B
C mx nx (m+n)x
E
3

Draw angle bisector AE of angle ÐCAD.

Let AC = m and AD = n
By angle bisector theorem :
CE m
Þ =
ED n
CE = mx and ED = nx, DB = (m + n)x
In DAEB by angle bisector theorem
AE n 4n
= AE =
4 m+n m+n
Þ ar(DACE) + ar(DAED) = ar(DACD)
1 4n 1 4n 1
´m´ sin a + ´ n sin a = mnsin 2a
2 m+n 2 m+n 2
4mn 4n 2 4
+ = 2mn cos a [ cos a = ]
m+n m+n 5
5
m=
2
Þ ar(DAED) + ar(DADB) = ar(DAEB)
1 4n 1 1 4n
´ ´ n sin a + ´ n ´ 4sin a = ´ ´ 4 sin 2a
2 m+n 2 2 m+n
4n 2 32n 4 39
+ 4n = ´2´ n=
m+n m+n 5 20

17
 In DABC By apollonius theorem
m2 + 42 = 2(n2 + BD2)

25 1521
+ 16 = 2 ´ + 2BD2
4 400
2929
Þ BD2 =
400
BC2 = 4BD2 = 29.29
Nearest integer value of BC2 = 29
24. Let N be the number of ways of distributing 52 identical balls into 4 distinguishable boxes such that
no box is empty and the difference between the number of balls in any two of the boxes is not a multiple
of 6. If N = 100a + 6, where a,b are positive integers less than 100, find a + a + b.
Ans. (81)
Sol. Let x1, x2, x3, x4 are the number of balls in each boxes.
\ x1 + x2 + x3 + x4 = 52 .... (1)
x1, x2, x3, x4 Î z+
Let x1 = r1 mod 6
r1, r2, r3, r4 are distinct as difference between the number of balls in any two boxes is not a multiple of
6.
\ r1, r2, r3, r4 Î {1, 2, 3, 4, 5, 6}
as r5, r6 Î {1, 2, 3, 4, 5, 6} – {r1, r2, r3, r4}.
Since r1 + r2 + r3 + r4 = 52 º 4 mod 6 .... (2)
as also r1 + r2 + r3 + r4 = 1 + 2 + 3 + 4 + 5 + 6 – (r5 + r6) .... (3)
r1 + r2 + r3 + r4 = 21 – (r5 + r6) º 4 mod 6
r5 + r6 º 21 – 4 = 17
r5 + r6 º –1 mod 6
as r5, r6 are distinct
as r5 + r6 = 6q – 1 (odd)
r5, r6 has opposite parity as they are different.
and their sum is odd
\ as r5, r6 Î {1, 2, 3, 4, 5, 6}
also r5 + r6 Î º –1 mod 6 º 5 mod 6
{r5, r6} Î {1, 4}, {2, 3}, {5, 6} three possibilites.
If {r5, r6} Î {1, 4}
then {r1, r2, r3, r4} Î {2, 3, 5, 6}
as r1, r2, r3, r4, r5, r6 are different
total possibilites to solve r1, r2, r3, r4 in some order is
4! = 24

18
Case I :
as r5 + r6 = 5 {r5, r6} Î {(1, 4), (2, 3)} two possibilities.
r1 + r2 + r3 + r4 = 21 – (r5 + r6)
= 21 – 5
= 16
as x1 + x2 + x3 + x4 = 52
let xi = 6ki + ri
\ 6(k1 + k2 + k3 + k4) + (r1 + r2 + r3 + r4) = 52
6(k1 + k2 + k3 + k4) = 52 – 16
\ k1 + k2 + k3 + k4 = 6
each ki Î z+

æ 6 + 4 - 1ö æ 9 ö
ç ÷ = ç ÷ ´ 2 this is for two cases for (r5, r6) as (1, 4), (2, 3)
è 4 -1 ø è 3ø

9.8.7
´2
3.2.1
8 × 21 = 168
Case II if r5 + r6 = 11 r5, r6 Î (5, 6)
\ r1 + r2 + r3 + r4 = 21 – (r5 + r6)
= 21 – 11
r1 + r2 + r3 + r4 = 10
As x1 + x2 + x3 + x4 = 52
6(k1 + k2 + k3 + k4) + (r1 + r2 + r3 + r4) = 52
6(k1 + k2 + k3 + k4) = 42
k1 + k2 + k3 + k4 = 7
its solution as

æ 7 + 4 - 1 ö æ 10 ö
ç ÷ = ç ÷ ´1
è 4 -1 ø è 3 ø

10.9.8
= 120
3.2.1
So total solution are 168 + 120 = 288
as we have to multiply by 4! = 24
So 288 × 24 = 6912
= 100a + b
6900 + 12
a = 69, b = 12
\ a + b = 81

19