Mathematics Olympiad

Pre-RMO, 2018

Narasimhan R. Chari

m
Euclid wrote for mature persons preparing for the study of philosophy. Geometry was the best introduction to
deductive reasoning.
H. S. M. Coxeter

o
References:

l.c
I. F. Sharygin, Problems in Plane Geometry, Mir Publishers, 1988

H. S. M. Coxeter and S. L. Greitzer, Geometry Revisited, Mathematical Association of America, 1967

ai
Roger A. Johnson, Advanced Euclidean Geometry, Dover, 1929
gm
Christopher J. Bradley, Challenges in Geometry, Oxford University Press, 2005

Arthur Engel, Problem-Solving Strategies, Springer,1998

ri@

S. L. Loney, Plane Trigonometry, Cambridge, 1915

Arthur Engel, Problem Solving Strategies, Springer Verlag, 1998

R. Graham, D. Knuth, O. Patashnik, Concrete Mathematics, Second Edition, Addison-Wesley, 1994

ha

www-history.mcs.st-and.ac.uk, (Mactutor History of Mathematics, Univ. of St. Andrews, Scotland)

sic
ra
na
Questions 1) to 30) are from the Pre-RMO Exam, 2019

1. A book is published in three volumes. The pages are numbered continuously from volume 1 to
volume 3. Volume 2 has 50 pages more than volume 1; the number of pages in volume 3 is one
and a half times that in the second volume. The sum of the page numbers of the first pages of
the three volumes is 1709. If n is the last page number, find the largest prime factor of n.
Ans: Let the page numbers in the three volumes be {1, 2, . . . , k},

m
{k + 1, . . . , k + (k + 50) = 2k + 50} and {2k + 51, . . . , 2k + m}; then
3

o
(2k + m) − (2k + 51) + 1 = (k + 50); 2m − 3k = 250; the last page is
2

l.c
3k + 250 7k + 250
n = 2k + m = 2k + =
2 2
Given, 1 + (k + 1) + (2k + 51) = 1709 ⇒ k = 552 ⇒ n = 2057 = (112 )(17)

ai
The required answer is 17
gm
2. In a quadrilateral ABCD, AB = AD = 13; BC = CD = 20, BD = 24. The radius of the inscrib-
ale circle is r. Find the integer closest to r.
Ans: Take ABCD in the anticlockwie direction. The diagram is symmetric about the diagonal
ri@

AC. Let M be the mid-point of BD. AB = AD = 13; AM ⊥ BD; MD = 12,

√
AM = 132 − 122 = 5
√
CM ⊥ BD; CM = 202 − 122 = 16; AB +CD = AD + BC ⇒ there is an inscribable circle with
centre I in ABCD. Drop IX, IY, IZ, IW perpendicular from I on the sides AB, BC, CD, DA
ha

respectively. Let AW = AX = x.
The diagonals AD and BC are perpendicular to each other. Hence
sic

1 1 1
Area[ABCD] = d1 d2 = AD. BC = (24)(5 + 16) = 12 × 21 (1)
2 2 2
Area[ABCD] = [AXIW ] + [XBY I] +YCZI] = rx + r(13 − x) + r(7 + x) + r(13 − x) = 33 r (2)
ra

84
Equations (1) and (2) give r = ≈ 7.63; hence the closest integer is 8
11
na

3. Consider all 6−digit numbers abccba with b odd. Find the number of all such numbers which
are divisible by 7.
Ans: N = abccba = a(105 ) + b(104 ) + c(103 ) + c(102 ) + b(10) + a

N = a(105 + 1) + 10b(103 + 1) + 1100c = 11(9091a + 910b + 100c) mod 7

= 4(5a + 2c) = 6a + c; N = 0 mod 7 ⇒ 6a + c = 0 mod 7; also a and c are digits.

1 ≤ a ≤ 9 and 0 ≤ c ≤ 9; hence, (a, c) = (1, 1), (1, 8), (2, 2), (2, 9), (3, 3), (4, 4), (5, 5),
(6, 6), (7, 0), (7, 7), (8, 1), (8, 8), (9, 2), (9, 9), i.e., 14 possible cases.
Also b can be any odd digit 1, 3, 5, 7, 9. Hence there are 14 × 5 = 70 possible numbers.

2
 4. The equation 166 × 56 = 8590 is valid in some base b ≥ 10. Find the sum of all such values of
b.
Ans: The usual decimal system uses numbers written in base 10; e.g.,

1729 = 9 + 2(10) + 7(102 ) + 1(103 ). Similarly, in base b, we have (166)b = 6 + 6(b) + 1(b2 );
(56)b = 6 + 5b; (8590)b = 0 + 9b + 5b2 + 8b3
Given (b2 + 6b + 6)(5b + 6) = 8b3 + 5b2 + 9b ⇒ 3b3 − 31b2 − 57b − 36 = 0

m
p
Rational root theorem: If x = is a rational root of a polynomial equation with integer coef-
q

o
ficients f (x) = a0 xn + a1 xn−1 + . . . + an = 0, then p must divide an and q must divide a0 .

l.c
Hence any integer root b of our equation must divide 36. Also, given b ≥ 10; we try b = 12.
We get (b − 12)(3b2 + 5b + 3) = 0 ⇒ b = 12

ai
5. ABCD is a trapezium; AB k CD; AD ⊥ AB.
gm
ABCD has an in-circle touching AB at Q and CD at P. If PC = 36 and QB = 49, find PQ.
Ans: Draw ABCD in the anti-clockwise direction. AD ⊥ AB; AD ⊥ CD.
Let I be the centre of the given inscribed circle. AB and CD are tangents to this circle;
IQ ⊥ AB; IP ⊥ CD; IQ k AD k IP; P, I, Q are collinear.
ri@

AQPD is a rectangle; AQIR and DPIR are squares. Let the circle touch AD and BC at R and
S respectively.
Let IP = IQ = AR = AQ = RD = IR = IS = PD = r; BQ = BS = 49; CP = CS = 36. Drop
ha

CX ⊥ QB
In the trapezium QBCP, QP = CX = 2r; PC = QB = 49; QX = CP = 36; XB = 13;
sic

BC = BS + SC; BS = BQ = 49, (external tangents);

CS = CP = 36; (external tangents); BC = 49 + 36 = 85; BC2 = BX 2 +CX 2 ; 852 = 132 + 4r2

