Pre-RMO 2019

Narasimhan R. Chari
Pre-RMO 2019-I

m
Reference: www.aops.contests
My gratitude to Professor Ajay Lakhina, (Allen Chandigarh), for helpful discussions.

o
Total 30 questions. Max marks: 102
Q 1 to 6: 2 marks each. Q 7 to 21: 3 marks each. Q 22 to 30: 5 marks each.

l.c
No negative marking. No marks for steps.
OMR sheet, machine correction. All answers in 1 or 2 digits.
Time: 3 hours.

ai
1. From a square with side 5 units, triangular pieces are removed from the four corners to form a
gm
regular octagon. Find the area removed to the nearest integer.
Ans: Given a square ABCD anti-clockwise, in order; let x be the side of each of the four right-
angled isosceles triangles cut off from each corner of the square.
√
The hypotenuse is x 2; the remaining side of √ the square is 5 − 2x; since the octagon is regular,
ri@

√ 5 5(2 − 2)
we get x 2 = 5 − 2x ⇒ x = √ =
2+ 2 2
√
1 2 25(2 − 2)2 √
Area of the four triangles removed is (4) (x ) = = 25(3 − 2 2)
2 2
ha

≈ 25[3 − 2(1.41)] ≈ 4.35; the nearest integer is 4.

   
1 1
sic

2. f (x) = x2 + ax + b; f x+ = f (x) + f for all non-zero real numbers.

x x
The roots of the equation f (x) = 0 are integers. Find a2 + b2
   
1 1
ra

Ans: f x + = f (x) + f gives

x x
1 2
   
1 1 a
na

x+ +a x+ + b = x2 + ax + b + 2 + + b ⇒ b = 2
x x x x
f (x) = (x − α)(x − β ); α β = 2 = 1 × 2 = 2 × 1 = −2 × −1 = −1 × −2

α + β = 3 or −3; α + β = −a; a = ±3; a2 + b2 = 4 + 9 = 13

3. Let x1 be a positive integer; xn+1 = 1 + x1 x2 · · · xn , for n ≥ 1

If x5 = 43, what is the sum of the digits of the largest prime factor of x6
Ans: x5 = 43 = 1 + x1 x2 x3 x4 ⇒ x1 x2 x3 x4 = 42
x6 = 1 + (x1 x2 x3 x4 )x5 = 1 + (42)(43) = 1807 = 13 × 139; 1 + 3 + 9 = 13
 Pre-RMO 2019

4. An ant leaves the anthill for its morning exercise. It walks 4 feet east, then makes a 160◦ turn
to the right and walks 4 more feet. It then makes another 160◦ turn to the right and walks 4
more feet. If the ant continues this pattern until it reaches the anthill again, what is the distance
(in feet) it would have walked?
Ans: To come back to the anthill again the ant has to make a certain integral number of rotations.
The least positive multiple of 160 which is a multiple of 360 is 160 × 9 = 1440 = 360 × 4
Total distance covered is 9 × 4 = 36 feet.

m
Second method: A more rigorous method uses vectors or complex numbers.
−
→ −
→ −
→ −
→

o
If AC is obtained by rotating AB anti-clockwise through the angle θ , we have AC = ei θ AB

l.c
Equivalently, z3 − z1 = ei θ (z2 − z1 )
−→
In this problem, turning a vector AB through 160◦ has the same result as an anti-clockwise
−
→
rotation of the vector BA through θ = 20◦ = π/9; e9i θ = ei π = cos π + i sin π = −1 (1)

ai
Let z0 be the starting point of the ant’s walking process. We have zi+1 − zi = (zi−1 − zi ) ei θ ; put
i = 1, 2, . . . 9 gm
z1 − z0 = 4
z2 − z1 = −4 ei θ
z3 − z2 = (z1 − z2 ) ei θ = 4 e2 i θ
z4 − z3 = (z2 − z3 ) ei θ = −4 e3 i θ
ri@

z5 − z4 = 4 e4 i θ
z6 − z5 = −4 e5 i θ
z7 − z6 = 4 e6 i θ
z8 − z7 = −4 e7 i θ
z9 − z8 = 4 e8 i θ
ha

Adding these equations, we have a telescoping sum, (with x = ei θ ),

4(1 + x9 )
z9 = z0 + 4(1 − x + x2 − . . . + x8 ) = z0 + = z0 , using eq (1), x9 = −1
sic

1+x
This proves our claim that after nine steps of the walking process, the ant comes back to its
starting point. Total distance covered is 4 × 9 = 36 feet.
ra

5. Five persons wearing badges numbered 1, 2, 3, 4, 5 are seated around a circular table. In how
na

many ways can they be seated so that no two persons whose badges have consecutive numbers
are seated next to each other? (Two arrangements obtained by rotation around the table are con-
sidered different).
Ans: Select 1 at the top of the circle; we have two possible anti-clockwise arrangements:
(1, 3, 5, 2, 4) and (1, 4, 2, 5, 3).
(1, 5, 3, . . .) and (1, 5, 2, . . .) are not possible; hence (1, 5, . . .) is not possible.
By rotation, we can write these same arrangements with each of the other numbers {1, 2, 3, 4, 5}
at the top of the table. Hence we get a total of 5 × 2 = 10 arrangements.

2
 Pre-RMO 2019

6. abc denotes a 3−digit number with all non-zero digits satisfying a2 + b2 = c2 . Find the largest
possible prime factor of such a number.
Ans: (3, 4, 5) is the only Pythagorean triple with all numbers less than 10.

345 = 3 × 5 × 23 and 435 = 3 × 5 × 29; hence the required answer is 29

m
7. On a clock there are two instants between 12 and 1 when the hour hand and the minute hand
b
are perpendicular to each other. If the difference in minutes between these two times is a +
c
b

o
with in reduced form, find a + b + c.
c

l.c
Ans: Suppose the times are x minutes and y minutes after 12 o’clock.
In 60 minutes, the hour hand covers 30◦ and the minute hand covers 360◦ .

ai
x
Hence in x minutes, the hour hand has covered degrees and the minute hand has covered 6x
2
x 180 gmy 540
degrees; hence 6x − = 90 ⇒ x = ; 6y − = 270 ⇒ y =
2 11 2 11
360 8
|x − y| = = 32 + ⇒ a + b + c = 32 + 8 + 11 = 51
11 11
ri@

n
8. How many positive integers n are there with 3 ≤ n ≤ 100 such that x2 + x + 1 is divisible by
x2 + x + 1?
√ √
2 −1 + i 3 2 −1 − i 3
Ans: x + x + 1 = 0 ⇒ x = ω = ; x=ω = ; ω 3 = 1 and ω 2 = −ω − 1
2 2
ha

ω 3k = 1 ; ω 3k+1 = ω and ω 3k+2 = ω 2 for all integers k.

n
The condition is that these cube roots of unity must also satisfy ω 2 + ω + 1 = 0
sic

n
ω 2 = −1 − ω = ω 2 ⇒ 2n = 2 mod 3
But 2 = −1 mod 3; hence (−1)n = −1 ⇒ n is odd; n ∈ {3, 5, 7, . . . , 99}; this gives 49 values.
ra

p 22
9. Let the rational number be closest to, (but not equal to), among all rational numbers
q 7
with denominator less than 100. Find p − 3q.
na

 
 p 22  |7p − 22q|
Ans:  −  = ; this difference should be as small as possible.
 
q 7 7q
The smallest possible numerator is |7p − 22q| = 1 and the largest possible denominator is with
q = 99.

7p − (22)(99) = ±1 ⇒ 7p = 2177 ⇒ p = 311; p − 3q = 311 − (3)(99) = 14

3
 Pre-RMO 2019

10. Ω is the circumcircle of ∆ ABC. The internal angle bisectors of angles A, B, C intersect Ω at
A1 , B1 , C1 .
The internal angle bisectors of angles A1 , B1 , C1 of ∆ A1 B1C1 intersect Ω at A2 , B2 , C2 .
If the smallest angle of ∆ ABC is 40◦ , find the magnitude of the smallest angle of ∆ A2 B2C2 , in
degrees.
A
Ans: Since angles in the same segment of a circle are equal, ∠ A1C1C = ∠ A1 AC =

