AoPS Community 2023 ISL

IMO Shortlist 2023

www.artofproblemsolving.com/community/c3922196
by peace09, MarkBcc168, GrantStar, Scilyse, OronSH, 799786, pikapika007, popop614, avisioner, mathlet-
icguyyy, youlost thegame 1434, KevinYang2.71

– Algebra

A1 Professor Oak is feeding his 100 Pokémon. Each Pokémon has a bowl whose capacity is a posi-
tive real number of kilograms. These capacities are known to Professor Oak. The total capacity
of all the bowls is 100 kilograms. Professor Oak distributes 100 kilograms of food in such a way
that each Pokémon receives a non-negative integer number of kilograms of food (which may
be larger than the capacity of the bowl). The dissatisfaction level of a Pokémon who received
N kilograms of food and whose bowl has a capacity of C kilograms is equal to |N − C|.
Find the smallest real number D such that, regardless of the capacities of the bowls, Profes-
sor Oak can distribute food in a way that the sum of the dissatisfaction levels over all the 100
Pokémon is at most D.
Oleksii Masalitin, Ukraine

A2 Let R be the set of real numbers. Let f : R → R be a function such that

f (x + y)f (x − y) ⩾ f (x)2 − f (y)2

for every x, y ∈ R. Assume that the inequality is strict for some x0 , y0 ∈ R.

Prove that either f (x) ⩾ 0 for every x ∈ R or f (x) ⩽ 0 for every x ∈ R.

A3 Let x1 , x2 , . . . , x2023 be pairwise different positive real numbers such that

s  
1 1 1
an = (x1 + x2 + · · · + xn ) + + ··· +
x1 x2 xn

is an integer for every n = 1, 2, . . . , 2023. Prove that a2023 ⩾ 3034.

A4 Let R>0 be the set of positive real numbers. Determine all functions f : R>0 → R>0 such that

x (f (x) + f (y)) ⩾ (f (f (x)) + y) f (y)

for every x, y ∈ R>0 .

A5 Let a1 , a2 , . . . , a2023 be positive integers such that

- a1 , a2 , . . . , a2023 is a permutation of 1, 2, . . . , 2023, and
- |a1 − a2 |, |a2 − a3 |, . . . , |a2022 − a2023 | is a permutation of 1, 2, . . . , 2022.

© 2024 AoPS Incorporated 1

AoPS Community 2023 ISL

Prove that max(a1 , a2023 ) ≥ 507.

A6 For each integer k ≥ 2, determine all infinite sequences of positive integers a1 , a2 , . . . for which
there exists a polynomial P of the form

P (x) = xk + ck−1 xk−1 + · · · + c1 x + c0 ,

where c0 , c1 , . . . , ck−1 are non-negative integers, such that

P (an ) = an+1 an+2 · · · an+k

for every integer n ≥ 1.

A7 Let N be a positive integer. Prove that there exist three permutations a1 , . . . , aN , b1 , . . . , bN , and
c1 , . . . , cN of 1, . . . , N such that
√ p √ √
ak + bk + ck − 2 N < 2023

for every k = 1, 2, . . . , N .

– Combinatorics

C1 Let m and n be positive integers greater than 1. In each unit square of an m × n grid lies a coin
with its tail side up. A move consists of the following steps.
-select a 2 × 2 square in the grid;
-flip the coins in the top-left and bottom-right unit squares;
-flip the coin in either the top-right or bottom-left unit square.
Determine all pairs (m, n) for which it is possible that every coin shows head-side up after a
finite number of moves.
Thanasin Nampaisarn, Thailand

C2 Determine the maximal length L of a sequence a1 , . . . , aL of positive integers satisfying both

the following properties:
-every term in the sequence is less than or equal to 22023 , and
-there does not exist a consecutive subsequence ai , ai+1 , . . . , aj (where 1 ≤ i ≤ j ≤ L) with a
choice of signs si , si+1 , . . . , sj ∈ {1, −1} for which

si ai + si+1 ai+1 + · · · + sj aj = 0.

© 2024 AoPS Incorporated 2

AoPS Community 2023 ISL

C3 Let n be a positive integer. A Japanese triangle consists of 1 + 2 + · · · + n circles arranged in

