Shortlisted problems 3

Problems
Algebra
A1. Let n be a positive integer and let a1 , . . . , an´1 be arbitrary real numbers. Dene the
sequences u0 , . . . , un and v0 , . . . , vn inductively by u0 “ u1 “ v0 “ v1 “ 1, and
uk`1 “ uk ` ak uk´1 , vk`1 “ vk ` an´k vk´1 for k “ 1, . . . , n ´ 1.
Prove that un “ vn .
(France)
A2. Prove that in any set of 2000 distinct real numbers there exist two pairs a ą b and c ą d
with a ‰ c or b ‰ d, such that ˇ ˇ
ˇa ´ b ˇ 1
ˇ c ´ d ´ 1ˇ ă 100000 .
ˇ ˇ

(Lithuania)
A3. Let Qą0 be the set of positive rational numbers. Let f : Qą0 Ñ R be a function satisfying
the conditions
f pxqf pyq ě f pxyq and f px ` yq ě f pxq ` f pyq
for all x, y P Qą0 . Given that f paq “ a for some rational a ą 1, prove that f pxq “ x for all
x P Qą0 .
(Bulgaria)
A4. Let n be a positive integer, and consider a sequence a1 , a2 , . . . , an of positive integers.
Extend it periodically to an innite sequence a1 , a2 , . . . by dening an`i “ ai for all i ě 1. If
a1 ď a2 ď ¨ ¨ ¨ ď an ď a1 ` n
and
aai ď n ` i ´ 1 for i “ 1, 2, . . . , n,
prove that
a1 ` ¨ ¨ ¨ ` an ď n2 .

(Germany)
A5. Let Zě0 be the set of all nonnegative integers. Find all the functions f : Zě0 Ñ Zě0
satisfying the relation
f pf pf pnqqq “ f pn ` 1q ` 1
for all n P Zě0 .
(Serbia)
A6. Let m ‰ 0 be an integer. Find all polynomials P pxq with real coecients such that
px3 ´ mx2 ` 1qP px ` 1q ` px3 ` mx2 ` 1qP px ´ 1q “ 2px3 ´ mx ` 1qP pxq
for all real numbers x.
(Serbia)
4 IMO 2013 Colombia

Combinatorics
C1. Let n be a positive integer. Find the smallest integer k with the following property: Given
any real numbers a1 , . . . , ad such that a1 ` a2 ` ¨ ¨ ¨ ` ad “ n and 0 ď ai ď 1 for i “ 1, 2, . . . , d, it
is possible to partition these numbers into k groups (some of which may be empty) such that the
sum of the numbers in each group is at most 1.
(Poland)
C2. In the plane, 2013 red points and 2014 blue points are marked so that no three of the
marked points are collinear. One needs to draw k lines not passing through the marked points and
dividing the plane into several regions. The goal is to do it in such a way that no region contains
points of both colors.
Find the minimal value of k such that the goal is attainable for every possible conguration of
4027 points.
(Australia)
C3. A crazy physicist discovered a new kind of particle which he called an imon, after some of
them mysteriously appeared in his lab. Some pairs of imons in the lab can be entangled, and each
imon can participate in many entanglement relations. The physicist has found a way to perform
the following two kinds of operations with these particles, one operation at a time.

piq If some imon is entangled with an odd number of other imons in the lab, then the physicist
can destroy it.

piiq At any moment, he may double the whole family of imons in his lab by creating a copy I 1
of each imon I. During this procedure, the two copies I 1 and J 1 become entangled if and only if
the original imons I and J are entangled, and each copy I 1 becomes entangled with its original
imon I; no other entanglements occur or disappear at this moment.

Prove that the physicist may apply a sequence of such operations resulting in a family of imons,
no two of which are entangled.
(Japan)
C4. Let n be a positive integer, and let A be a subset of t1, . . . , nu. An A-partition of n into k
parts is a representation of n as a sum n “ a1 ` ¨ ¨ ¨ ` ak , where the parts a1 , . . . , ak belong to A
and are not necessarily distinct. The number of different parts in such a partition is the number
of (distinct) elements in the set ta1 , a2 , . . . , ak u.
We say that an A-partition of n into k parts is optimal if there is no A-partition
? of n into r
3
parts with r ă k. Prove that any optimal A-partition of n contains at most 6n dierent parts.
(Germany)
C5. Let r be a positive integer, and let a0 , a1 , . . . be an innite sequence of real numbers.
Assume that for all nonnegative integers m and s there exists a positive integer n P rm ` 1, m ` rs
such that
am ` am`1 ` ¨ ¨ ¨ ` am`s “ an ` an`1 ` ¨ ¨ ¨ ` an`s .

Prove that the sequence is periodic, i. e. there exists some p ě 1 such that an`p “ an for all n ě 0.
(India)
Shortlisted problems 5

C6. In some country several pairs of cities are connected by direct two-way ights. It is possible
to go from any city to any other by a sequence of ights. The distance between two cities is dened
to be the least possible number of ights required to go from one of them to the other. It is known
that for any city there are at most 100 cities at distance exactly three from it. Prove that there is
no city such that more than 2550 other cities have distance exactly four from it.
(Russia)
C7. Let n ě 2 be an integer. Consider all circular arrangements of the numbers 0, 1, . . . , n; the
n ` 1 rotations of an arrangement are considered to be equal. A circular arrangement is called
beautiful if, for any four distinct numbers 0 ď a, b, c, d ď n with a ` c “ b ` d, the chord joining
numbers a and c does not intersect the chord joining numbers b and d.
Let M be the number of beautiful arrangements of 0, 1, . . . , n. Let N be the number of pairs
px, yq of positive integers such that x ` y ď n and gcdpx, yq “ 1. Prove that

M “ N ` 1.