m
2
B A+B
∠ B1C1C = ∠ B1 BC = ; ∠ B1C1 A1 =
2 2

o
B +C C+A A+B
The angles of ∆ A1 B1C1 are A1 = , B1 = , C1 =

l.c
2 2 2
Repeating the process, the angles of ∆ A2 B2C2 are

ai
 
B1 +C1 C1 + A1 A1 + B1
, ,
2 2 2
   
2A + B +C 2B +C + A 2C + A + B A + 180 B + 180 C + 180
gm
= , , = , ,
4 4 4 4 4 4
40 + 180
The smallest angle is = 55◦
4
ri@

11. How many distinct triangles ∆ ABC are there, upto similarity, such that the magnitudes of the
angles are integers, in degrees, and satisfy cos A cos B + sin A sin B sin kC = 1,
for some positive integer k, with kC ≤ 360◦
ha

Ans: cos A cos B = 1 − sin A sin B sin kC; if sin kC < 0, we get cos A cos B > 1, impossible.
Hence sin kC > 0; 0 < sin kC ≤ 1; 1 ≥ sin kC; hence we get
sic

cos A cos B + sin A sin B (1) ≥ cos A cos B + sin A sin B sin kC = 1 given.
 
π 5π
⇒ cos (A − B) ≥ 1; this forces equality; A − B = 0 and sin kC = 1; kC ∈ , ,...,
2 2
kC = (4n + 1) 90◦ ; C = 180 − A − B = 180 − 2A ⇒ C is even.
ra

C is even and C must divide (4n + 1) 90◦ ⇒ C | 90 = 2 × 32 × 5

na

180 −C
C ∈ {2, 6, 10, 18, 30, 90}; A = B = . There are six possible triangles.
2

12. A natural number k is called good if there exist natural numbers a1 < a2 < . . . < ak such that
1 1 1
√ + √ + . . . + √ = 1. Let f (n) be the sum of the first n good numbers, n ≥ 1. Find
a1 a2 ak
f (n + 5)
the sum of all values of n such that is an integer.
f (n)
Ans: a1 , a2 , . . . , ak must all be perfect squares.
1 1 1 1 1
2 is not good, because 1 ≤ a < b ⇒ 1 + > 1 and a ≥ 2 gives + < + < 1
b a b 2 3

4
 Pre-RMO 2019

1 1 1
+ + = 1 ⇒ 3 is good.
2 3 6
 
1 1 1 1 1 1 1 1 1
+ + = ; hence + + + = 1; hence 4 is good.
2 2 3 6 2 2 4 6 12
1
Repeating the process of adding to half of the previous sum, we get, k is good for k ≥ 3
2
n n(n + 5)
f (n) = 3 + 4 + · · · + (n + 2) = [6 + (n − 1)(1)] =

m
2 2
(n + 5)(n + 10) f (n + 5) n + 10 10
Changing n to n + 5 we get f (n + 5) = ; = = 1+ ;
2 f (n) n n

o
this is an integer for n = 1, 2, 5, 10; the sum of these values is 1 + 2 + 5 + 10 = 18.

l.c
13. Each number x1 , x2 , . . . , x101 is ±1. What is the smallest positive value of ∑ xi x j ?
1≤i< j≤101

ai
Ans: We know that (a + b + c)2 = a2 + b2 + c2 + 2(ab + ac + bc) ; in general,

2
∑ xi = ∑ xi2 + 2 ∑ xi x j gm
i< j

(∑ xi )2 − ∑ xi2
(∑ xi )2 − ∑ (1) (∑ xi )2 − 101
Hence ∑ xi x j =2 2
= =
2
i< j
121 − 101
ri@

2
2
∑ xi > 101 ⇒ min ∑ xi = 121 ⇒ ∑ xi x j = 2 = 10
i< j

14. Find the smallest positive integer n ≥ 10 such that n + 6 is prime and 9n + 7 is a perfect square.
m2 − 7 m2 + 47
Ans: 9n + 7 = m2 , n ≥ 10 ⇒ m ≥ 10; n = ; n+6 = ; this must be a prime num-
ha

9 9
ber. (1)

m2 + 47 is divisible by 9; m2 ≡ −47 ≡ 7 (mod 9).

sic

The squares (mod 9) are {1, 4, 9 = 0, 16 = 7, 25 = 7, 36 = 0, 49 = 4, 64 = 1};

hence m must be 4 or 5 (mod 9).
Also m ≥ 10; hence we try m = 13, 14, 22, . . . in eq (1); we get
ra

m2 + 47 m2 + 47
m = 13 ⇒ = 24, which is not prime; m = 14 ⇒ = 27, which is not prime.
9 9
m2 + 47
na

m = 22 ⇒ = 59, which is prime; n + 6 = 59 ⇒ n = 53

9

15. In how many ways can a pair of parallel diagonals of a regular 10−sided polygon be selected?
Ans: In a 2n−sided polygon, opposite vertices can be joined to get a diameter; there are n di-
ameters. For each diameter, there are n − 1 diagonals parallel to this diameter. This gives n sets
of n − 1 parallel diagonals. (1)
Corresponding to each pair of opposite parallel sides, there are n − 2 parallel diagonals. Hence
there are n sets of n − 2 parallel diagonals, parallel to some side. (2)
The number of ways of selecting
 2  parallel
 diagonals
 is given by selecting 2 diagonals either
n−1 n−2
from (1) or from (2); hence n +n = n(n − 2)2 ; 2n = 10 ⇒ n = 5 gives 45
2 2

5
 Pre-RMO 2019

16. A pen costs Rs.13 and a notebook costs Rs.17. In 2017-18, a school spends exactly Rs. 10, 000
to buy x pens and y notebooks such that x and y are as close as possible, i.e., |x − y| is min-
imum. The next year in 2017-18, the school spends a little more than Rs. 10, 000 and buys y
pens and x notebooks. How much more did the school pay?
Ans: 13 x + 17 y = 10000; 17 y = 13 x = 10000 + a; |x − y| is minimum.

30(x + y) = 20000 + a; 4(x − y) = a ⇒ x − y = k ⇒ a = 4k (1)

m
20000 + a 20000 + 4k 2k + 10
x +y = = = 666+ ; k is the (numerically) least integer such that
30 30 15

o
this number is an integer. Hence k = 10; a = 4k = 40

l.c
17. Find the number of ordered triples (a, b, c) of positive integers such that 30a + 50 + 70c ≤ 343
Ans: 3a + 5b + 7c ≤ 34.3 ⇒ 3a + 5b + 7c ≤ 34; hence c ≤ 4; put c = 1, 2, 3, 4

ai
c = 1 gives 3a + 5b ≤ 27; b = 1 ⇒ a = (1, 2, 3, 4, 5, 6, 7); b = 2 ⇒ a = (1, 2, 3, 4, 5);
b = 3 ⇒ a = (1, 2, 3, 4); b = 4 ⇒ a = (1, 2); i.e., total 18 solutions.
gm
c = 2 gives 3a + 5b ≤ 20; b = 1 ⇒ a = (1, 2, 3, 4, 5); b = 2 ⇒ a = (1, 2, 3); b = 3 ⇒ a = 1;
total 9 solutions.
ri@

c = 3 gives 3a + 5b ≤ 13; b = 1 ⇒ a = (1, 2); b = 2 ⇒ a = 1; total 3 solutions.

c = 4 gives 3a + 5b ≤ 6; no solutions.
Total 18 + 9 + 3 = 30 ordered triples.
ha

18. How many ordered pairs (a, b) of positive integers a < b, such that 100 < a, b ≤ 1000 satisfy
the conditions gcd(a, b) : lcm(a, b) = 1 : 495
d pq
sic

Ans: Let gcd(a, b) = d; a = d p, b = dq, p < q; lcm(a, b) = d pq; = pq = 495 = 32 ×5×11

d
(p, q) = (5, 99) gives a = 5d, b = 99d; a ≥ 100 ⇒ d ≥ 20; b = (99)(20) > 1000, no solution.
(p, q) = (9, 55) gives a = 9d, b = 55d; a ≥ 100 ⇒ d ≥ 12; b = 55d ≤ 1000 ⇒ d ≤ 18;
ra