⇒ r = 42 ⇒ PQ = CX = 2r = 84
ra

6. Integers a, b, c satisfy a + b − c = 1, a2 + b2 − c2 = −1. Find the sum of all possible values of

na

a2 + b2 + c2
Ans: a + b = c + 1 ⇒ a2 + 2ab + b2 = c2 + 2c + 1 (1)

a2 + b2 = c2 + 1 (2)
Subtracting, we get 2ab = 2c + 2 ⇒ ab = c + 1 (3)

(1) gives a + b = c + 1 = ab ⇒ ab − a − b + 1 = 1 ⇒ (a − 1)(b − 1) = 1

Case 1: a − 1 = 1, b − 1 = 1 ⇒ (a, b) = (2, 2); c = a + b − 1 = 3

Case 2: a − 1 = −1, b − 1 = −1 ⇒ (a, b) = (0, 0); c = a + b − 1 = −1

a2 + b2 + c2 = 4 + 4 + 9 = 17 or 0 + 0 + 1 = 1; the sum of these values is 18

3
 7. P is an interior point of a regular hexagon, at distances 8, 8, 16 from three consecutive vertices.
Find the integer closest to the circumradius of the hexagon.
Ans: (Wrong proof in online/youtube Allen and Resonance; you cannot assume A, C, P are
collinear):
Method 1: Let the three consecutive vertices be A, B, C such that PA = PB = 8; PC = 16

m
O is the centre of the hexagon with circumradius r. Let PD ⊥ AB; O, P, D are collinear. ∆ OBA
and ∆ OBC are equilateral.

o
∠ DOB = ∠ DOA = 30◦ ; ∠ DOC = 90◦ (1)

l.c
r2
∆ POC gives OP2 = 256 − r2 ; ∆ BDP gives PD2 = 64 − . The 30 − 60 − 90 triangle ∆ BDO
√ 4
◦ r 3
gives OB = r; ∠ OBD = 60 ⇒ OD =

ai
; O, P, D are collinear; hence OP + PD = OD;
2
r
2
√ 2
s
2 3r2

r r 3 r r
256 − r2 + 64 − = ; 256 − r2 + 64 − + 2 (256 − r2 ) 64 −
gm =
4 2 4 4 4
s
r2 3r2
 
2r2 − 320 = 2 (256 − r2 ) 64 − =
4 4
r2
 
ri@

2
r2 − 160 = 256 − r2 64 −


4
t2
Put r2 = t ⇒ t 2 − 320t + 1602 = 214 − 128t +
4
3t 2
− 192t + (160 + 128)(160 − 128) = 0 ⇒ t 2 − 256t + (64)(192) = 0 ⇒ t = 64 or t = 192
ha

4
√
r2 = t gives r = 8 or r = 8 3. But P is inside the equilateral ∆ AOB;
√
AP = 8; hence r = OA > 8; this gives r = 8 3; the integer closest to r is 14
sic

Method 2: ∆ OAB and ∆ OBC are equilateral. ∠ ABO = ∠ BOC = 60◦ . Hence AB k OC.
As in the previous method ∠ POC = 60 + 30 = 90◦ ; OP2 + r2 = 16. (1)
ra

Let OA = AB = r; OP = x; x2 +r2 = 256; ∆ AOP gives ∠ AOP = 30◦ ; ∠ PAO < ∠ DAO = 60◦ ;
hence, ∠ APO > 90◦ ⇒ r > x (2)
na

√ √
The cosine rule gives 82 = r2 + OP2 − 2r (OP) cos 30◦ ⇒ 3 r, OP = 192 ⇒ xr = 64 3 (3)
√ √ √
(x + r)2 = x2 + r2 + 2xr = 256 + 2(64) 3 = 256 + 2 192 × 64; x + r = 8 3 + 8 (4)
√ √ √
(r − x)2 = x2 + r2 − 2xr = 256 − 2(64) 3 = 256 − 192 × 64; r − x = 8 3 − 8 (5)
√
(4) + (5) gives r = 8 3; the integer closest to r is 14. This is the required answer.

Method 3: We want to prove that A, P, O are collinear.

Case 1: Suppose P is to the right of the median line AGM of the equilateral triangle ∆ ABO,
where M is the midpoint of BC and G is the centroid of this triangle. D is the midpoint of AB
and P lies on OD; AB = BO = OA = r; AP = PB = x, PC = 2x; x = 8.

4
 √
2 AM 2 r 3 r √
∆ ADP gives AP is the hypotenuse; hence x ≥ AG = = . = √ ⇒ r ≤ x 3 (1)
3 3 2 3
√ √ r
∆ POC gives OP = PC2 − OC2 = 4x2 − r2 ; also, OP ≤ OG = √
3
r 2 √
Hence 4x2 − r2 ≤ ⇒ 12x2 ≤ 4r2 ⇒ x 3 ≤ r (2)
3
√ √
(1) and (2) give r = x 3 = 8 3. This is the required answer. Further, in ∆ APD, we have

m
AP = AG; hence P = G; hence A, P, C are collinear.
Case 2: Suppose
√ P is to the right√
of the median line AGM. Then√we can√repeat the calculations.

o
We get r ≥ x 3 in eq (1) and x 3 ≥ r in eq (2). Hence r = x 3 = 8 3 as before.

l.c
8. AB is a chord of a circle with centre O. C is a point on the circle, ∠ ABC = 30◦ ; O is inside
the triangle ∆ ABC. D is a point on AB; ∠ DCO = ∠ OCB = 20◦ . Find ∠CDO in degrees.

ai
Ans: OB = OC = r; ∠ OBC = ∠ OCB = ∠ OCD = 20◦ ; ∠ BOC = 180 − 20 − 20 = 140◦ (1)

∠ BCD = 20 + 20 = 40◦ ; ∠ BDC = 180 − 30 − 40 = 110◦ ; ∠ ADC = 70◦

∠ BOC = 2 A; (1) gives A = 70◦

gm (2)

(3)

C = 180 − A − B = 180 − 70 − 30 = 80; ∠ DCA = 80 − 20 − 20 = 40◦

ri@

(2) and (3) give ∠ ADC = ∠ DAC ⇒ AC = DC (4)

∠ AOC = 2B = 60 = ∠ OCA; this gives ∆ AOC is equilateral; AC = OC = OA (5)

180 − 20
(4) and (5) give OC = DC ⇒ ∠CDO = ∠COD = = 80◦
2
ha