an equilateral triangular shape such that for each i = 1, 2, . . . , n, the ith row contains exactly i
circles, exactly one of which is coloured red. A ninja path in a Japanese triangle is a sequence
of n circles obtained by starting in the top row, then repeatedly going from a circle to one of
the two circles immediately below it and finishing in the bottom row. Here is an example of a
Japanese triangle with n = 6, along with a ninja path in that triangle containing two red circles.

n=6

In terms of n, find the greatest k such that in each Japanese triangle there is a ninja path con-
taining at least k red circles.

C4 Let n ⩾ 2 be a positive integer. Paul has a 1 × n2 rectangular strip consisting of n2 unit squares,
where the ith square is labelled with i for all 1 ⩽ i ⩽ n2 . He wishes to cut the strip into several
pieces, where each piece consists of a number of consecutive unit squares, and then translate
(without rotating or flipping) the pieces to obtain an n × n square satisfying the following prop-
erty: if the unit square in the ith row and j th column is labelled with aij , then aij − (i + j − 1) is
divisible by n.
Determine the smallest number of pieces Paul needs to make in order to accomplish this.

C5 Elisa has 2023 treasure chests, all of which are unlocked and empty at first. Each day, Elisa adds
a new gem to one of the unlocked chests of her choice, and afterwards, a fairy acts according
to the following rules:
-if more than one chests are unlocked, it locks one of them, or
-if there is only one unlocked chest, it unlocks all the chests.
Given that this process goes on forever, prove that there is a constant C with the following
property: Elisa can ensure that the difference between the numbers of gems in any two chests
never exceeds C, regardless of how the fairy chooses the chests to unlock.

C6 Let N be a positive integer, and consider an N × N grid. A right-down path is a sequence of grid
cells such that each cell is either one cell to the right of or one cell below the previous cell in the

© 2024 AoPS Incorporated 3

AoPS Community 2023 ISL

sequence. A right-up path is a sequence of grid cells such that each cell is either one cell to the
right of or one cell above the previous cell in the sequence.
Prove that the cells of the N × N grid cannot be partitioned into less than N right-down or
right-up paths. For example, the following partition of the 5 × 5 grid uses 5 paths.

Proposed by Zixiang Zhou, Canada

C7 The Imomi archipelago consists of n ≥ 2 islands. Between each pair of distinct islands is a
unique ferry line that runs in both directions, and each ferry line is operated by one of k com-
panies. It is known that if any one of the k companies closes all its ferry lines, then it becomes
impossible for a traveller, no matter where the traveller starts at, to visit all the islands exactly
once (in particular, not returning to the island the traveller started at).
Determine the maximal possible value of k in terms of n.
Anton Trygub, Ukraine

– Geometry

G1 Let ABCDE be a convex pentagon such that ∠ABC = ∠AED = 90◦ . Suppose that the mid-
point of CD is the circumcenter of triangle ABE. Let O be the circumcenter of triangle ACD.
Prove that line AO passes through the midpoint of segment BE.

G2 Let ABC be a triangle with AC > BC, let ω be the circumcircle of △ABC, and let r be its radius.
Point P is chosen on AC such taht BC = CP, and point S is the foot of the perpendicular from
P to AB. Ray BP mets ω again at D. Point Q is chosen on line SP such that P Q = r and S, P, Q
lie on a line in that order. Finally, let E be a point satisfying AE ⊥ CQ and BE ⊥ DQ. Prove that
E lies on ω.

G3 Let ABCD be a cyclic quadrilateral with ∠BAD < ∠ADC. Let M be the midpoint of the arc
CD not containing A. Suppose there is a point P inside ABCD such that ∠ADB = ∠CP D and

© 2024 AoPS Incorporated 4

AoPS Community 2023 ISL

∠ADP = ∠P CB.
Prove that lines AD, P M , and BC are concurrent.

G4 Let ABC be an acute-angled triangle with AB < AC. Let Ω be the circumcircle of ABC. Let S
be the midpoint of the arc CB of Ω containing A. The perpendicular from A to BC meets BS at
D and meets Ω again at E ̸= A. The line through D parallel to BC meets line BE at L. Denote
the circumcircle of triangle BDL by ω. Let ω meet Ω again at P ̸= B. Prove that the line tangent
to ω at P meets line BS on the internal angle bisector of ∠BAC.

G5 Let ABC be an acute-angled triangle with circumcircle ω and circumcentre O. Points D ̸= B