d = {12, 13, . . . , 18}; 7 solutions.

(p, q) = (11, 45) gives a = 11d, b = 45d; a ≥ 100 ⇒ d ≥ 10; b = 45d ≤ 1000 ⇒ d ≤ 22;
d = {10, 11, . . . , 22}; 13 solutions. Total 7 + 13 = 20 ordered pairs.
na

19. AB is a diameter of a circle and C is a point on segment AB such that AC : CB = 6 : 7; D is a

point on the circle such that DC ⊥ AB; DE is the diameter through D.
[ABD]
[XY Z] is the area of the triangle XY Z. Find to the nearest integer.
[CDE]
x 6 x 12
Ans: Let O be the centre of the circle; AC = x; OB = r; = ⇒ = (1)
2r − x 7 r 13
OC, OD are the medians of triangles CDE, COD; [CDE] = 2 [COD]; [ABD] = 2 [BOD]
[ABD] 2 [BOD] BO r 1 1
= = = = x = = 13.
[CDE] 2 [COD] CO r − x 1 − 12
r 1 −
13
6
 Pre-RMO 2019

20. E is the set of natural numbers n such that when n is divided by 11, 12, 13 the remainders are
distinct prime numbers in A.P; N is the largest number in E. Find the sum of the digits of N
Ans: The Chinese Remainder Theorem gives infinitely many natural numbers of this type. There
is no maximum. However, we can find the minimum N.
The possible remainders can be 3, 7, 11 or 3, 5, 7 respectively.

m
Case 1: Let n = 11a + 3 = 12b + 7 = 13c + 11; 12b + 7 = 13c + 11 ⇒ c = 4c0 ;
3b − 13c0 = 1; b = 9, c0 = 2, c = 8, n = 115 + 156k

o
n ≡ 5 + 2k ≡ 3 (mod 11); we get k = 10; N = 115 + 1560 = 1675

l.c
Case 2: Let n = 11a + 3 = 12b + 5 = 13c + 7; 12b + 5 = 13c + 7 ⇒ c = 2c0 ; 6b − 13c0 = 1;
b = 11, c0 = 5, c = 10, n = 137 + 156k ≡ 5 + 2k (mod 11); k = 10; N = 137 + 1560 = 1697

ai
The minimum possible positive integer is N = 1675

gm
21. Let E = {5, 6, 7, 8, 9}. For any partition A, B of E with both A and B non-empty, consider
the number obtained by adding the product of the elements of A to the product of the elements
of B. Let N be the largest prime among these numbers. Find the sum of the digits of N.
Ans: Let m and n be the product of the elements of A and B, respectively. mn = 5 × 6 × 7 ×
ri@

8 × 9; m + n must be prime.

m + n cannot be even; hence 6 and 8 must be in the same set of the partition.

E = {6, 8} ∪ {5, 7, 9}, m + n = 48 + 315 = 363 = 3 × 121; not prime.

ha

E = {6, 7, 8} ∪ {5, 9}, m + n = 336 + 45 = 381 = 3 × 127; not prime.

E = {6, 8, 9} ∪ {5, 73}, m + n = 432 + 35 = 467; this is prime; 4 + 6 + 7 = 17

sic

E = {6, 7, 8, 9} ∪ {5}, m + n = 3024 + 5 = 3029 = 13 × 233; not prime.

1599
1
22. What is the greatest integer not exceeding the sum √
ra

∑ n
n=1
a+b
Ans: Let S be the required sum. If a < b, we know that a < <b
2
na

√ √
√ n+ n−1 √
Hence n − 1 < < n ; take reciprocals;
2
1 2 1 1 √ √ 1
⇒√ <√ √ <√ ; rationalise ⇒ √ < n − n − 1 < √
n n+ n−1 n−1 2 n 2 n−1
Put n = 2, 3, . . . , 1600 and add the telescoping sum,
1 √ 1
√ < 2−1 < √
2 2 2 1
1 √ √ 1
√ < 3− 2 < √
2 3 .. 2 2
.
1 √ √ 1
√ < 1600 − 1599 < √
2 1600 2 1599
7
 Pre-RMO 2019

1 1 1 1
⇒ √ +...+ < 2(40 − 1) < 1 + √ + . . . + √
2 40 2 1599
1
⇒ S−1+ < 78 < S
40
1
⇒ 78 < S < 79 − ; the integer part is bSc = 78
40
1
Method 2: This is estimated in calculus as a Riemann sum in integration. The function y = √
x

m
is monotonic decreasing for x ≥ 1
Partition the interval [1, 1600] into sub-intervals [1, 2]∪[2, 3]∪. . .∪[1599, 1600] on the x−axis.

o
The area under the curve is bounded by the lower and upper Riemann sums, i.e., the sum of the

l.c
areas of the rectangles with heights at the right and left end-points of the sub-intervals respec-
tively.
1 1 1 1600 1
Z
1 1 1
√ + √ +...+ √ < √ dx < √ + √ + . . . + √

ai
2 3 1600 1 x 1 2 1599
1 √
S−1+ < [2 x]1600
1 <S gm
40
1 1
S−1+ < 2(40 − 1) < S ⇒ 78 < S < 79 − ; the integer part is bSc = 78
40 40
ri@

23. ABCD is a convex cyclic quadrilateral. P is a point in the plane of the quadrilateral such that the
sum of its distance from the vertices A, B, C, D is minimum. {PA, PB, PC, PD} = {3, 4, 6, 8}.
What is the maximum possible area of ABCD?
Ans: Let I be the point of intersection of the diagonals AC and BD. Then P = I
ha

Proof: AP +CP ≥ AC = AI +CI and BP + DP ≥ BD = BI + DI; hence

AP + BP +CP + DP ≥ AC + BD ≥ AI + BI +CI + DI; equality can hold in the triangle inequality
only when P is collinear with AC as well as BD; i.e., P = I
sic

Hence PA. PC = PB. PD ⇔ (3)(8) = (6)(4); let AP = 3, BP = 4, CP = 8, DP = 6

Let ∠ APB = θ ; then ∠CPD = 180 − θ ; sin (180 − θ ) = sin θ
1
ra

[ABCD] = [PAB] + [PBC] + [PCD] + [PDA] = (sin θ ) [(3)(4) + (4)(8) + (8)(6) + (6)(3)]
2
The maximum value of sin θ is 1, when θ = 90◦ . Hence [ABCD] is maximum only when
na

∠ APB = 90◦ , i.e., the diagonals are perpendicular to each other.

1
The maximum area is [(3)(4) + (4)(8) + (8)(6) + (6)(3)] = 55
2

24. A 1 × n rectangle, (n ≥ 1), is divided into n unit squares. Each square is coloured red, blue or
green. Let f (n) be the number of colourings of the rectangle in which there are an even number
f (9)
of red squares, (may be zero). What is the largest prime factor of ?
f (3)

n
Ans: Suppose 0 ≤ k ≤ n is even. We can select k red squares in ways. Then each of the
k
remaining n − k squares can be coloured in 2 ways, either blue or green. To find
n      
n n−k n n n−2 n n−4
f (n) = ∑ 2 =2 + 2 + 2 +... (1)
k=0 k 2 4
8
 Pre-RMO 2019

   
n n−1 n n−2 2
Put a = 2, b = 1 in the binomial expansion (a + b)n = an + a b+ a b +...
    1 2
n n n n−1 n n−2
3 =2 + 2 + 2 +... (2)
1 2    
n n−1 n n−2
Put a = 2, b = −1 in the binomial expansion; we get 1 = 2n − 2 + 2 − . . . (3)
1 2
3n + 1 f (9) 39 + 1
(2)+(3) gives f (n) = ; = = 36 − 33 + 1 = 703 = 19 × 37; the largest prime
2 f (3) 33 + 1

m
factor is 37.

o
25. A village has a circular wall around it. The wall has four gates pointing north, south, east and
west. A tree stands outside the village, 16m north of the north gate and it can be just seen ap-

l.c
pearing on the horizon from a point 48m east of the south gate. What is the diameter of the wall
that surrounds the village?