9. a and b are integers and a + b is a root of the equation x2 + ax + b = 0. Find the maximum
value of b2 .
sic

Ans: Method 1: Put x = a + b ⇒ (a + b)2 + a(a + b) + b = 0 ⇒ 2a2 + 3ab + (b2 + b) = 0

√
−3b ± b2 − 8b
a= (1)
ra

4
D = (3b)2 − 4(2)(b2 + b) must be a perfect square; b2 − 8b = c2 for some integers b and c
na

b2 − 8b + 16 = c2 + 16 ⇒ (b − 4)2 − c2 = 16 ⇒ (b − 4 + c)(b − 4 − c) = 16
The sum of the integers b − 4 + c and b − 4 − c is even; hence they have the same parity, i.e.,
either both are even or both are odd.

(b − 4 + c)(b − 4 − c) = 16 = ±8 × ±2 = ±4 × ±4

b − 4 + c = 2, b − 4 − c = 8 ⇒ (b, c) = (9, −3); a = −6; b2 = 81

b − 4 + c = 8, b − 4 − c = 2 ⇒ (b, c) = (9, 3); a = −6; b2 = 81

b − 4 + c = 2, b − 4 − c = 8 ⇒ (b, c) = (9, −3); a = −6; b2 = 81

b − 4 + c = −2, b − 4 − c = −8 ⇒ (b, c) = (−1, 3); a = 0; b2 = 1

5
 b − 4 + c = −8, b − 4 − c = −2 ⇒ (b, c) = (−1, −3); a = 0; b2 = 1

b − 4 + c = 4, b − 4 − c = 4 ⇒ (b, c) = (8, 0); a = −6; b2 = 64

b − 4 + c = −4, b − 4 − c = −4 ⇒ (b, c) = (0, 0); a = 0; b2 = 0

max b2 = 81

m
Method 2: As before, put x = a + b ⇒ (a + b)2 + a(a + b) + b = 0 ⇒ 2a2 + 3ab + (b2 + b) = 0
To complete the square in the a variable, there are several equivalent ways:

o
(3ab)2 9b2
a) Consider 2a2 + 3ab + 2b2 + 2b = 0; add and subtract = ; we get
4(2a2 ) 8

l.c

9b 2   9b2 
2a2 + 3ab + + + b2 + b = 0
8 8

ai
√ 3b 2
 
a 2+ √ +... = 0
2 2
gm
b) Consider 2a2 + 3ab + 2b2 + 2b = 0; multiply by 2 to get 4a2 + 6ab + 2b2 + 2b = 0
(6ab)2 9b2
Add and subtract =
4(4a2 ) 4
ri@

9b 2  
9b 2 
2
4a + 6ab + + − 2
+ 2b + 2b = 0
4 4
3b 2
 
2a + +... = 0
2
ha

c) Consider 2a2 + 3ab + 2b2 + 2b = 0; multiply by 8; 16a2 + 24ab + 8b2 + 8b = 0; add and
subtract 9b2 ;

(16a2 + 24ab + 9b2 ) − (b2 − 8b) = 0 ⇒ (4a + 3b)2 − (b2 − 8b + 16) = −16
sic

(4a + 3b)2 − (b − 4)2 = (4a + 3b + b − 4)(4a + 3b − b + 4) = 8(a + b − 1)(2a + b + 2) = −16

(a + b − 1)(2a + b + 2) = −2; −2 = ±2 × ∓1; there are 4 cases.

ra

a+b−1 = 2; 2a+b+2 = −1 ⇒ a = −6, b = 9; a+b−1 = −2; 2a+b+2 = 1 ⇒ a = 0, b = −1;

na

a+b−1 = 1; 2a+b+2 = −2 ⇒ a = −6, b = 8; a+b−1 = −1; 2a+b+2 = 2 ⇒ a = 0, b = 0 ;

max (b2 ) = 81

10. In ∆ ABC, the median from B to AC is perpendicular to the median from C to AB: the median
from A to BC is 30 units long. Find
AB2 + BC2 +CA2
100
Ans: Let AB = c; BC = a; CA = b. The Apollonius’ theorem for a median gives
a2
 
2 2 2 2 1 2 2 2
AB + AC = 2(AD + BD ); BD = BC; b + c = 2 AD +
2 4

6
 2b2 + 2c2 − a2 2c2 + 2a2 − b2 2a2 + 2b2 − c2
⇒ AD2 = ; BE 2 = ; CF 2 =
4 4 4
2 2
3(a + b + c )2
Hence AD2 + BE 2 +CF 2 = (1)
4
2 2
In this problem AD = 30; BE ⊥ CF; G is the centroid; BG = BE; CG = CF
3 3
(1) gives ∠ BGC = 90◦ ;

m
"  2  2 #
4 4 3BG 3CG
a2 + b2 + c2 = (AD2 + BE 2 +CF 2 ) = 302 + +
3 3 2 2

o
 
4 9
= 302 + (BG2 +CG2 ) = 1200 + 3(BG2 +CG2 )

l.c
3 4
1 2
But ∠ BGC = 90◦ ⇒ GD = DB = DC ⇒ BC = 2 BD = 2 GD = 2. AD = (30) = 20;
3 3
a2 + b2 + c2

ai
BG2 +CG2 = BC2 = 202 = 400; a2 + b2 + c2 = 1200 + 3(400) = 2400 ⇒ = 24
100
gm
11. There are several tea cups in the kitchen, some with handles and the others without handles. The
number of ways of selecting two cups without a handle and three cups with a handle is exactly
1200. Find the maximum number of possible cups in the kitchen.
Ans: Suppose there are x cups with handles and y cups without handles.
ri@

Given,
  
x y
= 1200 ⇒ x(x − 1)(x − 2) y(y − 1) = 3! 2! 1200 = 14400 = 26 32 52
3 2
ha

Hence x, x − 1, x − 2, y, y − 1 can have only 2, 3, 5 as their prime divisors. (1)

Also x(x − 1)(x − 2) < x3 < 14400; 253 = 15625 ⇒ x ≤ 27 (2)
sic

x = 27 ⇒ (27)(26)(25) has 13 as a factor; hence it is not a possible solution.

x = 26 ⇒ (26)(25)(24) has 13 as a factor; hence it is not a possible solution.

ra

Similarly, all integers greater than or equal to x = 11 and x = 7, 8, 9 are excluded.