and E ̸= C lie on ω such that BD ⊥ AC and CE ⊥ AB. Let CO meet AB at X, and BO meet
AC at Y .
Prove that the circumcircles of triangles BXD and CY E have an intersection lie on line AO.
Ivan Chan Kai Chin, Malaysia

G6 Let ABC be an acute-angled triangle with circumcircle ω. A circle Γ is internally tangent to ω at

A and also tangent to BC at D. Let AB and AC intersect Γ at P and Q respectively. Let M and
N be points on line BC such that B is the midpoint of DM and C is the midpoint of DN . Lines
M P and N Q meet at K and intersect Γ again at I and J respectively. The ray KA meets the
circumcircle of triangle IJK again at X ̸= K.
Prove that ∠BXP = ∠CXQ.
Kian Moshiri, United Kingdom

G7 Let ABC be an acute, scalene triangle with orthocentre H. Let ℓa be the line through the reflec-
tion of B with respect to CH and the reflection of C with respect to BH. Lines ℓb and ℓc are
defined similarly. Suppose lines ℓa , ℓb , and ℓc determine a triangle T .
Prove that the orthocentre of T , the circumcentre of T , and H are collinear.
Fedir Yudin, Ukraine

G8 Let ABC be an equilateral triangle. Let A1 , B1 , C1 be interior points of ABC such that BA1 =
A1 C, CB1 = B1 A, AC1 = C1 B, and

∠BA1 C + ∠CB1 A + ∠AC1 B = 480◦

Let BC1 and CB1 meet at A2 , let CA1 and AC1 meet at B2 , and let AB1 and BA1 meet at C2 .
Prove that if triangle A1 B1 C1 is scalene, then the three circumcircles of triangles AA1 A2 , BB1 B2
and CC1 C2 all pass through two common points.
(Note: a scalene triangle is one where no two sides have equal length.)
Proposed by Ankan Bhattacharya, USA

© 2024 AoPS Incorporated 5

AoPS Community 2023 ISL

– Number Theory

N1 Determine all composite integers n > 1 that satisfy the following property: if d1 , d2 , . . ., dk are
all the positive divisors of n with 1 = d1 < d2 < · · · < dk = n, then di divides di+1 + di+2 for
every 1 ≤ i ≤ k − 2.

N2 Determine all ordered pairs (a, p) of positive integers, with p prime, such that pa + a4 is a perfect
square.
Proposed by Tahjib Hossain Khan, Bangladesh

N3 For positive integers n and k ≥ 2, define Ek (n) as the greatest exponent r such that k r divides
n!. Prove that there are infinitely many n such that E10 (n) > E9 (n) and infinitely many m such
that E10 (m) < E9 (m).

N4 Let a1 , . . . , an , b1 , . . . , bn be 2n positive integers such that the n + 1 products

a1 a2 a3 · · · an , b1 a2 a3 · · · an , b1 b2 a3 · · · an , . . . , b1 b2 b3 · · · bn
form a strictly increasing arithmetic progression in that order. Determine the smallest possible
integer that could be the common difference of such an arithmetic progression.

N5 Let a1 < a2 < a3 < . . . be positive integers such that ak+1 divides 2(a1 + a2 + · · · + ak ) for every
k ⩾ 1. Suppose that for infinitely many primes p, there exists k such that p divides ak . Prove that
for every positive integer n, there exists k such that n divides ak .

N6 A sequence of integers a0 , a1 . . . is called kawaii if a0 = 0, a1 = 1, and

(an+2 − 3an+1 + 2an )(an+2 − 4an+1 + 3an ) = 0
for all integers n ≥ 0. An integer is called kawaii if it belongs to some kawaii sequence.
Suppose that two consecutive integers m and m + 1 are both kawaii (not necessarily belonging
to the same kawaii sequence). Prove that m is divisible by 3, and that m/3 is also kawaii.

N7 Let a, b, c, d be positive integers satisfying

ab cd (a + b)(c + d)
+ = .
a+b c+d a+b+c+d
Determine all possible values of a + b + c + d.

N8 Determine all functions f : Z>0 → Z>0 such that, for all positive integers a and b,
f bf (a) (a + 1) = (a + 1)f (b).

© 2024 AoPS Incorporated 6

Art of Problem Solving is an ACS WASC Accredited School.