ai
Ans: Let O be the centre and let r be the radius of the circle. N and S are the north and south
poles; A, N, O, S is a straight line; let SC be perpendicular to AS where C is the observer and
let OB be perpendicular to AC. AC is tangent to the circle at B.
gm
AN = 16, NO = OS = OB = r; SC = CB = 48; let ∠ OAC = θ
p p
∆ ABO gives AB2 = OA2 − OB2 = (16 + r)2 − r2 = 32(r + 8);
ri@

OB r SC 48
tan θ = =p ; ∆ ASC ⇒ tan θ = = ; (or, use similar triangles)
AB 32(r + 8) SA 2r + 16
r 48
p = ⇒ r2 (r + 8) = (242 )(32); comparing both sides, we guess r = 24;
32(r + 8) 2(r + 8)
the two remaining roots are complex conjugates.
ha

Otherwise, this is a monic equation, r3 + 8r2 − (24)2 (32) = 0; any integer root must be a factor
of the constant term. We try r = factors of (24)2 (32) and get r = 24; the diameter is 48.
sic

26. Positive integers x, y, z satisfy xy + z = 160. Find the smallest possible value of x + yz.
Ans: Let w = x + yz; y = 1 gives w = 160; assume y ≥ 2; xy = 160 − z is not prime; hence
ra

z 6= 1, 3; since yz should be small, try z = 2, 3, etc. We get

z = 2 ⇒ xy = 158 = 79 × 2 ⇒ w|min = 79 + 4 = 83
na

z = 4 ⇒ xy = 156 = 26 × 6 ⇒ w|min = 26 + 24 = 50; this is the required minimum value.

27. A re-arrangement of the letters of a word has no ‘fixed letters’ if , when the re-arrangement is
placed directly below the word, no column has the same letter repeated. For instance, HBRATA
is a re-arrangemnt of BHARAT. How many distinguishable re-arrangements with no fixed letters
does the word BHARAT have? (The two A’s are considered identical).
Ans: A derangement is a permutation of {1, 2, . . . , n} with no fixed elements. The formula for
derangements is
(−1)n
 
j n! k 1 1
Dn = = n! 1 − + − . . . + (1)
e 1! 2! n!
The number of derangements of all 6 letters of BHARAT is
9
 Pre-RMO 2019
 
1 1 1 1 1
D6 = 720 1 − 1 + − + − + = 360 − 120 + 30 − 6 + 1 = 265
2 6 24 120 720
This is over-counting in two cases.
Case 1: Out of 2 A’s, exactly one A may be fixed;
 
1 1 1 1
D5 = 120 1 − 1 + − + − = 60 − 20 + 5 − 1 = 44
2 6 24 120  
1 1 1
Case 2: Both the A’s may be fixed; D4 = 24 1 − 1 + − + = 12 − 4 + 1 = 9

m
2 6 24
1
Hence the number of derangements with repetitions is [265 − 44 − 44 − 9] = 84
2

o
Method 2: Direct counting without the derangement formula.

l.c
 
4
The original A’s can be put in 4 other places in = 6 ways. (1)
2
Case1: Suppose R is put in the last place of T. The remaining 3 letters must be placed in 3

ai
positions. This can be done in 3! = 6 ways. (2)
Case 2: Suppose R goes in the place of one of the A’s, i.e., R has 2 choices. Then T has 2
gm
places (i.e., except T); B and H have the remaining 2! = 2 choices. Total 2 × 2 × 2 = 8 choices.
(3)
Total (1)x[(2)+(3)] = 6 (6 + 8) = 84 ways.
ri@

28. A triangle ∆ ABC has sides 51, 52, 53. Let ω be the in-circle. Draw tangents to ω which are
parallal to the sides; r1 , r2 , r3 are the in-radii of the three corner triangles. Find br1 + r2 + r3 c
Ans: The sides of ∆ ABC as well as the sides of the corner triangles are tangent to the in-circle;
hence the corresponding sides are parallel; hence they are all similar.
ha

Step 1: Let a = BC = 51, b = CA = 52, c = AB = 53; to find the in-radius of ∆ ABC.

a+b+c
s= = 78; [ABC] = rs = 78r; also, by Heron’s formula,
sic

2
p p
[ABC] = s(s − a)(s − b)(s − c) = (78)(27)(26)(25) = (26)(9)(5) = 78r ⇒ r = 15 (1)

Step 2: To prove that r1 + r2 + r3 = r

ra

Let D, E, F, G, H, I be the points of contact of the in-circle with the sides, taken in anti-
clockwise order on BC, CA, AB. Suppose the in-radii of the triangles AHG, BDI, CFE, ABC
na

are r1 , r2 , r3 , r respectively. Let GH = p, DI = q, EF = s; let h1 , h2 , h3 be the altitudes from

A, B, C respectively.
     
r1 p h1 − 2r pr 2r qr 2r sr 2r
= = ⇒ r1 = = r 1− ; r2 = = r 1− ; r3 = = r 1−
r 51 h1 51 h1 52 h2 53 h3
    
2r 2r 2r r r r
r1 + r2 + r3 = r 1 − + 1 − + 1 − = r 3−2 + +
h1 h2 h3 h1 h2 h3
1 r 51
But [ABC] = rs = .(51)(h1 ) ⇒ = etc.
2 h1 2s
     
51 52 53 2s
Hence r1 + r2 + r3 = r 3 − 2 + + = r 3−2 = r = 15
2s 2s 2s 2s

10
 Pre-RMO 2019

29. In ∆ ABC the median AD, with D on BC, and the angle bisector BE ẇith E on AC, are per-
pendicular to each other. AD = 7, BE = 9. Find the integer nearest to the area of ∆ ABC.
7
Ans: Suppose AD and BE intersect at P. ∆ APB ∼ = ∆ DPB, (AAS); AP = PD =
2
1 AE AB 1 AE 1
In ∆ ABD, AB = BD = BC and BE bisects ∠ B. Hence = = ⇒ = (1)
2 EC BC 2 AC 3
1 1 7 63
[ABE] = BE. AP = . 9. =

m
2 2 2 4
The triangles ABE and ABC have a common vertex and collinear bases; hence the ratio of their
areas is equal to the ratio of their bases.

o
[ABE] AE 1 63 189

l.c
= = , using (1); [ABC] = 3. = = 47.25; the nearest integer is 47.
[ABC] AC 3 4 4

30. E is the set of all natural numbers 3 < n < 1000 such that the set {1, 2, . . . , n} can be parti-

ai
tioned in 3 subsets with equal sums. Find the number of elements in E.
n(n + 1)
Ans: The total sum of all the natural numbers from 1 to n is
gm ; this must be a multiple
2
of 3.
Hence, n = 3k or n = 3k + 2; n ∈ {6, 9, . . . , 99} ∪ {5, 8, . . . , 98}; i.e., 32 + 32 = 64 values of n.
But we still have to prove that, for each of these values, there exists a partition into three equal-
ri@

sum parts.
Proof: For n = 5, we have the partition {1, 2, 3, 4, 5} = {1, 4} ∪ {2, 3} ∪ {5}.
Let n ≥ 6 and S = {1, 2, . . . , n}; let n(n + 1) = 6k (1)
ha

There is a ‘greedy algorithm’. A = {n, n − 1, . . . , n − p, r}, where p is maximum such that

n + (n − 1) + . . . + (n − p) ≤ k and r is taken so that the group-sum of A is k.
For B, we start with the largest element of S which is not in A and repeat the process; then C
sic

is taken as S − A − B.

Example: Let n = 98; k = 49 × 33 = 1617; we have the partition S = {1, 2, . . . , 98} = A ∪ B ∪C

ra

where

A = {98, 97, . . . , 81, 6}; B = {80, 79, . . . , 58, 30}; C = S − A − B

na

The general solution is from an older Russian Olympiad.

All Soviet Union Mathematics Contest, 1988: Let 1 + 2 + . . . + n = mk, where m, n, k are
positive integers and m ≥ n.
Then S = {1, 2, . . . , n} has a partition into k subsets such that the sum of the elements in each
subset is equal to m.
Proof: Induction on n.
 
