REGIONAL MATHEMATICAL OLYMPIAD MOCK TEST-2

REGIONAL MATHEMATICAL OLYMPIAD

MOCK TEST–2
TARGET RMO
Instructions: Time : 3 Hours
Ÿ Calculators (in any form) and protractors are not allowed.
Ÿ Rulers and compasses are allowed.
Ÿ Answer all the questions.
Ÿ All questions carry equal marks.
Ÿ Answer to each question should start on a new page. Clearly indicate the
question number.
1. Let ABC be a triangle. Let r and s be the angle bisectors of ÐABC and ÐBCA, respectively. The
points E in r and D in s are such that AD || BE and AE || CD. The lines BD and CE cut each other at F.
The point I is the incenter of ABC. Show that if A, F and I are collinear, then AB = AC.
Sol. Let AI meet BC at K. Apply ceva’s theorem to DFBC, where the cevians FK, BE, CD meet at I. Then,
we get

BK CE FD
· · =1
KC EF DB

FD FA CE AI
Since = and = , then we see immediately that
DB AI EF FA

BK = KC,
which implies that the angle bisector of DABC is its median, which shows that AB = AC.

2. Let a, b, c and d be real numbers such that

c2 + 3d 2
a2 + 3b2 + = a + b + c + d – 1.
2

Find 1000a + 100b + 10c + d.

Your Hard Work Leads to Strong Foundation 1/4

 REGIONAL MATHEMATICAL OLYMPIAD MOCK TEST-2

Sol. We have

c2 + 3d 2
a2 + 3b2 + =a+b+c+d–1 Û
2

1 2 3 2
a2 + 3b2 + c + d –a–b–c–d+1=0Û
2 2

2 2 2
æ 1ö æ 1ö 1 3 æ 1ö
ç a - 2 ÷ + 3 ç b - 6 ÷ + 2 (c – 1)2 + ç d - ÷ = 0
è ø è ø 2 è 3ø

1 1 1
From here, we conclude that a = , b = , c = 1 and d = .
2 6 3

50 1
It follows that 1000a + 100b + 10c + d = 500 + + 10 + = 510 + 17 = 527.
3 3

3. Find a prime p such that the number

(p2 – 4)2 – 117(p2 – 4) + 990
has a minimum digit sum.
Sol. Let f(p) = (p2 – 4)2 – 117(p2 – 4) + 990.
If p ¹ 3 is a prime, then p = 3n ± 1 for some integer n. Then
p2 – 4 = 9n2 ± 6n – 3,
a multiple of 3 ; thus, (p2 – 4)2 is a multiple of 9. But 117 and 990 are also multiples of 9. So f(p) is
a multiple of 9, as is its digit sum.
If we had f(p) = 0, then by the quadratic formula we would have

117 ± 9729
p2 – 4 = ,
2

which has no integer solutions, so f(p) ¹ 0. Therefore, the digit sum of f(p) must be at least 9 when p
is a prime other than 3.
However, the digit sum of f(3) = 430 is 7, so the minimum digit sum is 7, attained for p = 3.
4. All natural numbers are coloured using 100 different colours. Prove that you can find several (no less
than 2) different numbers, all of the same colour, that have a product with exactly 1000 different
natural divisors.

Sol. Consider the set of numbers p19 , p 92 ............p 9n , where each pi is a distinct prime and n ³ 201. If we
colour each number in this set with any of 100 colours, then by the pigeonhole principle there will be
at least three numbers with the same colour. The product of the three numbers has exactly 1000
natural divisors.

2/4 Your Hard Work Leads to Strong Foundation

 REGIONAL MATHEMATICAL OLYMPIAD MOCK TEST-2

5. let I be the incenter of DABC. Let D be the point of intersection of AI with BC and let S be the point
of intersection of AI with the circumcircle of ABC (S ¹ A). Let K and L be incenters of DDSB and
DDCS. Let P be a reflection of I with respect to KL. Prove that BP ^ CP.

Sol.

We first prove that BKDI and CLDI are cyclic.

As K and I are incentres of DDSB and DABC, respectively, we have

æ ÐA + ÐB ö
ÐBKD + ÐBID = (180° – ÐDBK – ÐBDK) + ç ÷
è 2 ø

æ ÐDBS ÐA ÐB ö æ ÐA + ÐB ö
= ç 180° - - - +
è 2 4 2 ÷ø çè 2 ÷
ø

æ ÐA ÐB ö æ ÐA + ÐB ö
= ç 180° - - +
è 2 2 ÷ø çè 2 ÷
ø
where the penultimate equality follows from

ÐA
ÐDBS = ÐCBS = .
2
So, BKDI is cyclic and similarly CLDI is cyclic.
next, we prove that the circumcentre of DBPI is K and the circumcenter of DCPI is L. We have

ÐA ÐB
ÐSBI = ÐSBC + ÐCBI = + = ÐBAI + ÐABI = ÐSIB,
2 2
so SB = SI. As K is the incentre of DDSB, then KS bisects ÐISB, which gives KI = KB.
As point P is the reflection of point I over the line KL, then IK = PK, so KB = IK = PK. Therefore, the
circumcenter of DBPI is point K and similarly the circumcenter of DCPI is point L.
Now, we have

ÐBKI + ÐCLI ÐBDI + ÐCDI ÐBDC

ÐBPC = ÐBPI + ÐCPI = = = = 90°,
2 2 2
which gives the desired conclusion.

Your Hard Work Leads to Strong Foundation 3/4

 REGIONAL MATHEMATICAL OLYMPIAD MOCK TEST-2

6. Prove that if a, b, c are positive numbers with sum of 18, then

a b c 1
2
+ 2
+ 2
³ .
b + 36 c + 36 a + 36 4
Sol. Using AM-GM inequality and using inequality
1
ab + bc + ca £ (a + b + c)2,
3
We have

a a(b2 + 36) - ab2 a 1 ab 2

å b2 + 36 = å 36(b 2 + 36)
= å 36 - 36 å b 2 + 36
cyc cyc cyc cyc

1 1 ab2
³ -
2 36
å
cyc 2 b2 · 36

1 1 1
= - ·
2 36 12 cyc
ab å
1 1 1 1
³ - · · (a + b + c)2
2 36 12 3

1 1 1
= - = .
2 4 4
Equality holds only when a = b = c = 6.
Alternate :
Setting a = 6x, b = 6y, c = 6z, we are led to prove that
x y z 3
2
+ 2
+ 2
³ ........(1)
y +1 z +1 x +1 2
whenever x, y, z ³ 0 and x + y + z = 3.
Now, since y2 + 1 ³ 2y,

x xy2 xy2 xy
=x- ³x- = x- .
y2 + 1 y2 + 1 2y 2

y yz z zx
Similarly, ³y- and 2 ³z– and so
z +12 2 x +1 2

x y z xy + yz + zx xy + y + zx
2
+ 2
+ 2 >x+y+z– =3- ........(2)
y +1 z +1 x +1 2 2
But, 9 = (x + y + z)2 = x2 + y2 + z2 + 2(xy + yz + zx) ³ 3(xy + yz + zx), hence xy + yz + zx £ 3. Back
to (2), we obtain
x y z 3 3
2
+ 2
+ 2
³3- =
y +1 z +1 x +1 2 2
that is, (1).

4/4 Your Hard Work Leads to Strong Foundation