x = 10 gives (10)(9)(8)y(y − 1) = 14400 ⇒ y(y − 1) = 20 ⇒ y = 5 ⇒ x + y = 15

na

x = 6 gives (6)(5)(4)y(y − 1) = 14400 ⇒ y(y − 1) = 120;

(11)(10) = 110 < 120 < (12)(11) = 132; hence no solution.

x = 5 gives (5)(4)(3)y(y − 1) = 14400 ⇒ y(y − 1) = 240 ⇒ y = 16 ⇒ x + y = 21

x = 4 gives y(y − 1) = 600 ⇒ y = 25 ⇒ x + y = 29; this is the answer.

x = 3 gives (3)(2)(1)y(y − 1) = 14400 ⇒ y(y − 1) = 2400 ⇒ y2 − y − 2400 = 0
⇒ b2 − 4ac = 9701, which is not a perfect square; hence no rational solution.

7
12. Find the number of 8−tuples (ε1 , ε2 , ε3 , ε4 , ε5 , ε6 , ε7 , ε8 ) such that εi ∈ {−1, 1}, for all i and
ε1 + 2ε2 + 3ε3 + · · · + 8ε8 is a multiple of 3.
Ans: ε is the Greek letter 0 epsilon0 ; 8−tuple means a set of ordered 8 elements, (in this prob-
lem, each of them is either 1 or −1).
Given ε1 + 2ε2 + 3ε3 + 4ε4 + 5ε5 +6ε6 + 7ε7 + 8ε8 = 0 (mod 3).
Hence ε1 − ε2 + ε4 − ε5 + ε7 − ε8 = 0 (mod 3) ⇒ ε1 + ε4 + ε7 = ε2 + ε5 + ε8 (mod 3) (1)

m
ε3 and ε6 can be chosen as 1 or −1, in 2 × 2 = 4 ways. (2)

o
In eq (1), if LHS=RHS = 0 (mod 3) , then each εi = ±1 (mod 3 ), on LHS and each εi = ±1
(mod 3 ) on RHS; this gives 4 ways. (3)

l.c
The other ways for eq (1) to hold are
a) LHS = RHS = 1 mod 3, i.e., select 2 elements equal to 1 and the third as −1 on both the

ai
sides; this gives 32 32 = 3 × 3 = 9 ways.



(4)
b) LHS = RHS = −1 mod 3, i.e., select 2 elements equal to −1 and the third as 1 on both the
gm
sides; this gives 32 32 = 9 ways.



(5)
Total number of solutions is 2(4 + 9 + 9) = 88.
ri@

13. In ∆ ABC ∠ A = 90◦ ; the altitude through A is 3 units and the internal angle bisector of ∠ A is
4 units. Find the length of the median through A.
Ans: We can take AB as the base and AC as the altitude to get
1 1
Area = [ABC] = bc = (a)(3) ⇒ bc = 3a; also b2 + c2 = a2 (1)
ha

2 2
Let AD be altitude and AE be the angle bisector. [ABC] = [ABE] + [ACE]
1 1 h
sic

Use Area [ABC] = (BC)(AD) = a h; but in ∆ ADC, we get sin C = ⇒ h = b sin C;

2 2 AC
1 1 3a 1 1
Area = ac sin B; by symmetry, Area = bc sin A ⇒ = (4)(b) sin 45 + (4)(c) sin 45
2 2 2 2 2
ra

1
3a = 4. √ (b + c) ⇒ 9a2 = 8(b2 + c2 + 2bc) = 8(a2 + 6a); a2 = 8a ⇒ a = 48
2 a
⇒ (median through A) = = 24
na

2 √ √
Homework:
√ Show
√ that the sides are a = 48; b = 18 2 + 6 14 ∼ 47 · 905;
c = 18 2 − 6 14 ∼ 3 · 005

14. If x = cos 1◦ cos 2◦ cos 3◦ . . . cos 89◦ ; y = cos 2◦ cos 6◦ cos 10◦ . . . cos 86◦ ,
2 y
find the integer nearest to log2
7 x
Ans: x = cos 1◦ cos 2◦ cos 3◦ . . . cos 89◦

= (cos 1 cos 89)(cos 2 cos 88) . . . (cos 44 cos 46) (cos 45); use cos (90 − θ ) = sin θ
1
= (cos 1 sin 1)(cos 2 sin 2) . . . (cos 44 sin 44) (cos 45); use sin θ cos θ = sin(2 θ )
2
8
 1
= √ (sin 2)(sin 4) . . . (sin 88); again, sin 88 = cos 2; sin 86 = cos 4, etc.
244 2
1 1 1
= √ (sin 2 cos 2) . . . (sin 44 cos 44) = √ . 22 . (sin 4)(sin 8) . . . (sin 88)
244 2 244 2 2
1
= √ (cos 86 cos 82 . . . cos 2); but this bracket is y in the reverse order.
266 2
1 y  y  133 2  y  2 133

m
x= √ y ⇒ = 2133/2 ; log2 = ; log2 = . = 19
266 2 x x 2 7 x 7 2

o
15. a, b are natural numbers. 2a − b, a − 2b and a + b are all distinct perfect squares. Find the least
possible value of b.

l.c
Ans: 2a − b = x2 , a − 2b = y2 ; a + b = z2 ; y2 + z2 = a − 2b + a + b = 2a − b = x2 ;
We get a Pythagorean triple (y, z, x); x2 + z2 = 2a − b + a − 2b = 3(a − b); x2 + z2 = 0 mod 3 ;

ai
but z = 0, 1, −1 (mod 3); z2 = 0, 1 (mod 3); similarly y2 = 0, 1 (mod 3);

y2 + z2 = 0 (mod 3) if and only if y = z = 0 (mod 3) gm

x2 = y2 + z2 ⇒ x = y = z = 0 (mod 3)
Let x = 3u, y = 3v, z = 3w. From the first two equations we get
x2 − 2y2 = (2a − b) − 2(a − 2b) = 3b ⇒ 3b = 9u2 − 2(9v2 ) ⇒ b = 3u2 − 6v2
ri@

a − 2b = 9v2 ⇒ a = 2(3u2 − 6v2 ) + 9v2 = 6u2 − 3v2

The third equation gives a + b = z2 ⇒ 9w2 = u2 − 3v2 + 3u2 − 6v2 = 9(u2 − v2 )

⇒ w2 = u2 − v2 ⇒ u2 = v2 + w2
ha