n−1 n+1
Suppose m = n and n is odd; take S = {1, n − 1} ∪ {2, n − 2} ∪ . . . ∪ ,
2 2
nn n o
Suppose m = n + 1 and n is even; take S = {1, n} ∪ {2, n − 1} ∪ . . . ∪ , +1
2 2

11
 Pre-RMO 2019

Suppose n + 1 < m < 2n and suppose the statement is true for all integers which are less than or
equal to m − 1.
If m is odd, the induction hypothesis on {1, 2, . . . , m − n − 1} together with
 
m−1 m+1
{m − n, n} ∪ {m − n + 1, n − 1} ∪ . . . ∪ , will give the required partition.
2 2
If m is even, the induction hypothesis on {1, 2, . . . , m − n − 1} gives a partition with

m
m m
each group-sum equal to and together with must be a multiple of m;
2 2
m
hence the groups summing to can be partitioned into pairs summing to m; this together with

o
2 nm m o
{m − n, n} ∪ {m − n + 1, n − 1} ∪ . . . ∪ − 1, + 1 will give the required partition.
2 2

l.c
Suppose m ≥ 2n. {n − 2k + 1, n} ∪ {n − 2k + 2, n − 1} ∪ . . . ∪ {n − k, n − k + 1} has group-sum
2n − 2k + 1

ai
2n(n + 1)
Then (m − 2n)(m − n − 1) ≥ 0 ⇒ m − 3n + 1 + ≥ 0;
m
gm
m − 3n + 1 + 4k ≥ 0 ⇒ m − 2n + 2k − 1 ≥ n − 2k

Hence, the induction hypothesis on {1, 2, . . . , n−2k} gives a partition into k groups with group-
sum m − 2n + 2k − 1.
ri@

This completes the induction.

ha
sic
ra
na

12
 Pre-RMO 2019

PRE RMO 2019 -2

j √ 1k
1) Consider the sequence an = n + 2n + . If the missing numbers are n1 < n2 < . . ., find n12
2
Ans: a1 = 2; a2 = 4; a3 = 5; a4 = 7; a5 = 8; a6 = 9; a7 = 11.
n(n + 1)
The missing numbers are {1, 3, 6, 10, . . .}; i.e., the triangular numbers given by Tn = .
2
12 × 13

m
n12 = T12 = = 78
2
√ √ 
Proof: Let i ≤ 2n < i + 1, i.e., i = 2n (1)

o
i2 (i + 1)2
≤n<

l.c
(2)
2 2
i2 + 2i 1 √ 1 (i + 1)(i + 2) 1
Adding (1) and (2), we get, + ≤ n + 2n + < +
2 2 2 2 2

ai
i(i + 1) (i + 1) 2 √ 1 (i + 1)(i + 2) 1
Hence < ≤ n + 2n + < + (3)
2 2 2 2 2
√ 1 (i + 1)(i + 2) gm √ √
2
Also, if n + 2n + = , then 2n ∈ Q; also (i + 1)(i + 2) = 2n + 1
2 2
(i + 1)(i + 2) is an integer which is the square of a rational, hence it is the square of an in-
teger; but this is impossible, since it lies strictly between two consecutive squares, namely,
ri@

(i + 1)2 < (i + 1)(i + 2) < (i + 2)2 .

i(i + 1) (i + 1)(i + 2)
(3) ⇒ < an < , i.e., an lies between two consecutive triangular numbers.
2 2
Hence an can never be a triangular number.
ha

√ √ √
2) x = 2 + 3 + 6 is a root of the equation x4 + ax3 + bx2 + cx + d = 0 where a, b, c, d are
integers, find | a + b + c + d |
√ √ √ √ √
sic

Ans: (x − 6)2 = ( 2 + 3)2 ⇒ x2 − 2 6 x + 6 = 5 + 2 6

√
⇒ x2 + 1 = 2 6 (x + 1) ⇒ x4 + 2x2 + 1 = 24(x2 + x + 1) ⇒ x4 − 22x2 − 48x − 23 = 0

⇒ | 0 − 22 − 48 − 23 | = 93
ra
na

3) Find the number of positive integers less than 101 that cannot be written as the difference of
two squares.
Ans: If n is odd, n = 2m + 1 = (m + 1)2 − m2 ; if n is a multiple of 4, then
4m = (m + 1)2 − (m − 1)2 .
For any square, m2 = 0 or 1 (mod 4); hence m2 − n2 = 0 − 1 = 3 (mod 4), or 1 − 0 = 1, or
1 − 1 = 0 (mod 4). Hence the required numbers form the set S = {4k + 2} = {2, 6, . . . 98};
n(S) = |S| = 25

4) Define a1 = 24 and an = 100an−1 +134. The first few terms are 24, 2534, 253534, 25353534, . . ..
What is the least value of n for which an is divisible by 99?

Ans: n is divisible by 9 if and only if the sum of the digits of an , i.e.,

13
 Pre-RMO 2019

2 + 4 + 8(n − 1) = 8n − 2 = 0 (mod 9); 8n − 2 = (−1)n − 2 = 0 ⇒ n = 7 mod 9. (1)

For divisibility by 11 we have the alternating sum of the digits, i.e.,

(2 − 4) + (−5 + 3)(n − 1) = −2n is divisible by 11; hence n = 0 (mod 11). (2)

The least multiple of 11 which is congruent to 7 modulo 9 is 88.
11 2 1
We can also solve (1) and (2) using the continued fraction = 1+ = 1+ ;

m
9 9 1
4+
2
1 5
the penultimate convergent gives 1 + = ; 9(5) − 4(11) = 1

o
4 4
The Chinese Remainder theorem gives n = 9(5)(7) + (−4)(11)(7) = 7

l.c
⇒ n = 7(−4)(11) = −308 + 99k; to get a positive value, put k = 4 ⇒ n = −308 + 396 = 88

ai
5) Let N be the smallest positive integer such that N + 2N + . . . + 9N is a number all of whose
digits are equal. What is the sum of the digits of N?
gm
Ans: 45 N = kk · · · k a number with all equal digits. This is a multiple of 5. Hence k = 5;
9N = 11 · · · 1, with all digits equal to 1.
The smallest multiple of 9 with all equal digits to 1 must have nine 1’s;
ri@

111111111 = 9 × 12345679; the sum of the digits of N is 1 + 2 + 3 + 4 + 5 + 6 + 7 + 9 = 37

6) AB = AC in ∆ ABD. Suppose the tangent at B to the circumcircle of the triangle is perpendicular

to BC. Find ∠ ABC in radians.
ha

Ans: The tangent at B is perpedicular to the radius OB, where O is the circumcentre. Also, the
tangent at B is perpendicular to AC. Hence AC k OB.
sic

O lies outside ∆ ABC; ∠ A > 90◦ or ∠C > 90◦ ; suppose ∠ A > 90◦
Suppose the tangent at B intersects CA extended at K; ∠ KBA = ∠ ACB = ∠ ABC = θ .
ra

In ∆ KCB we have ∠ BKC = 90◦ ; θ + 2 θ = 90◦ ⇒ θ = 30◦

na

7) Let s(n) be the sum of the digits of a positive integer n in base 10. If s(m) = 20 and
s(33m) = 120, find s(3m)
Ans: s(a + b) ≤ s(a) + s(b); equality holds only when there is no carry-over in the addition.
s(a1 + a2 + . . . + an ) ≤ s(a1 ) + s(a2 ) + . . . + s(an ). Hence s(na) ≤ n s(a); s(10a) = s(a).

s(33m) ≤ s(30m) + s(3m); 120 ≤ 2 s(3m) ⇒ s(3m) ≥ 60 (1)

Also, s(3m) ≤ 3 s(m) = 3(20) = 60 (2)
Hence s(3m) = 60

14
 Pre-RMO 2019

8) Let Fk (a, b) = (a + b)k − ak − bk ; S = {1, 2, . . . , 10}. For how many ordered pairs (a, b) ∈ S
F5 (a, b)
with a ≤ b, is an integer?
F3 (a, b)

Ans: F3 (a, b) = (a + b)3 − a3 − b3 = 3a2 b + 3ab2 = 3ab(a + b)

The binomial expansion gives (a + b)5 = a5 + 51 a4 b + 52 a3 b2 + 53 a2 b3 + 54 ab4 + b5