(Russia)
C8. Players A and B play a paintful game on the real line. Player A has a pot of paint with
four units of black ink. A quantity p of this ink suces to blacken a (closed) real interval of length
p. In every round, player A picks some positive integer m and provides 1{2m units of ink from the
pot. Player B then picks an integer k and blackens the interval from k{2m to pk ` 1q{2m (some
parts of this interval may have been blackened before). The goal of player A is to reach a situation
where the pot is empty and the interval r0, 1s is not completely blackened.
Decide whether there exists a strategy for player A to win in a nite number of moves.
(Austria)
6 IMO 2013 Colombia

Geometry
G1. Let ABC be an acute-angled triangle with orthocenter H, and let W be a point on
side BC. Denote by M and N the feet of the altitudes from B and C, respectively. Denote
by ω1 the circumcircle of BW N , and let X be the point on ω1 which is diametrically opposite
to W . Analogously, denote by ω2 the circumcircle of CW M , and let Y be the point on ω2 which
is diametrically opposite to W . Prove that X, Y and H are collinear.
(Thaliand)
G2. Let ω be the circumcircle of a triangle ABC. Denote by M and N the midpoints of the
sides AB and AC, respectively, and denote by T the midpoint of the arc BC of ω not containing A.
The circumcircles of the triangles AM T and AN T intersect the perpendicular bisectors of AC
and AB at points X and Y , respectively; assume that X and Y lie inside the triangle ABC. The
lines M N and XY intersect at K. Prove that KA “ KT .
(Iran)
G3. In a triangle ABC, let D and E be the feet of the angle bisectors of angles A and B,
respectively. A rhombus is inscribed into the quadrilateral AEDB (all vertices of the rhombus
lie on dierent sides of AEDB). Let ϕ be the non-obtuse angle of the rhombus. Prove that
ϕ ď maxt=BAC, =ABCu.
(Serbia)
G4. Let ABC be a triangle with =B ą =C. Let P and Q be two dierent points on line AC
such that =P BA “ =QBA “ =ACB and A is located between P and C. Suppose that there
exists an interior point D of segment BQ for which P D “ P B. Let the ray AD intersect the circle
ABC at R ‰ A. Prove that QB “ QR.
(Georgia)
G5. Let ABCDEF be a convex hexagon with AB “ DE, BC “ EF , CD “ F A, and
=A ´ =D “ =C ´ =F “ =E ´ =B. Prove that the diagonals AD, BE, and CF are concurrent.
(Ukraine)
G6. Let the excircle of the triangle ABC lying opposite to A touch its side BC at the point A1 .
Dene the points B1 and C1 analogously. Suppose that the circumcentre of the triangle A1 B1 C1
lies on the circumcircle of the triangle ABC. Prove that the triangle ABC is right-angled.
(Russia)
Shortlisted problems 7

Number Theory
N1. Let Zą0 be the set of positive integers. Find all functions f : Zą0 Ñ Zą0 such that
m2 ` f pnq | mf pmq ` n
for all positive integers m and n.
(Malaysia)
N2. Prove that for any pair of positive integers k and n there exist k positive integers
m1 , m2 , . . . , mk such that
2k ´ 1
ˆ ˙ˆ ˙ ˆ ˙
1 1 1
1` “ 1` 1` ¨¨¨ 1 ` .
n m1 m2 mk

(Japan)
N3. Prove that there exist innitely many positive integers n such that the largest prime divisor
of n4 ` n2 ` 1 is equal to the largest prime divisor of pn ` 1q4 ` pn ` 1q2 ` 1.
(Belgium)
N4. Determine whether there exists an innite sequence of nonzero digits a1 , a2 , a3 , . . . and a
positive integer N such that for every integer k ą N , the number ak ak´1 . . . a1 is a perfect square.
(Iran)
N5. Fix an integer k ě 2. Two players, called Ana and Banana, play the following game of
numbers: Initially, some integer n ě k gets written on the blackboard. Then they take moves
in turn, with Ana beginning. A player making a move erases the number m just written on the
blackboard and replaces it by some number m1 with k ď m1 ă m that is coprime to m. The rst
player who cannot move anymore loses.
An integer n ě k is called good if Banana has a winning strategy when the initial number is n,
and bad otherwise.
Consider two integers n, n1 ě k with the property that each prime number p ď k divides n if
and only if it divides n1 . Prove that either both n and n1 are good or both are bad.
(Italy)
N6. Determine all functions f : Q ÝÑ Z satisfying
ˆ ˙
f pxq ` a ´x ` a¯
f “f
b b
for all x P Q, a P Z, and b P Zą0 . (Here, Zą0 denotes the set of positive integers.)
(Israel)
N7. Let ν be an irrational positive number, and let m be a positive integer. A pair pa, bq of
positive integers is called good if
arbνs ´ btaνu “ m.
A good pair pa, bq is called excellent if neither of the pairs pa´b, bq and pa, b´aq is good. (As usual,
by txu and rxs we denote the integer numbers such that x ´ 1 ă txu ď x and x ď rxs ă x ` 1.)
Prove that the number of excellent pairs is equal to the sum of the positive divisors of m.
(U.S.A.)