The minimal solution is (u, v, w) = (5, 3, 4) and (u, v, w) = (5, 4, 3)

b = 3u2 − 6v2 = 3(25) − 6(9) = 21 and b = 3(25) − 6(15) < 0; hence bmin = 21
sic

16. Find the value of

ra

∑ (i + j) − ∑ (i + j)
1≤i< j≤10 1≤i< j≤10
i+ j is odd i+ j is even
na

Ans: Put i = 1, 2, . . . , 9 and count the possible j > i coordinates taken with appropriate signs.

(1 + 2) + (1 + 4) + (1 + 6) + (1 + 8) + (1 + 10) − [(1 + 3) + (1 + 5) + (1 + 7) + (1 + 9)]

= −1 − 1 − 1 − 1 + 11 = −4 + 11 = 7

(2 + 3) + (2 + 5) + (2 + 7) + (2 + 9) − [(2 + 4) + (2 + 6) + (2 + 8) + (2 + 10)]

= −1 − 1 − 1 − 1 = −4

(3 + 4) + (3 + 6) + (3 + 8) + (3 + 10) − [(3 + 5) + (3 + 7) + (3 + 9)] = −1 − 1 − 1 + 13 = 10

(4 + 5) + (4 + 7) + (4 + 9) − [(4 + 6) + (4 + 8) + (4 + 10)] = −1 − 1 − 1 − 1 = −3

(5 + 6) + (5 + 8) + (5 + 8) − [(5 + 7) + (5 + 9)] = −1 − 1 + 15 = 13

9
 (6 + 7) + (6 + 9) − [(6 + 8) + (6 + 10)] = −1 − 1 = −2

(7 + 8) + (7 + 10) − (7 + 9) = −1 + 17 = 16

(8 + 9) − (8 + 10) = −1

9 + 10 = 19
Total 2(−1 − 2 − 3 − 4) + (11 + 13 + 15 + 17 + 19) = −20 + 75 = 55

m
17. Triangles ABC and DEF have ∠ A = ∠ D, AB = DE = 17, BC = EF = 10, and

o
AC − DF = 12, Find AC + DF.

l.c
Ans: Method 1: Cosine Rule: Let AC = x, DF = y. Then x − y = 12 ⇒ x = y + 12 (1)

The cosine rule in ∆ ABC gives BC2 = AB2 + AC2 − 2 (AB) (AC) cos A

ai
102 = 172 + (y + 12)2 − 34(y + 12) cos A

gm
102 = 172 + y2 − 34 y cos A + 24y + 144 − (12)(34) cos A
The cosine rule in ∆ DEF gives 102 = 172 + y2 − 2(17)y cos A
Hence 102 = 102 + 24 y + 144 − (12)(34) cos A
ri@

y+6
2y + 12 = 34 cos A ⇒ cos A = (1)
17
(y + 6)
Again 102 = 172 + y2 − 34y cos A ⇒ 100 = 289 + y2 − 34 y
17
2 2
y + 12y − 189 = 0 ⇒ y + 21y − 9y − 189 = 0 ⇒ (y + 21)(y − 9) = 0 ⇒ DF = y = 9
ha

15
Eq (1) gives cos A = ; AC = x = y + 12 = 9 + 12 = 21; AC + DF = x + y = 21 + 9 = 30
17
sic

Method 2: Ambiguous case of the Sine Rule: Given triangles ABC and DEF such that
AB = DE = 17; BC = EF = 10; ∠ A = ∠ D; AC − DF = 12; to find AC + DF.
Ans: If two sides and a non-included angle are equal in two triangles, the triangles need not be
ra

congruent.
a b c
The sine rule says = = = 2R
sin A sin B sin C
na