m
= a5 + 5a4 b + 10a3 b2 + 10a2 b3 + 5ab4 + b5

F5 (a, b) = (a + b)5 − a5 − b5 = 5ab(a3 + b3 + 2a2 b + 2ab2 )

o
= 5ab[(a + b)(a2 − ab + b2 ) + 2ab(a + b)] = 5ab(a + b)(a2 + ab + b2 )

l.c
F5 (a, b) 5 (a2 + ab + b2 )
= . This is an integer if and only if a2 + ab + b2 is a multiple of 3;
F3 (a, b) 3

hence a3 = b3 (mod 3); hence a = b = 0 or a = b = 1 or a = b = 2 (mod 3); S = {1, 4, 7, 10}∪

ai
{2, 5, 8} ∪ {3, 6, 9}.
gm
If we select a = b then there are 10 ways. If we select two distinct elements, a < b, both must
be from the same congruence class modulo 3; there are 32 + 42 + 32 = 3 + 6 + 3 = 12 ways.

Total 22 ordered pairs.

ri@

9) The centre of a circle passing through the mid-points of the sides of a triangle ∆ ABC lies on
the circumcircle of ∆ ABC. If the larger angle of ∆ ABC is α ◦ and the smaller one is β ◦ , find
α −β.
Ans: Let D, E, F be the mid-points of BC, CA, AB respectively. EF k BC;
ha

the perpendicular bisector of EF is also the perpendicular bisector of BC, i.e., OAD.
Given, the circumcentre of ∆ DEF lies on the circumcircle of ∆ ABC; hence OA intersects this
sic

circumcircle at A; A is the circumcentre of ∆ DEF; hence AD = AE = AF; the circumradius of

the medial triangle ∆ DEF is half that of ∆ ABC ; i.e., AD = AE = AF = R/2 (1)
Also, DF is the median of the right-angled triangle ∆ ADB; hence AF = FB = DF (2)
ra

A
(1) and (2) give AD = DF = AF; ∆ AFD is equilateral; hence ∠ FAD = = 60◦
2
◦ ◦
⇒ ∠ A = α = 120 ; ∠ B = C = β = 30 ; α − β = 90 ◦
na

10) One day I went for a walk at x minutes past 5o clock, where x is a two-digit number. When
I returned, it was y minutes past 6o clock and I noticed that i) I walked exactly for x minutes
and ii) y was a two-digit number obtained by reversing the digits of x. How many minutes did
I walk?
Ans: x = 10a + b where 1 ≤ a, b ≤ 9; consider the difference between 5(60) + 10a + b and
6(60) + 10b + a; i.e., 60 + 9b − 9a = 10a + b ⇒ 19a = 8b + 60; this gives a = 4, b = 2; i.e., 42
minutes.

15
 Pre-RMO 2019

11) Find the largest value of ab such that the positive integers a, b > 1 satisfy ab ba +ab +ba = 5329.
Ans: Add 1 on both sides and factorise; (ab + 1)(ba + 1) = 5330 = 2 × 5 × 13 × 41
Integer solutions come from ab + 1 = 65 and ba + 1 = 82, (or vice versa). Hence

ab = 64, ba = 81; the largest value is 81.

m
12) Let N be the number of ways of choosing a subset of 5 distinct numbers from

S = {10a + b : 1 ≤ 5, 1 ≤ b ≤ 5}, where a and b are integers such that

o
no two of the selected numbers have the same units digit and no two have the same tens digit.

l.c
What is the remainder when N is divided by 73?
Ans: The 5 numbers must belong to distinct subsets of the partition

ai
S = {11, 12, 13, 14, 15} ∪ {21, 22, 23, 24, 25} ∪ . . . ∪ {51, 52, 53, 54, 55}
47 gm
There are 5! = 120 = 1 + ways; hence the answer is 47.
73

13) Consider the sequence {1, 7, 8, 49, 50, 56, 57, 343, . . .}
which consists of sums of distinct powers of 7; i.e., 70 , 71 , 70 + 71 , 72 , . . . in increasing order.
ri@

At what position will 16856 occur in this sequence?

Ans: We get the expnasion of N = 16856 to base 7. The highest power of 7 less than N is
75 = 16807; N = 75 + 49 = 75 + 72
ha

Observe the positions of the numbers, arranged in increasing order.

Number Position
70 = 17 1 = 20 = 12
sic

71 = (10)7 2 = 21 = (10)2
71 + 70 = (11)7 3 = 20 + 21 = (11)2
72 = (100)7 4 = 22 = (100)2
ra

We are converting the base-7 expansion of N to the binary expansion of the position. Hence the
final answer will be
na

75 + 72 = (100100)7 25 + 22 = 32 + 4 = 36 = (100100)2

14) Let R be the circular region in the xy−plane bounded by the circle x2 + y2 = 36. The lines
x = 4 and y = 3 divide R into 4 regions R1 , R2 , R3 , R4 . If [Ri ] denotes the area of the region
Ri and [R1 ] > [R2 ] > [R3 ] > [R4 ], find [R1 ] − [R2 ] − [R3 ] + [R4 ]
Ans: R1 is the bottom left part of the disc; R4 is the top right part. R2 and R3 are the top left
and bottom right parts. Actually, [R2 ] > [R3 ]; but the order of R2 and R3 is not relevant in this
question.
Reflect R2 in the x−axis and subtract from R1 to get a region I
Reflect R4 in the x−axis and subtract from R3 to get a region II
Reflect II in the y−axis and subtract from I; this is the required area.
16
 Pre-RMO 2019

But this is the rectangle bounded by the lines x = ±3 and y = ±4

Hence [R1 ] − [R2 ] − ([R3 ] − [R4 ]) = 6 × 8 = 48

15) In base −2 notation, digits are only 0 and 1 and the places go up in powers of −2. For exam-
ple, 11011 = (−2)4 + (−2)3 + (−2)1 + (−2)0 = 7 in base 10. If the decimal number 2019 is
written in base −2, how many non-zero digits does it contain?

m
Ans: (−2)11 = −2048; (−2)12 = 4096; 2019 = 2048 − 29 = 4096 − 2048 − 29

= (−2)12 + (−2)11 + (−2)5 + 4 − 1 = (−2)12 + (−2)11 + (−2)5 + (−2)2 + (−2)1 + (−2)0

o
= (1100000100111) in base −2; there are 6 non-zero digits.

l.c
√
16) Let N be the set of all natural numbers n such that n is divisible by a prime p > n and

ai
p < 20. What is the value of N?
Ans: n < p2 < 400; n = pi, i < p ⇒ 1 ≤ i ≤ p − 1
gm
For every prime p we get p − 1 positive integers; total ∑(p − 1) : 2 ≤ p < 20 over the 8
primes, {2, 3, 5, 7, 11, 13, 17, 19}

(2 + 3 + 5 + 7 + 11 + 13 + 17 + 19) − 8 = 69
ri@

17) Let a, b, c be distinct positive integers such that b + c − a, c + a − b, a + b − c are all perefect
squares. What is the largest possible value of a + b + c smaller than 100?
Ans: b + c − a = x2 , c + a − b = y2 , a + b − c = z2 ; x2 + y2 = 2c, y2 + z2 = 2a and x2 + z2 = 2b;
ha

a + b + c = x2 + y2 + z2 .

x2 + y2 , y2 + z2 , z2 + x2 are distinct even numbers. Hence, either they are all odd or they are all
even; x2 + y2 + z2 is either 0 or 3 or 4 mod 8, since it cannot be 7 mod 8.
sic

Lagrange’s three squares theorem says that a natural number n cannot be written as a sum of
three squares if and only if n = 4k (8m+7); k, m ≥ 0; e.g., 92 = 4(23) is not a sum of 3 squares.
ra

a + b + c < 100 ⇒ x, y, z are at most 10 each. The possible sums of 3 squares are
99 = 49 + 49 + 1, (not distinct); 96 = 64 + 16 + 16; 91 = 81 + 9 + 1 is the largest possible
na

number required in this problem; it gives x = 9, y = 3, z = 1; a = 5, b = 41, c = 45

