The Art of Problem Solving

INMO-The ENDGAME
Physicsknight, RMO
October 2019

Rules
• It is a 4 hour and 30 minute exam. Though there is no restriction to complete
the paper within 270 minutes! Take your time, and solve it with enthusiasm!

• All the problems are intended to be original! Hence, googling/searching on

AoPS will be pointless job/wastage of time.

• Bonus points [6 − (eiπ+1 )]will be rewarded if your solutions is intuitive and

better than the official one’s.

• Do not discuss the problems on anywhere. Until the mock gets over.
If it is noticed that anyone is posting/discussing the problems any-
where! Immediately, h(s)he will get fired! His/her solutions won’t
be accepted! It’s up to you whether you’ll be honest to yourself or
not! If you don’t stop discussing the problems after warning, your
solutions won’t be accepted at any cost!

• All the solutions are supposed to be sent together! You can send your partial
solutions as well.

• If anyone finds a typo/ wrong statement in the problems. Please PM me!

Don’t mention that typo publicly!

• You are free to PM me, if you have any doubt or, if you couldn’t understand
any problem statement.

• Feel free to PM me, if hints are required! But, don’t ask the method/generalisation
of the problems.

• If anyone is banned or facing technical glitches to login AoPS! If you have my

contact then feel free to send the solutions on WhatsApp! Otherwise, you can
tell your friends to send your solutions to me!

• You can send me your handwritten solutions as well! Try to write it down
neatly! That doesn’t imply that we won’t grade bad handwritten solutions!
But the handwriting should not be too vague to understand!

1
 • There are no restrictions to use ggb/asymptote! But, your configuration should
be lucid.

• Don’t ask any questions regarding the score until the leader-board is declared!

• Grading won’t be too strict! So no worries!

• Hopefully, you will enjoy the problems! Do tell us your views regarding the
problems!

• You might face difficulties while solving some problems, which are tougher
than actual INMO! But don’t get demotivated if you are facing difficulties
while solving the problems! All the problems are created to show to the real
beauty of Olympiad Math!

• Don’t try to assist the other test writers! One has to solve the problems on
his own. Don’t be demotivated if you can’t solve the problems! It doesn’t
judge your potentiality! As said by seniors- It’s an untold truth all the AoPS
mocks are supposed to be harder than the actual mock! Hopefully, this mock
satisfies the statements of truth!

• After solving all the solutions, please keep the solutions confidential. Don’t
discuss how many problems you have done! Though you can give your feedback
regarding the mock openly!

• Deadline is 24th December! 11:59 PM

That’s a Christmas Gift from me to all of you guys! Ho Ho Ho!

Special thanks to: p square, Blazingmuddy, bel.jad5, Naruto.D.Luffy,
enhanced, babu2001, Telvcohl For their valuable suggestions regarding the prob-
lems and motivating me thus I created the problems!

2
Problems
1. Let a1 , a2 , . . . , an+1 be a sequence of positive integers with a1 = an+1 . Show
that n
Y
(ai + 2ai+1 )
i=1

is not a power of 2

2. Let XY Z be a triangle with side lengths a,b, c. Consider, oa , ob , oc be the

lengths of the medians. Then prove that
oa ob ob oc oc oa 9
+ 2 + 2 ≤
b2 +c 2 c +a 2 a +b 2 8

3. There is a 6 inch tall tree at the grove of HBCSE (named Brainyan) with x
nodes, some of the edge of Brainyan, is marked. Each time, Matir can choose
a simple path on the tree, and ask whether the path has any marked edge or
not.

a) How many times of asking can guarantee the set of marked edges?

b) If Matir knows there are exactly b x2 c marked edges. Then how many times
of asking can guarantee the set of marked edges.

4. f : R → R such that for every a, b ∈ R Find all the functions

f (a4 + b4 ) + f (a + b)4 = 2f (a2 + ab + b2 )2

5. Let X ≥ 3. Prove that for every y ≥ X + 1, every X-connected y-vertex graph

H, and every disjoint vertex sets G and T in H with |G| = 3 and |T | = X − 3.
There is a cycle that contains G ,and is disjoint from T . Give an example of
a 2-connected graph and some 3 vertices in this graph that do not belong to
a common cycle.

6. Triangle XY Z is given and O is a point such that the triangle formed with
the circumcenters of OY Z, OXZ, OXY is perspective to XY Z. Let I be the
incenter of XY Z and Σ be any circle with center I. Consider the intersection
X 0 of the external tangents of Σ and the circumcircle of OY Z. Similarly define
Y 0 , Z 0 . Prove XY Z is perspective to X 0 Y 0 Z 0