BC EF AB DE
Given = ; the sine rule in the two triangles gives = ;
sin A sin D sin C sin F
⇒ sin C = sin F ⇒ C = F or C + F = 180. This is the ambiguous case of the sine rule. If
C = F, the triangles are congruent, ( A = D, C = F, AB = DE, (AAS); then AC = DF.
But in this problem AC > DF; the triangles are not congruent; hence F = 180 −C. (1)
Draw ABC and DEF superimposed on each other as follows. Take A = D; B = E;

AB = DE = 17; EC = 10

Take F on AC such that EF = EC = 10; then ∠ DFE = 180 − ∠CFE = 180 −C, as required
in eq (1)

10
 1
Drop EM ⊥ CF; then EF = EC ⇒ FM = MC = CF
2
CF = AC − AF√ = AC − DF = 12, (given), CM = FM = 6; the Pythagoras theorem in ∆CEM
gives EM = 102 − 62 = 8
√
Again the Pythagoras theorem in ∆ AEM gives AM = 172 − 82 = 15

AC = AM + MC = 15 + 6 = 21; DF = DM − FM = 15 − 6 = 9; AC + DF = 21 + 9 = 30

m
18. a, b, c are integers, not all equal, such that 4abc = (a + 3)(b + 3)(c + 3). Find a + b + c

o
Ans: Since the problem is linear in each variable, we can get any one variable in terms of the

l.c
others, and then repeat the process to reduce one variable at a time.

4abc = abc + 3(ab + bc + ca) + 9(a + b + c) + 27

ai
⇒ abc − ab − ac − 3a = bc + 3b + 3c + 9
bc + 3b + 3c + 9
a(bc − b − c − 3) = bc + 3b + 3c + 9 ⇒ a = gm
bc − b − c − 3
(bc − b − c − 3) + (4b + 4c + 12) 4(b + c + 3)
a= = 1+ (1)
bc − b − c − 3 bc − b − c − 3
Assume, without loss of generality, a ≤ b ≤ c; given a ≥ 4
ri@

4(b + c + 3)
Hence 1 + ≥ 4 ⇒ 4b + 4c + 12 ≥ 3bc − 3b − 3c − 9
bc − b − c − 3
3bc − 7b − 7c ≤ 21 ⇒ 9bc − 21b − 21c ≤ 63; add 49 on both sides and factorise
ha

9bc − 21b − 21c + 49 ≤ 63 + 49 ⇒ 3b(3c − 7) − 7(3c − 7) ≤ 112

⇒ (3b − 7)(3c − 7) ≤ 112 (2)

sic

If b ≥ 6, then c ≥ 6 ⇒ (3b − c)(3c − 7) ≥ (18 − 7)(18 − 7) = 121 > 112, contradiction.

7
Case 1: Suppose b = 5. If c = 6, eq (1) gives a = 1 + ∈/Z
2
ra

If b = 5, c = 7, eq (2) is satisfied. eq (1) gives a = 4; (a, b, c) = (4, 5, 7) is a solution.

If b = 5, c ≥ 8, eq (2) is not satisfied.

na

Case 2: Suppose b = 4. Then a ≤ b ⇒ a = 4; 16c = (7)(7)(c + 3) ⇒ 15c = 147 ⇒ c ∈

/Z

(a, b, c) = (4, 5, 7) is the only solution (upto permutation); a + b + c = 16

Note: We can find all other positive integer solutions.
If min{a, b, c} = a ≥ 5, eq (1) gives 4b + 4c + 12 ≥ 4bc − 4c − 12 ⇒ (b − 2)(c − 2) ≤ 10;
this has no solutions with b ≥ 5 and c ≥ 5 except b = c = 5; eq (1) gives a ∈
/Z

a = 3 ⇒ bc − 3b − 3c = 9 ⇒ bc − 3b − 3c + 9 = 18 ⇒ (b − 3)(c − 3) = 18

18 = 1 × 18 = 2 × 9 = 3 × 6 ⇒ (a, b, c) = (3, 4, 21), (3, 5, 12), (3, 6, 9) (and permutations).

a = 2 ⇒ bc − 5b − 5c + 25 = 40 ⇒ (b − 5)(c − 5) = 40 = 1 × 40 = 2 × 20 = 4 × 10 = 5 × 8

11
 ⇒ (a, b, c) = (2, 6, 45), (2, 7, 25), (2, 9, 15), (2, 10, 13) (and permutations).

a = 1 ⇒ b + c = −3; this gives infinitely many negative integer solutions.

a = 0 ⇒ b = −3 or c = −3; infinitely many negative integer solutions.

Conclusion: The only positive integer solutions (upto permutation) are

m
(4, 5, 7), (3, 4, 21), (3, 5, 12), (3, 6, 9), (2, 6, 45), (2, 7, 25), (2, 9, 15) and (2, 10, 13)

o
l.c
ai
gm
ri@
ha
sic
ra
na

12
19. N = 6 + 66 + 66 + · · · + (666 . . . 6) where the last term has 100 sixes. How many times does the
digit 7 occur in the decimal representation of N?

N = 6(1 + 11 + . . . + . . .), 100 terms

6
= (9 + 99 + . . .), (100 terms)
9
2 a(rn − 1)

m
(10 − 1) + 102 − 1) + . . . + (10100 , (100 terms); use G.P. formula, Sn =

=
3 r−1

2 10(10 − 1)100 
= − 100

o
3 10 − 1
 
2 10(99 . . . 9)

l.c
= − 100 , 9 is repeated 100 times
3 10 − 1
2
= (11 . . . 10 − 100), 1 is repeated 100 times
3

ai
2
= (11 . . . 11010), 1 appears 98 times before 010
3 gm
22 . . . 2020
= , 2 appears 98 times before 020
3
(222)(222) . . . (222)(22020)
= , there are 32 blocks of 222
3
ri@

= (074)(074) . . . (074)(07340), there are 32 blocks of 074 and the last block is 07340
Hence 7 occurs 32 + 1 = 33 times.

20. Find the sum of all positive integers n such that the product of the digits is n2 − 15n − 27
ha

Ans: Let p(n) be the product of the digits of n.

225 225
p(n) > 0 ⇒ n2 − 15n − 27 > 0 ⇒ n2 − 15n + > 27 +
sic

4 4
15 306 15 17
⇒ n− > ⇒ n− >
2 4 2 2
⇒ n > 16 (1)
ra

Also, we observe that the product of the digits of any number is always less than the number.
na

Proof: n = a0 (10)k + a1 (10k−1 ) + . . . + an ≥ a0 (10k ) (2)

p(n) = (a0 a1 . . . an ) ≤ a0 (9)(9) . . . (9) < a0 (10k ) (3)

Eqs (2) and (3) imply p(n) < n

Hence n2 − 15n − 27 < n ⇒ n2 − 16n < 27 ⇒ n2 − 16n + 64 < 91 ⇒ (n − 4)2 < 91

√
⇒ n − 8 < 91 < 10 ⇒ n < 18 (4)
From (1) and (4), we get n = 17

13
21. H is the ortho-centre of an acute-angled triangle ∆ ABC. G1 , G2 , G3 are the centroids of the
triangles HBC, HCA, HAB respectively. If the area of ∆ G1 G2 G3 is 7 square units, find the
area of ∆ ABC.
Ans: H is the intersection of the altitudes of the triangle ∆ ABC. Let D, E, F be the mid-points
of the sides BC, CA, AB respectively.
HG1 2 HG2 HG1 HG2 G1 G2 2
= = ; ∆ HDE ⇒ = ⇒ G1 G2 k DE ⇒ =

m
G1 D 3 G2 E G1 D D2 E DE 3
 2
[HG1 G2 ] 2 4
The ratio of the areas of the similar triangles is = = (1)
[HDE] 3 9

o
Split the qudrilateral HFDE along its diagonals to get

l.c
[HFDE] = [HFD] + [HED] = [HFE] + [DEF] ⇒ [HED] + [HFD] − [HFE] = [DEF] (2)
Similarly, [HG1 G3 ] + [HG1 G2 ] − [HG2 G3 ] = [G1 G2 G3 ] (3)

ai
4
Eq (1) gives ([HDF] + HDE] − [HEF]) = [G1 G2 G3 ] = 7, (given)
9 gm
4 63
Eq (2) gives [DEF] = 7 ⇒ [DEF] =
9 4
Also, we know that the medial triangle DEF divides the triangle ABC into 4 equal parts.
1
ri@

i.e., [BFD] = [CED] = [AEF] = [DEF] = [ABC]

4
Hence [ABC] = 4 [DEF] = 63
Note: H may be any point outside ∆ DEF.
ha

22. A positive integer k is called 0 good 0 if there exists a partition of {1, 2, . . . , 20} into disjoint
proper subsets such that the sum of the numbers in each subset of the partition is k. How many
good numbers are there?
sic

Ans: S = {1, 2, . . . , 20}.
sum equal to k.
Then nk = 1 + 2 + . . . + 20 =
ra
Suppose S has a partition into n parts and such that each part has
20 × 21
= 210 ⇒ k must be a factor of 210. (1)