18) What is the smallest prime p such that p3 + 4p2 + 4p has exactly 30 divisors.
Ans: p = 2 ⇒ p(p + 2)2 = 32 = 25 ; this has 6 divisors. Any natural number has a unique
factorisation as a product of prime powers; n = pe11 pe22 · · · pekk ; then the number of dvisors of n
is given by d(n) = (e1 + 1)(e2 + 1) · · · (ek + 1)

p is an odd prime; hence p + 2 is odd; let p + 2 = 3k 5l ; d(p + 2) = (k + 1)(l + 1) = 15

Hence k = 2, l = 1; the smallest value is p + 2 = (32 )(5) = 45 ⇒ p = 43

17
 Pre-RMO 2019

19) The medians BE and CF of ∆ ABC have lengths 9 and 15 respectively. Find the maximum
possible area of the triangle, to the nearest integer.
Ans: Let G be the centroid of ∆ ABC. Then GB : GE = GC : GF = 2 : 1; hence
2 2
BG = BE = 6, CG = CF = 10.
3 3
The medians divide the triangle into 6 equal parts. Hence the areas are given by

m
1
[GBC] = [GAB] = [GCA] = [ABC]
3
1 1

o
But [GBC] = GB. GC. sin (BGC) ≤ . 6. 10 = 30; hence [ABC] ≤ 90. Equality holds only
2 2
when ∠ BGC = 90◦

l.c
20) How many 4−digit numbers abcd are such that a < b < c < d and b − a < c − b < d − c?
Ans: a 6= 0 ⇒ 1 ≤ a < b < c < d ≤ 9; a ≥ 1, b ≥ 2, c ≥ 3, d ≥ 4; also b−a < c−b ⇒ c > 2b−a;

ai
similarly, d > 2c − b.
The possibilities are (1, 2, 4, 7), (1, 2, 4, 8), (1, 2, 4, 9), (1, 2, 5, 8), (1, 2, 5, 9), (2, 3, 5, 8)
gm
(2, 3, 5, 9), (3, 4, 6, 9). There are 7 numbers.
21) (Bonus) Let E be the set of all positive integers n which when divided by 9, 10, 11 respec-
tively, leave remainders which form a non-constant geometric progression. If N is the largest
ri@

element of E, find the sum of the digits of N.

Ans: The remainders in G.P. must be positive integers√(a, b, c) = (a, ar, ar2 ) ; hence r = p/q
is rational; (p, q) = 1; hence a ≥ 1; ar2 ≤ 10 ⇒ r ≤ 5; c = ap2 /q2 ⇒ q2 divides a; hence
q = 1, 2 and p = 1, 3; r = 1/2, 1/3, 2/3, 3/2, 2, 3; (a, b, c) = (1, 2, 4), (2, 4, 8) or (4, 6, 9)
ha

By the Chinese Remainder Theorem, there are (usually) infinitely many positive integers which
leave given remainders mod finitely many integers. The set E has no maximum. This problem,
as stated, is wrong.
sic

However, we can find the minimum element of E.

Case 1: N = 2 (mod 9); N = 4 (mod 10); N = 8 (mod 11).
For the first two conditions, the CRT gives 10(1) − 9(1) = 1 ⇒ N = 2(10) + 4(−9) = −16 = 74
ra

(mod 90); this itself satisfies the third congruence, N = 8 (mod 11).
Case 2: N = 4 (mod 9); N = 6 (mod 10); N = 9 (mod 11).
na

For the first two conditions, 10(1) − 9(1) = 1 ⇒ N = 4(10) + 6(−9) = −14 = 76 (mod 90).
To solve N = −14 (mod 90) and N = 9 (mod 11)
90 2 1 1 41
The continued fraction is = 8+ = 8+ ; the penultimate convergent is 8 + =
11 11 1 5 5
5+
2
11(41) − 90(5) = 1; the CRT gives N = (−14)(11)(41) + 9(−90)(5) = −10364
N = 526 mod 990; N = 526 is the smallest positive solution in this case.

(a, b, c) = (1, 2, 4) gives N = 532; (a, b, c) = (4, 2, 1) gives N = 562

(a, b, c) = (1, 3, 9) gives N = 73; (a, b, c) = (6, 4, 2) gives N = 134

18
 Pre-RMO 2019

22) In a parallelogram ABCD, AC = 10, BD = 28. The points K, L in the plane of ABCD move
in such a way that AK = BD and BL = AC. let M and N be the mid-points of CK and DL
respectively. Find the maximum value of cot2 (∠ BMD /2) + tan2 (∠ ANC /2)
Ans: Take ABCD in order, in the clock-wise direction. Extend CD to K 0 so that CD = DK 0 .
Then BDK 0 A is a parallelogram, since BA is equal and parallel to DK 0 .
Hence AK 0 = BD; draw a circle with centre A and radius BD which intersects CD produced

m
at K 0 and CB produced at K 00 .

∠ DAK 0 + ∠ BAK 00 + ∠ BAD = 180◦ ⇒ K 0 AK 00 is a diameter; ∠ K 0 KK 00 = 90◦ . (1)

o
Let K be any point on this circle. Then M is the mid-point of CK and D is the mid-point of

l.c
CK 0 ; hence MD k KK 0

DB k K 0 K 00 ; hence B is the mid-point of CK 00 ; ∆ BMD ∼ ∆ K 00 KK 0 ; from 1) we get

ai
∠ BMD = 90◦ ; similarly, ∠ ANC = 90◦ ; cot2 (BMD /2) + tan2 (ANC /2) = 1 + 1 = 2

gm
23) Let t be the area of a regular pentagon with each side equal to 1. Let P(x) = 0 be the poly-
nomial of least degree with integer coefficients having the gcd of all its coefficients equal to 1
which is satisfied by t. If M is the sum of the
√ absolute values of the coefficients of P(x), find
√ 5−1
the integer closest to M. Take sin (18◦ ) =
ri@

2
√
5−1
Ans: The correct value is sin (18◦ ) = ; anyway it is not required in the problem.
4
Let O be the centre of the pentagon. Let A, B be two consecutive vertices. The central angle is
2π 2π
∠ AOB = θ = = = 72◦
ha

n 5
θ
Drop AD perpendicular to AB; OA = OB = r = 1; AB = a = 1; ∠ AOB = = 36◦ ;
2
sic

θ AD a a π ah a 2 π
tan = = ⇒ h = cot ; the area is [ABC] = = cot ; the area of the polygon is
2 OD 2h 2 n 2 4 n
n a2 π 5 5
t= cot ; n = 5, a = 1, gives x = t = cot 36◦ ; tan 36◦ = (1)
4 n 4 4x
ra

To find the minimal polynomial of tan α with α = 36◦ , we have a standard procedure.
na

tan (2α + 3α) = tan 180◦ = 0

2 tan α tan3 α − 3 tan α

⇒ 2
= 2
⇒ tan4 α − 10 tan2 α + 5 tan α = 0 (2)
1 − tan α 1 − 3 tan α
5
But eq (1) gives tan α = ; hence 256 x4 − 800 x2 + 125 = 0; this is the required minimal poly-
4x
nomial.
√
M = 256 + 800 + 125 = 1181; (34)2 = 1156; (34.5)2 = 1190.25; integer closest to M is 34.
p √
Note: We can solve eq(2) as a quadratic for x < 1; we get x = tan 36◦ = 5 − 2 5

19
 Pre-RMO 2019

24) For n ≥ 1 let an be the number beginning with n nines followed by 744. For example,
a4 = 9999744. Define f (n) = max{m ∈ N : 2m | an }. Find f (1) + f (2) + . . . + f (10)
Ans: a1 = 9744 = 10, 000 − 256 = 104 − 28 = 24 (54 − 24 ) ⇒ f (1) = 4
a2 = 99744 = 105 − 28 = 25 (54 − 23 ) ⇒ f (2) = 5
h i
8 8 8
 2 8
 8 2 8
4 16
f (3) = 6; f (4) = 7; a5 = 10 −2 = 2 (2 + 1) − 1 = 2 1
+ 8 (2 ) + 2 2 + . . . + 2 − 1

⇒ f (5) = 8 + 5 = 13