2
Also some part of the partition must contain 20; hence k ≥ 20
na

The only possible values of good numbers are k = 21, 30, 35, 42, 70, 105
We will check: k = 21, n = 10; S = {1, 20} ∪ {2, 19} ∪ . . . ∪ {10, 11}
Using unions of pairs of these subsets, we see that k = 42, n = 5 is also good;

S = {1, 20, 10, 11} ∪ {2, 19, 9, 12} ∪ {3, 18, 8, 13} ∪ {4, 17, 7, 14} ∪ {5, 16, 6, 15}

k = 30; S = {1, 2, 3, 4, 5, 6, 9}∪{7, 8, 15}∪{14, 16}∪{13, 17}∪{12, 18}∪{11, 19}∪{10, 20}

k = 35; S = {20, 15} ∪ {19, 16} ∪ {18, 17} ∪ {14, 13, 8} ∪ {12, 11, 10, 2} ∪ {1, 3, 4, 5, 6, 7, 9}
k = 70, n = 3; take pairs of the previous subsets. There are 6 good numbers.

14
23. Find the largest positive integer n such that

a2 b2 c2
+ c a + > n(a + b + c)
b c + a b
+ +
29 31 29 31 29 31
Ans: Titu’s inequality is a form of the Cauchy-Schwarz inequality. For positive real numbers we
have

m
a2 b2 c2 (a + b + c)2 a b c
+ + ≥ ; equality holds only when = =
x y z x+y+z x y z

o
(a + b + c)2 a + b + c 899 (a + b + c)
LHS ≥ = =
1 1 1 1 60

l.c
(a + b + c) + (a + b + c) +
29 31 29 31
 
59
LHS ≥ 14 + (a + b + c) ≥ n(a + b + c) ⇒ n = 14
60

ai
24. Let N be the number of triangles of different shapes, (i.e., no two are similar to each other),
gm
N
whose angles are integers in degrees. Find
100
Ans: For the general formula using generating functions, refer to Marcus Scheuer, mathstackex-
change, July 30, 2016.
ri@

Let g(n) = the number of integer points in the set S = {(x, y, z) : x ≤ y ≤ z, x + y + z = n}; the
generating function is G(x) = ∑ g(n) xn ; then
x3 n2 1802
G(x) = ; if n = 0 mod 6, we get g(n) = = = 2700
(1 − x)(1 − x2 )(1 − x3 ) 12 6
ha

In this problem, we have A + B + C = 180◦ . Hence we must find the number of integer points
in the set
sic

S = {(x, y, z) : x ≤ y ≤ z, x + y + z = 180}

x = 1 ⇒ y + z = 179 ⇒ (y, z) = (1, 178), (2, 177), . . . , (89, 90); i.e, 89 solutions.
ra

x = 2 ⇒ y + z = 178 ⇒ (y, z) = (2, 176), . . . , (89, 89); i.e, 88 solutions.

x = 3 ⇒ y + z = 177 ⇒ (y, z) = (3, 174), . . . , (88, 89); i.e, 86 solutions.

na

x = 4 ⇒ y + z = 176 ⇒ (y, z) = (4, 172), . . . , (88, 88); i.e, 85 solutions.

We reach x = 59 ⇒ y + z = 121 ⇒ (y, z) = (59, 62), (60, 61); i.e., 2 solutions.
and x = 60 ⇒ y + z = 120 ⇒ (y, z) = (60, 60); i.e., 1 solution.
Total number N = (89 + 88) + (86 + 85) + (83 + 82) + . . . + (5 + 4) + (2 + 1)

N = 3 + 9 + . . . + 171 + 177; use the A.P. formula; a = 3, d = 6, Tn = 177

a + (n − 1)d = 177 ⇒ 3 + 6(n − 1) = 177 ⇒ n = 30

n 30 N
⇒ Sn = (T1 + Tn ) = (3 + 177) = 2700; hence = 27
2 2 100

15
25. (Omitted, bonus given): T is the smallest positive integer which when divided by 11, 13, 15
leaves remainders in the sets {7, 8, 9}, {1, 2, 3}, {4, 5, 6}, respectively. Find the sum of the
squares of the digits of T .
Ans: This depends on the Chinese Remainder Theorem. Without the CRT, we can do it by brute
force.
The positive integers which are 7, 8, 9 (mod 11) are listed as

m
S1 = {7, 8, 9, 18, 19, 20, 29, 30, 31, . . .}
The positive integers which are 1, 2, 3 (mod 13) are listed as

o
S2 = {1, 2, 3, 14, 15, 16, 27, 28, 29, 40, 41, 42, 53, 54, 55, 66, 67, 68, . . .}

l.c
The positive integers which are 4, 5, 6 (mod 15) are listed as

S3 = {4, 5, 6, 19, 20, 21, 34, 35, 36, 49, 50, 51, 64, 65, 66, . . .}

ai
We want the least integer common to all these three sets. The least integer common to S2 and
S3 is 66, which is not in S1 . Beyond 66, we getgm
S2 ∩ S3 = {79, 80, 81, 94, 95, 96, 109, 110, 111, 124, 125, 126}∪
{ 139, 140, 141, 154, 155, 156, 169, 170, 121, 184, 185, 186 . . .}
ri@

Checking mod 11, we get T = 184 ∈ S1 .

The sum of the squares of the digits of T is 12 + 82 + 42 = 81

26. Find the number of ways in which we can choose 60 unit squares from an 11 × 11 chessboard
such that no two squares have a side in common.
ha

Ans: Attach three rows and three columns on the top and to the left of the usual 8 × 8 chess-
board. The bottom row and the top row start and end with a white square.
sic

If we select a white square and at least one black square, we cannot take at least two black
squares which are adjacent to the white square. If we select k ≥ 1 white squares, we cannot take
at least k + 1 adjacent black squares.
ra

Hence we must select blacks from 60 − k − 1 = 59 − k black squares. Total number of squares
selected is less than or equal to k + 59 − k = 59; hence we cannot select 60 squares.
na

Hence k = 0 ; we must select 60 black squares out of the given 60 black squares, or we must
select 60 white squares out of the given 61 white squares.
Number of ways = 61 60



60 + 60 = 61 + 1 = 62

27. Find the number of ways one can colour a 4 × 4 chessboard with red and blue colours such that
each row and each column has exactly two red and two blue squares.
Ans: Select two squares out of 4 squares in the last row. This can be done in 42 = 6 ways.

Case 1: Suppose the last and the second-last row are identically colured. The the top two rows
must have exactly opposite colours. Hence there are 6 ways in this case.
Case 2: Suppose the last row is coloured (in one of the 6 ways) and the second-last row has
16
 exactly opposite colours.Then the top row must be exactly opposite of the second row, which
can have any of 6 colourings. Hence we get 36 ways.
Case 3: Suppose the last and the second-last row match at exactly two places. In how many ways
can this happen?
The total number of ways to colour two rows is 6 × 6 = 36. Identical colouring of the two rows
can happen in 6 ways; exact opposite coloring can happen in 6 ways. Hence matching at two

m
places will happen in 36 − 6 − 6 = 24 cases. (1)
If colours Ci = C j in the last two rows, then colours must be exactly opposite in the first two

o
rows; this can happen in 1 way.

l.c
If Ci 6= C j in the last two rows, then these colours in the second row can be chosen in 2 ways;
then the first row is completely determined by the the last three rows. (2)
Multiplying (1) and (2), we get 48 ways.

ai
Adding cases 1) and 2) and 3), we get 6 + 36 + 48 = 90 ways.
gm
28. N is the number of ways of distributing 8 chocolates of different brands among three children
such that each child gets at least one chocolate and no two children get the same number of
chocolates. Find the sum of the digits of N.
ri@

Ans: To partition 8 into 3 distinct parts, we have 8 = 1 + 2 + 5 = 1 + 3 + 4

Case 1): 1 + 2 + 5 = 8; by the multinomial coefficient formula,
8!
this partition can be done in = 168 ways. Then we have to distribute this triple (1, 2, 5)
1! 2! 5!
ha

to a permutation of the 3 children; this can be done in 3! ways. Hence the number of ways is
168 × 6 = 1008 (1)
8!
sic

Case 2): 1 + 3 + 4 = 8 ⇒ = 280 ways. As before, we get 280 × 6 = 1680 ways. (2)
1! 3! 4!
Adding (1) and (2), we get 2688 ways. The sum of the digits is 2 + 6 + 8 + 8 = 24.
ra

29. Let D be a point on the segment BC of ∆ ABC. I1 and I2 are the in-centres of the triangles ABD
and ACD respectively. Let AI1 and AI2 meet BC at E and F respectively. ∠ BI1 E = 60◦ .
na

Find ∠CI2 F in degrees.

B B B
Ans: ∠ BI1 E = + ∠ BAE ⇒ ∠ BAE = 60 − ⇒ ∠ DAE = 60 −
2 2 2
Adding these two angles, we get ∠ BAD = 120 − B; ∠ DAC = A − (120 − B) = A + B − 120
1 C C C
= 180 −C − 120 = 60 −C; ∠ FAC = ∠ DAC = 30 − ⇒ ∠CI2 F = 30 − + = 30◦
2 2 2 2

This proves that, in general, ∠CI2 F = 90 − ∠ BI1 E

17
30. P(x) = a0 + a1 x + . . . + an xn , with integer coefficients, where ai ≥ 0, for 0 ≤ i ≤ n.

P(1) = 4 and P(5) = 136. Find P(3)

Ans: Suppose deg P(x) is n; i.e., an 6= 0. P(1) = a0 + a1 + . . . + an = 4 (1)

P(5) = a0 + 5a1 + 25a2 + 125a3 + . . . + 5n an = 136 (2)

But 54 = 625 > 136 and all the coefficients are non-negative integers. Hence n ≤ 3

m
From (1), we get (for each coefficient), ai ≤ 4
If n ≤ 2 we get a0 + 5a1 + 25a2 ≤ 4 + 5(4) + 25(4) = 124 < 136, contradiction.

o
Hence n = 3, a0 + 5a1 + 25a2 + 125a3 = 136 ⇒ a3 = 1 ⇒ a0 + 5a1 + 25a2 = 136 − 125 = 11

l.c
Hence a2 = 0 ⇒ a0 + 5a1 = 11; eq (1) gives a0 + a1 = 3
Hence, a0 = 1, a1 = 2 ⇒ P(x) = x3 + 2x + 1 ⇒ P(3) = 27 + 6 + 1 = 34

ai
31. Find the integer closest to the length of the side of a square PQRS inscribed in a right-angled
gm
triangle ABC with ∠ B = 90◦ , if AB = 111, BC = 148, CA = 185, P is on BC, Q and R are
on AC and S is on AB.
Hint: Similar triangles ∠ BSP = ∠ BAC = ∠ QPC; hence ∆ BSP ∼ ∆ BAC and ∆ QPC ∼ ∆ BAC
ri@

k a ax
Let AB = c, BC = a, CA = b, PQ = PS = x, BP = k, PC = a − k. Then = ⇒ k =
x b b
ax
x c c(a − k) c(a − b ) abc
= ⇒x= = ⇒x= ;
a−k b b b ac + b2
ha

373 (3)(4)(5)
a = 111, b = 148, c = 185 ⇒ x = 2 = 60
37 (12 + 25)
sic

32. O is a point in the interior of a triangle ∆ ABC. Three lines are drawn through O parallel to
the sides of the triangle, intersecting the sides BC, CA, AB at M, N, P, Q, R, S. The areas of the
triangles OMN, OPQ and ORS are a2 = 9, b2 = 4, c2 = 1 square units respectively. Find the
area of ∆ ABC.
ra

Hint: The three triangles have their sides parallel to the sides of ∆ ABC; hence all these triangles
are similar to ∆ ABC. We know that the ratio of the areas of two similar triangles is equal to the
na

ratio of the squares of their corresponding sides.

a2 [OMN] y2 y a
Let BM = x, MN = y, NC = z; 2
= = 2⇒ =
b [QOP] z z b
a2 [OMN] y2 z b
2
= = 2⇒ = (1)
b [QOP] z y a
a 2 [OMN] y 2 x c
2
= = 2⇒ = (2)
c [RSO] x y a
x+z b+c y a
Adding (1) and (2), we get = ⇒ =
y a x+y+z a+b+c
a 2 [OMN] y2 a 2
= = 2
= ⇒ ∆ = (a + b + c)2 = (3 + 2 + 1)2 = 36
∆ [ABC] (x + y + z) (a + b + c)2

18
 33.
na
ra
sic
ha
ri@
gm
ai
l.c
o m

19