m
n = 6 ⇒ a6 = 109 − 28 = 28 × (odd) ⇒ f (6) = 8; f (n) = 8, for n ≥ 6

o
The required sum is 4 + 5 + 6 + 7 + 13 + (8)(5) = 75

l.c
25) ∆ ABC is an isosceles triangle with AB = AC. A trisector of ∠ B meets AC at D. If AB, AC, BD
are integers and AB − BD = 3, find AC.

ai
Ans: Let M be the mid-point of AC; let BD = k ∈ N; AB = k + 3
∠ ABD = 2 θ ; ∠ DBM = θ ; ∠ MBC = 3 θ gm
BM BM
cos 3 θ = cos ABM = and cos θ = cos DBM =
AB BD
cos 3θ BD k 3
= = ; (k +3) (4 cos2 θ −3) = (k +3) (1−4 sin2 θ ) = k ⇒ sin2 θ = ∈Q
cos θ AB k + 3 4(k + 3)
ri@

AM
sin 3θ = sin ABM = ; AM = (k + 3) sin 3θ ; AC = 2 AM = 2(k + 3) sin 3θ
AB
= 2(k + 3) sin θ (3 − 4 sin2 θ ) ∈ N; but sin2 θ ∈ Q
r
k+3
Hence sin θ ∈ Q ⇒ is rational; (k + 3) v2 = 3 u2 , for some co-prime integers u and v.
ha

3  
2 2 1 1
Hence k is a multiple of 3; k + 3 = 3n , for some integer n; AC = 2 (3n ) . . 3 − 2
2n n
3
sic

AC = 9n − ∈ N
n
Hence n divides 3; n = 1 or n = 3; but n = 1 ⇒ k = 0, impossible; hence n = 3;
ra

k + 3 = 27 ⇒ k = 24; AC = 9(3) − 1 = 26
na

20
 Pre-RMO 2019

26) A friction-less board has the shape of an equilateral triangle of length 1 meter with bouncing
walls along the sides. A tiny super-bouncy ball is fired from vertex A towards BC. The ball
bounces off the board nine times before it hits a vertex for the first time. The bounces are such
that the angle of incidence is equal to the angle of reflection. The distance travelled by the ball
√
in metre is of the form N, where N is an integer. Find N
Ans: We use the idea used in the Schwarz reflection principle. (See the book ‘What is Mathemat-
ics’, by Courant and Robbins). Fold the triangle at every reflection to get the following diagram

m
of 12 points:

o
A1 , A2 , A3 , A4 , A5 , A6 are collinear;

l.c
B1 , B2 , B3 , B4 , B5 , B6 are collinear; these two lines are parallel; B1 = B, B2 = C; all the twelve
triangles Ai BiCi and Ai Bi+1 Ai+1 , for i ≥ 1 are equilateral, with each side equal to 1.
This gives a parallelogram with adjacent sides 5 and 1 and included angle 60◦ . The required

ai
distance is the diagonal B1 A6 .
−−→ −−→ −−→
B1 A6 = B1 A1 + A1 A6 ; hence (B1 A6 )2 = 12 + 52 + 2(1)(5) cos 60 = 1 + 25 + 6 = 36 ⇒ B1 A6 = 6
gm
27) A conical glass is in the shape of a right circular cone. The slant height is 21 and the radius of
the top rim of the glass is 14. An ant at the mid-pointof a slant line on the outside wall of the
ri@

glass sees a honey drop diametrically opposite to it on the inside wall of the glass.If d is the
shortest distance it should crawl to reach the honey drop, what is the integer part of d? (Ignore
the thickness of the glass).
Ans: Suppose the ant crawls from its position A on the outside of the glass to a point C on the
rim, then along the inside of the glass to the honey drop at B. Let O be the vertex of the cone.
ha

AC = x, CB = y; let ∆ A0 OC0 be the rotation of ∆ AOC through 120◦ , anticockwise. The full
circle of radius 21 subtends 360◦ at O; the circle of radius 14 becomes an arc which subtends
sic

14
× 360 = 240◦ at O; since A and B are diametrically opposite each other, we get
21
∠ AOB = 120◦ , where O is the vertex of the cone.

O0 = B; ∠COC0 = 120◦ ; CO = C0 O = 21; the cosine rule gives

ra

√
 
02 −1
2 2
CC = 21 + 21 − 2(21)(21) = 3(21)2 ⇒ CC0 = 21 3; AC = A0C0 = BC0 = x
2
na

√
CB + BC0 ≥ CC0 ⇒ x + y ≥ 21 3 ≈ 36.3; this is the minimum distance that the ant must travel.
The integer part is 36.
Note: The equation PA + PB = constant is an ellipse with A and B as the foci. The minimum
is achieved when we move this ellipse so that it is tangent to the circumference of the rim of the
cone. Hence they have a common normal at the point of contact C in the answer. We know
that the normal at any point of an ellipse bisects the angle APB; i.e., any ray from a focus gets
reflected from the boundary of the ellipse such that the reflected ray passes through the other
focus; hence the final point C is such that ∠ ACO = ∠ BCO = 60◦

21
 Pre-RMO 2019

28) In a triangle ABC ∠ A = 100◦ and AB = AC. The internal angle bisector BD has length 20
units. Find the length of BC to the nearest integer, given sin 10◦ ≈ 0.174
AD BD
Ans: B = C = 40◦ ; ∠CBD = 20◦ ; ∠CDB = 120◦ ; the sine rule in ∆ BDC ⇒ = ;
sin 120 sin 40
20(sin 60)
hence BC = ; compute cos 20 = 1 − 2 sin2 10 = 1 − 2(0.174)2 = 0.9394;
sin 40
20(3 sin 20 − 4 sin3 20) 20(4 cos2 20 − 1)
BC = = = 20 [2(0.9394) − 0.5322] = 26.9;

m
2 sin 20 cos 20 2 cos 20
the nearest integer is 27.

o
29) Let ∆ ABC be an acute-angled triangle with AB = 15, BC = 8. Let D be a point on AB such

l.c
that BD = BC. Consider points E on AC such that ∠ DEB = ∠ BEC. If α denotes the product
of all possible values of AE, find bαc, the integer part of α.

ai
Ans: AD = 7; BD = 8, BC = 8. The sine rule gives
BD BE BC BE
= ; also = gm
sin BED sin BDE sin BEC sin BCE
Given, BD = BC and ∠ BED = ∠ BEC; hence sin BDE = sin BCE; hence these two angles are
equal or supplementary. Let E1 and E2 be the two possible positions of E.
Case 1: Suppose ∠ BDE = ∠ BCE; then the triangles ABE and CBE are congruent, (AAS);
ri@

hence BE is the angle bisector.

AE AB 15 AE1 15
= = ⇒ = (1)
EC BC 8 AC 23
Case 2: Suppose ∠ BDE + ∠ BCE = 180◦ ; then BDEC is a cyclic quadrilateral. E is the point
ha

of intersection of the circumcircle of ∆ BCD with AC.

The power of the point A gives AD. AB = AE2 . AC = (7)(15) = 105 (2)
1575
sic

Multiplying (1) and (2), we get the product of the values, α = AE1 . AE2 = ≈ 68.4;
23
bαc = 68
ra

 1
x + bxc + x +
30) A is the set of all non-negative real numbers such that {x} = 2
20
na

Let S be the sum of the elements of A; find bSc

Ans: Let x = i + f , where i = bxc= the integer part and f = x − bxc = the fractional part of x.
1  1 19
Case 1: If 0 ≤ f < , we get x + = i; 20 f = 3i + f ; 3i = 19 f ; i < ⇒ i = 0, 1, 2, 3 and
2 2 6
3i 22 44 66
f = ; x = 0, , , (1)
19 19 19 19
1  1 19 f − 1
Case 2: If ≤ f < 1, we get x + = i + 1; 19 f = 3i + 1; i = ;
2 2 3
19 17 19 f − 1 3i + 1 10 13 16
≤ 19 f < 19 ⇒ ≤ = i < 6 ⇒ i = 3, 4, 5; f = = , , ;
2 6 3 19 19 19 19
7 13 16
x = 3 + , 4 + , 5 + ; adding these values with those in (1), we get S = 21
19 19 19
22