Saudi Arabian Mathematical Competitions 2021

Riyadh, June 2021

2021
 Table of contents

1 Selected problems from camps 8

2 Solution to BMO selection tests 12

3 Solution to JBMO tests 18

4 Solution to IMO Team selection tests 23

5 Problems without solution 34

1
2

éK
Xñª‚Ë@ éJ
K. QªË@ éºÊÒÒÊË
  ®K . A‚Ó

QË@ HA

“AK
HAJ

SAUDI ARABIAN
MATHEMATICAL COMPETITIONS 2021

Copyright @ Mawhiba 2020-2021. All rights reserved.

The King Abdulaziz and His Companions Foundation for
Giftedness and Creativity organization, Saudi Arabia.
www.mawhiba.org.sa

SAUDI ARABIAN IMO Booklet 2021

 3

This booklet was prepared by

Sultan Albarakati, Smbat Gogyan & Lê Phúc Lữ

Local Trainers & Former Olympiad Students

Tarek Shehata, Safwat Altanany, Alzubair Habibullah, Shaden
Alshammari, Omar Habibullah, Asaad Mohammedsaleh.

Visitor Trainers
Smbat Goryan, Albert Gevorgyan (Armenia),
Mikhail Karpuk (Belarus), Dominik Burek (Poland),
Nikola Petrovic, Dusan Dukic, Marko Radovanovic (Serbia),
Dmytro Nomirovski (Ukraine), Le Phuc Lu (Vietnam).

Organizers and Supervisions

Saham AlHusseini, Nada Altalhi, Akram El Ashy,
Hanan AlOtaibi, Mary Ann Callian, Nisha Mani, Venu Kas,
Abdulrahman AlJedaani, Abdulrahman AlSaeed,
Abdulrahman bin Huzaim, Jaser AlShahrani, Khalid Hazazi,
Majed AlShayeb, Maryam AlSufyani, Naziha AlBarakati,
Noof AlNufaei, Seham Fatani, Sumayyah AlHaydary.

SAUDI ARABIAN IMO Booklet 2021

4

The Saudi Arabian team at IMO 2021

Marwan Khayat Hamza Al-Shaikhi

Muath Al-Ghamdi Hadi Al-Aithan

Mohammed Al-Dubaisi Ali Al-Ramadan

SAUDI ARABIAN IMO Booklet 2021

 5

General Supervisor of Competition Management

Abdulaziz Al-Harthi

Team Training Administrators

Sultan Albarakati Fawzi Althukair Tarek Shehata

Observers of Saudi Arabia IMO team 2021

Alzubair Habibullah Safwat Altannani

SAUDI ARABIAN IMO Booklet 2021

 Introduction

This booklet contains the Team Selection Tests of the Saudi teams to the, Balkan
Junior Mathematics Olympiad, and the International Mathematics Olympiad.
The training was supported by the Ministry of Education, which commissioned
Mawhiba, the main establishment in Saudi Arabia that cares for the gifted students,
to do the task. We would like to express our gratitude to King Abdullah University
of Science and Technology KAUST for making its facilities on its beautiful campus
available to us for our training, even during the current pandemic.
The Saudi team had three main training camps during the academic year 2020-2021.
In addition, the team had an intensive training period from March to the end of
June 2021.
During this academic year, the selected students participated in the following con-
tests: The Asia Pacific Mathematics Olympiad, the European Girls Mathematics
Olympiad , and the Junior Balkan mathematics Olympiad. The contests were all
held online.
It is our pleasure to share the selection tests problems with other IMO teams, hoping
it will contribute to future cooperation.

Dr. Fawzi A Al-Thukair

Leader of the Saudi team in IMO 2021

6
 ‫‪7‬‬

‫ﻣﻘﺪﻣﺔ‬

‫ﯾﺤﻮي ھﺬا اﻟﻜﺘﯿﺐ ﻋﻠﻰ ﻣﺴﺎﺋﻞ اﻟﺘﺼﻔﯿﺎت ﻟﻤﺴﺎﺑﻘﺔ اﻟﺒﻠﻘﺎن و ﻣﺴﺎﺑﻘﺔ اﻟﺒﻠﻘﺎن ﻟﻠﻨﺎﺷﺌﯿﻦ و ﺗﺼﻔﯿﺎت اﻻوﻟﻤﺒﯿﺎد‬
‫اﻟﺪوﻟﻲ ﻟﻠﺮﯾﺎﺿﯿﺎت ‪.۲۰۱۹‬‬

‫ان ﺗﺪرﯾﺐ اﻟﻔﺮﯾﻖ ﻛﺎن ﺑﺪﻋﻢ ﻣﻦ وزارة اﻟﺘﻌﻠﯿﻢ ﺑﺎﻟﺘﻌﺎون ﻣﻊ ﻣﺆﺳﺴﺔ اﻟﻤﻠﻚ ﻋﺒﺪ اﻟﻌﺰﯾﺰ و رﺟﺎﻟﮫ ﻟﻠﻤﻮھﺒﺔ و‬
‫اﻻﺑﺪاع " ﻣﻮھﺒﺔ "‬

‫وﺗﺠﺪر اﻻﺷﺎرة اﻟﻰ اﻟﺘﻌﺎون و اﻻﺳﮭﺎم اﻟﻔﻌّﺎل ﻣﻦ ﺟﺎﻣﻌﺔ اﻟﻤﻠﻚ ﻋﺒﺪﷲ ﻟﻠﻌﻠﻮم و اﻟﺘﻘﻨﯿﺔ‪ ،‬ﺣﯿﺚ وﻓﺮت ﻟﻨﺎ ﻛﻞ‬
‫اﻻﻣﻜﺎﻧﺎت اﻟﺘﻲ اﺣﺘﺠﻨﺎ ﻟﮭﺎ ﻓﻲ اﻟﺘﺪرﯾﺐ ﻓﻲ ﺣﺮﻣﮭﺎ اﻟﺠﺎﻣﻌﻲ اﻟﺠﻤﯿﻞ‪.‬‬

‫ﺗﻢ ﻋﻘﺪ ﺛﻼﺛﺔ ﻣﻠﺘﻘﯿﺎت ﺗﺪرﯾﺒﯿﺔ ﺧﻼل اﻟﻌﺎم اﻟﺪراﺳﻲ ‪ ۲۰۱۹-۲۰۱۸‬ﺑﺎﻻﺿﺎﻓﺔ اﻟﻰ ﻓﺘﺮة اﻟﺘﺪرﯾﺐ اﻟﻤﻜﺜﻒ اﻟﺘﻲ‬
‫ﺑﺪأت ﻓﻲ ﺷﮭﺮ ﻣﺎرس ‪ ۲۰۱۹‬اﻟﻰ ﻧﮭﺎﯾﺔ ﺷﮭﺮ ﯾﻮﻧﯿﻮ‪ .‬ﻛﻤﺎ ﺷﺎرك اﻟﻄﻠﺒﺔ اﻟﻤﺘﻤﯿﺰون ﻓﻲ اﻟﻌﺪﯾﺪ ﻣﻦ اﻟﻤﺴﺎﺑﻘﺎت‬
‫اﻹﻗﻠﯿﻤﯿﺔ و ﻣﻨﮭﺎ‪ :‬اوﻟﻤﺒﯿﺎد اﻟﺮﯾﺎﺿﯿﺎت ﻟﺪول آﺳﯿﺎ و اﻟﺒﺎﺳﯿﻔﯿﻚ ‪ ،‬اوﻟﻤﺒﯿﺎد اﻟﻄﺎﻟﺒﺎت ﻟﻠﺪول اﻷورﺑﯿﺔ ﻓﻲ اوﻛﺮاﻧﯿﺎ ‪،‬‬
‫اوﻟﻤﺒﯿﺎد اﻟﺒﻠﻘﺎن ﻓﻲ ﻣﺎﻟﺪوﻓﺎ و اوﻟﻤﺒﯿﺎد اﻟﻨﺎﺷﺌﯿﻦ ﻟﺪول اﻟﺒﻠﻘﺎن ﻓﻲ ﻗﺒﺮص‪.‬‬

‫ﻧﺄﻣﻞ ان ﯾﻜﻮن ﻣﺤﺘﻮى ھﺬا اﻟﻜﺘﯿﺐ إﺳﮭﺎﻣﺎ ً ﻣﻨﺎ ﻟﺘﻘﻮﯾﺔ اواﺻﺮ اﻟﺘﻌﺎون و ﺗﺒﺎدل اﻟﺨﺒﺮات ﺑﯿﻨﻨﺎ و اﻟﺪول اﻟﻤﺸﺎرﻛﺔ‬
‫ﻓﻲ اﻻوﻟﻤﺒﯿﺎد اﻟﺪوﻟﻲ‪.‬‬

‫د‪.‬ﻓﻮزي ﺑﻦ أﺣﻤﺪ اﻟﺬﻛﯿﺮ‬

‫رﺋﯿﺲ اﻟﻔﺮﯾﻖ اﻟﺴﻌﻮدي ﻟﻼوﻟﻤﺒﯿﺎد اﻟﺪوﻟﻲ‪۲۰۱۹ .‬‬

‫‪SAUDI ARABIAN IMO Booklet 2021‬‬

 Selected problems from camps

1. BMO TST - March camp

1.1. Test 1
Problem 1. Do there exist two polynomials P and Q with integer coefficient such
that

i) both P and Q have a coefficient with absolute value bigger than 2021,

ii) all coefficients of P · Q by absolute value are at most 1.

Problem 2. Let ABC be an acute, non-isosceles triangle with H is the orthocenter

and M is the midpoint of AH. Denote O1 , O2 as the centers of circles pass through
H and respectively tangent to BC at B, C. Let X, Y be the ex-centers which respect
to angle H in triangles HM O1 , HM O2 . Prove that XY is parallel to O1 O2 .

Problem 3. Let x, y and z be odd positive integers such that gcd(x, y, z) = 1 and
the sum x2 + y 2 + z 2 is divisible by x + y + z. Prove that x + y + z − 2 is not divisible
by 3.

Problem 4. In the popular game of Minesweeper, some fields of an a × b board are

marked with a mine and on all the remaining fields the number of adjacent fields
that contain a mine is recorded. Two fields are considered adjacent if they share a
common vertex. For which k ∈ {0, 1, 2, 3, 4, 5, 6, 7, 8} is it possible for some a and
b , ab > 2021, to create a board whose fields are covered in mines, except for 2021
fields who are all marked with k?

1.2. Test 2
Problem 5. There are n ≥ 2 positive integers written on the whiteboard. A move
consists of three steps: calculate the least common multiple N of all numbers then
choose any number a and replace a by Na .
Prove that, using a finite number of moves, you can always make all the numbers
on the whiteboard equal to 1.

Problem 6. Let ABC be an acute triangle with AB < AC and inscribed in the
circle (O). Denote I as the incenter of ABC and D, E as the intersections of AI with
BC, (O) respectively. Take a point K on BC such that ∠AIK = 90◦ and KA, KE
meet (O) again at M, N respectively. The rays N D, N I meet the circle (O) at Q, P.

1. Prove that the quadrilateral M P QE is a kite.

8
 Selected problems from camps

2. Take J on IO such that AK ⊥ AJ. The line through I and perpendicular to

OI cuts BC at R, cuts EK at S. Prove that OR k JS.
Problem 7. Let a, b, and c be positive real numbers. Prove that

(a5 − a2 + 3)(b5 − b2 + 3)(c5 − c2 + 3) ≥ (a + b + c)3 .

Problem 8. A set of n points in space is given, no three of which are collinear
and no four of which are co-planar (on a single plane), and each pair of points is
connected by a line segment. Initially, all the line segments are colorless. A positive
integer b is given and Alice and Bob play the following game. In each turn Alice
colors one segment red and then Bob colors up to b segments blue. This is repeated
until there are no more colorless segments left. If Alice colors a red triangle, Alice
wins. If there are no more colorless segments and Alice hasn’t succeeded in coloring
a red triangle, Bob wins. Neither player is allowed to color over an already colored
line segment.
√
1. Prove that if b < 2n − 2 − 32 , then Alice has a winning strategy.
√
2. Prove that if b ≥ 2 n, then Bob has a winning strategy.

2. JBMO TST - April camp

2.1. Test 1
Problem 1. Find all positive integers a, b, c and prime number p such that

73p2 + 6 = 9a2 + 17b2 + 17c2 .

Problem 2. In a circle O, there are six points, A, B, C, D, E, F in a counterclockwise

order. BD ⊥ CF , and CF, BE, AD are concurrent. Let the perpendicular from B
to AC be M , and the perpendicular from D to CE be N . Prove that AEkM N .
Problem 3. Consider the sequence a1 , a2 , a3 , . . . defined by a1 = 9 and
(n + 5)an + 22
an+1 =
n+3
for n ≥ 1. Find all positive integers n for which an is a perfect square.
Problem 4. Let F is the set of all sequences {(a1 , a2 , . . . , a2020 ) with ai ∈ {−1, 1}}
for all i = 1, 2, . . . , 2020. Prove that there exists a set S, such that S ⊂ F, |S| = 2020
P2020for any (a1 , a2 , . . . , a2020 ) ∈ F there exists (b1 , b2 , . . . , b2020 ) ∈ S, such that
and
i=1 ai bi = 0.

2.2. Test 2
Problem 5. Let (an )n≥1 be a sequence given by a1 = 45 and

an = a2n−1 + 15an−1

for n > 1. Prove that the sequence contains no perfect squares.

SAUDI ARABIAN IMO Booklet 2021

10 Selected problems from camps

Problem 6. In a triangle ABC, let K be a point on the median BM such that

CM = CK. It turned out that ∠CBM = 2∠ABM . Show that BC = KM .
Problem 7. We have n > 2 nonzero integers such that everyone of them is divisible
by the sum of the other n − 1 numbers, Show that the sum of the n numbers is
precisely 0.
Problem 8. Let us call a set of positive integers nice if the number of its elements
equals to the average of its numbers. Call a positive integer n an amazing number
if the set {1, 2, , . . . , n} can be partitioned into nice subsets.
a) Prove that every perfect square is amazing

b) Show that there are infinitely many positive integers which are not amazing.

3. May camp - IMO TST

3.1. Test 1
Problem 1. For a non-empty set T denote by p(T ) the product of all elements of
T . Does there exist a set T of 2021 elements such that for any a ∈ T one has that
p(T ) − a is an odd integer. Consider two cases:
1. All elements of T are irrational numbers?

2. At least one element of T is a rational number?

Problem 2. Find all positive integers n, such that n is a perfect number and ϕ(n)
is power of 2. Note: a positive integer n is called perfect if the sum of all its positive
divisors is equal to 2n.
Problem 3. Let I and IA be the incenter and the A-excenter of an acute-angled
triangle ABC with AB < AC. Let the incircle meets BC at D, and the line
AD meets BIA and CIA at E and F , respectively. Prove that the circumcircles of
triangles AID and IA EF are tangent to each other.

3.2. Test 2
Problem 4. In a regular 100-gon, 41 vertices are colored black and the remain-
ing 59 vertices are colored white. Prove that there exist 24 convex quadrilaterals
Q1 , Q2 , . . . , Q24 whose corners (vertices of the quadrilateral) are vertices of the 100
-gon, so that
• the quadrilaterals Q1 , Q2 , . . . , Q24 are pairwise disjoint, and

• every quadrilateral Qi has three corners of one color and one corner of the
other color.
Problem 5. Let ABC be a non isosceles triangle with incenter I and let the cir-
cumcircle of the triangle ABC has radius R. Let AL is the external angle bisector
of ∠BAC with L ∈ BC. Let K is the point on the perpendicular bisector of BC
such that IL ⊥ IK. Prove that OK = 3R.

SAUDI ARABIAN IMO Booklet 2021

 Selected problems from camps

Problem 6. Determine all functions f : Z → Z such that

f (a ) (a + b) = af (a) + bf (b)
2 +b2

n th (0)
for every a, b ∈ Z. Here,

f denotes the n iteration of f , i. e. f (x) = x and
(n+1) (n)
f (x) = f f (x) for all n ≥ 0.

3.3. Test 3
Problem 7. Let ABC be an isosceles triangle with BC = CA, and let D be a point
inside the side AB such that AD < DB. Let P and Q be two points inside the sides
BC and CA respectively, such that ∠DP B = ∠DQA = 90◦ . Let the perpendicular
bisector of P Q meets the line segment CQ at E and let the circumcircles of triangles
ABC and CP Q meet again at point F , different from C. Suppose that P, E and F
are collinear. Prove that ∠ACB = 90◦ .

Problem 8. The Fibonacci numbers F0 , F1 , F2 , . . . are defined inductively by F0 =

0, F1 = 1, and Fn+1 = Fn + Fn−1 for n ≥ 1. Given an integer n ≥ 2, determine
the smallest size of a set S of integers such that for every k = 2, 3, . . . , n there exist
x, y ∈ S, such that x − y = Fk .

Problem 9. For a positive integer n, let d(n) be the number of positive divisors of
n, and let ϕ(n) be the number of positive integers not exceeding n which are coprime
with n. Prove that that for any number C there exists an integer n for which

ϕ(d(n))
> C.
d(ϕ(n))

3.4. Test 4
Problem 10. Given a positive integer k, show that there exists a prime p such
that one can choose distinct integers a1 , a2 , . . . , ak+3 ∈ {1, 2, . . . , p − 1} such that p
divides ai ai+1 ai+2 ai+3 − i for all i = 1, 2, 3, . . . , k.

Problem 11. Suppose that a, b, c, d are positive real numbers satisfying (a + c)(b +
d) = ac + bd. Find the smallest possible value of

a b c d
+ + +
b c d a
Problem 12. Let p be an odd prime and let N = 14 (p3 − p) − 1. The numbers
1, 2, . . . , N are painted arbitrarily in two colors, red and blue. For any positive
integer n ≤ N , denote by r(n) the fraction of integers in {1, 2, . . . , n} that are red
(number of red numbers divided by n ). Prove that there exists a positive integer
a ∈ {1, 2, . . . , p − 1} such that r(n) 6= ap for all n = 1, 2, . . . , N

SAUDI ARABIAN IMO Booklet 2021

 Solution to BMO selection tests

1. Day 1

Problem 1. Do there exist two polynomials P and Q with integer coefficient such
that:

i) both P and Q have a coefficient with absolute value bigger than 2021,

ii) all coefficients of P · Q by absolute value are at most 1.

Solution. Note that the polynomial

n
(1 − x2 )(1 − x4 )(1 − x8 ) . . . (1 − x2 )

has all coefficients equal 0, +1 or −1. Also note, that

n
(1 − x2 )(1 − x4 )(1 − x8 ) . . . (1 − x2 )
n−1
Y  n−1
Y 
2i i
= 1−x · 1 + x2
i=0 i=0
n−1
Y
=(1 − x)n · (1 + xi )n−i
i=0

Due to Newton binomial formula (1±x)n have coefficient equal n, also all coefficients
of
n−2 n−1
(1 + x)n (1 + x2 )n−1 . . . (1 + x2 )2 (1 + x2 )
are positive and bigger than coefficients of (1 + x)n .

Problem 2. Let ABC be an acute, non-isosceles triangle with H is the ortho-

center and M is the midpoint of AH. Denote O1 , O2 as the centers of circles pass
through H and respectively tangent to BC at B, C. Let X, Y be the ex-centers
which respect to angle H in triangles HM O1 , HM O2 . Prove that XY is parallel
to O1 O2 .

Solution. Let BU, CV be the diameter of circles (O1 ), (O2 ) and denote R = HU ∩
AB, S = HV ∩ AC. We have BH⊥HU, but BH⊥AC then HR k AC. Similarly
HS k AB implying that ARHS is a parallelogram. Hence, M is the midpont of the
segment RS.

12
 Solution to BMO selection tests

U X
A

O2

O1 M S
R

B
C

In the other hand, O1 is the midpoint of BU and BU k AH thus, by the property

of trapezoid, we get O1 , R, M are collinear. Similarly, O2 , S, M are also collinear.
Hence, five points O1 , O2 , R, S, M are collinear.
Since X is the excenter of triangle HM O1 then M X is the external angle bisector
XR MR
of ∠O1 M H, thus XH =M H
. Similarly, YY HS = M
MS
H
XR
, but M R = M S then XH = YY HS ,
this implies that XY k RS or XY k O1 O2 .

Problem 3. Let x, y and z be odd positive integers such that gcd(x, y, z) = 1

and the sum x2 + y 2 + z 2 is divisible by x + y + z. Prove that x + y + z − 2 is not
divisible by 3.

Solution. Suppose there exists a prime divisor p ≡ 2 (mod 3) of x + y + z. Since

z ≡ −(x + y) (mod p) we have 2(x2 + y 2 + xy) ≡ 0 (mod p). Multiplying by x − y
we get x3 ≡ y 3 (mod 3) but this yields x ≡ y (mod p), because gcd(3, p − 1) = 1.
Similarly x ≡ z (mod p) whence 3x ≡ 0 (mod p) which means that x, y and z are
divisible by p which contradicts gcd(x, y, z) = 1. Hence x + y + z have no prime
divisors which have a remainder 2 modulo 3 so x + y + z − 2 is not divisible by 3.

Problem 4. In the popular game of Minesweeper, some fields of an a × b board

are marked with a mine and on all the remaining fields the number of adjacent
fields that contain a mine is recorded. Two fields are considered adjacent if they
share a common vertex. For which k ∈ {0, 1, 2, 3, 4, 5, 6, 7, 8} is it possible for
some a and b , ab > 2021, to create a board whose fields are covered in mines,
except for 2021 fields who are all marked with k?

SAUDI ARABIAN IMO Booklet 2021

14 Solution to BMO selection tests

Solution. For k = 0 this is impossible, since at least one non-mine field will be
adjacent to the bombs unless the entire field is covered with bombs.
• For k = 1 we take a = 1, b = 3 · 1011 − 1, and 1011 mines spaced two-spaces
apart, with one on one of the endpoints, so the total number of fields marked
1 is 2021.
• For k = 2 we again take a = 1, b large enough, and place 2021 empty fields in
isolation of each other, and not on any of the endpoints.
• For k = 3, we take a = 2, b large enough, and 2019/3 mutually isolated L-
triminoes as empty spaces, with two corner points on opposite sides of the
longer edge also empty.
• For k = 4, we take a = 3, b large enough, and 1008 pairs of adjacent empty
fields on the edge, with one empty field on the middle row surrounded on all
diagonals by 4 empty fields on the edge, resembling an X shape.
• For k = 5 we take a = 3, b large enough, and place 2021 isolated empty fields
on the edge.
• For k = 6 we take a and b large enough, and place 2013/3 isolated empty
L-triminoes and 2 diamond-shaped regions of 4 fields each.
• For k = 7 it is impossible to place an empty field on the edge and since each
empty field in the interior is adjacent to exactly one other empty field it follows
that the empty fields are paired and thus their total number cannot be 2021,
an odd number.
• For k = 8 we simply take 2021 isolated empty fields in the interior.
Thus, the set of solutions is: {1, 2, 3, 4, 5, 6, 8}.

2. Day 2

Problem 5. There are n ≥ 2 positive integers written on the whiteboard. A move

consists of three steps: calculate the least common multiple N of all numbers then
choose any number a and replace a by Na .
Prove that, using a finite number of moves, you can always make all the numbers
on the whiteboard equal to 1.
Solution. Clearly a move cannot add any new prime to the set P of all prime divisors
of numbers written on the whiteboard. Let’s fix any p ∈ P and arrange all numbers
in descending order of their exponents of p, so that vp (a1 ) ≥ vp (a2 ) ≥ . . . ≥ vp (an ).
Note that vp (a1 ) = vp (lcm(a1 , a2 , . . . , an )) whence vp ( aN1 ) = 1. Therefore after we
choose as a consecutively numbers a1 , a2 , . . . , an , at the end none of the numbers
on the board will be a multiple of p. Hence we can always decrease |P| by at least
one, and at some moment we will reach |P| = 0 which means that all numbers on
the board will be equal to 1.

SAUDI ARABIAN IMO Booklet 2021

 Solution to BMO selection tests

Problem 6. Let ABC be an acute triangle with AB < AC and inscribed in the
circle (O). Denote I as the incenter of ABC and D, E as the intersections of AI
with BC, (O) respectively. Take a point K on BC such that ∠AIK = 90◦ and
KA, KE meet (O) again at M, N respectively. The rays N D, N I meet the circle
(O) at Q, P.

1. Prove that the quadrilateral M P QE is a kite.

2. Take J on IO such that AK ⊥ AJ. The line through I and perpendicular

to OI cuts BC at R, cuts EK at S. Prove that OR k JS.

Solution. First, we know that EI = EB = EC then E is the circumcenter of triangle

BIC. Thus KI is the tangent line of circle (BIC). Hence,
KI 2 = KB · KC = KE · KN.
By combining with KIE is right triangle, we get IN ⊥KE.
P
A

M Q

O
I

R
K C
B D

N
S
E

So P E is the diameter of circle (O). We have ∆BDE ∼ ∆ABE so

BE DE
= ⇒ EA · ED = EB 2 = EI 2 = EN · EK
AE BE
Implies that ADN K is cyclic. Thus ∠M AE = ∠DN E which leads to EM, EQ are
equal. Therefore, M P QE is a kite.
Since KI 2 = KM · KA, we get IM ⊥ AK. Construct the diameter AA0 of (O) then
M, I, A0 are collinear. Thus AJ k IM implies that AIA0 J is a parallelogram and
then O is the midpoint of IJ.
Since IO is the median of triangle IP E so Ix, IO, IP, IE form a harmonic quartet
with Ix k P E. Denote Ky as the ray that perpendicular to IO then notice that
KE ⊥ IP, KI ⊥ IE, KD ⊥ Ix, K, Ky ⊥ IO so KD, Ky, KI, KE form another
harmonic quartet. Since Ky k RS then R is the midpoint of OS. Therefore OR is
the midline of triangle IJS which implies that OR k JS.

SAUDI ARABIAN IMO Booklet 2021

16 Solution to BMO selection tests

Problem 7. Let a, b, and c be positive real numbers. Prove that

(a5 − a2 + 3)(b5 − b2 + 3)(c5 − c2 + 3) ≥ (a + b + c)3 .

Solution. Since x2 − 1 and x3 − 1 have the same sign, 0 ≤ (x2 − 1)(x3 − 1) =

x5 − x3 − x2 + 1, with equality when x = 1. So, it is sufficient to prove that

(a3 + 2)(b3 + 2)(c3 + 2) ≥ (a + b + c)3 .

√ √ √
Let x = a, y = b, and z = c. Then some two of x, y, and z are both at least
1 or both at most 1. Without loss of generality, say these are x and y. Then the
sequences (x, 1, 1) and (1, 1, y) are oppositely sorted, yielding

(x6 + 1 + 1)(1 + 1 + y 6 ) ≥ 3(x6 + 1 + y 6 )

by Chebyshev’s Inequality. By the Cauchy-Schwarz Inequality we have

(x6 + 1 + y 6 )(1 + z 6 + 1) ≥ (x3 + y 3 + z 3 )2 .

Applying Chebyshev’s and the Cauchy-Schwarz Inequalities each once more, we get

3(x3 + y 3 + z 3 ) ≥ (x2 + y 2 + z 2 )(x + y + z),

and

(x3 + y 3 + z 3 )(x + y + z) ≥ (x2 + y 2 + z 2 )2 .

Multiplying the above four inequalities together yields

(x6 + 2)(y 6 + 2)(z 6 + 2) ≥ (x2 + y 2 + z 2 )3 ,

as desired, with equality if and only if x = y = z = 1.

Problem 8. A set of n points in space is given, no three of which are collinear

and no four of which are co-planar (on a single plane), and each pair of points
is connected by a line segment. Initially, all the line segments are colorless. A
positive integer b is given and Alice and Bob play the following game. In each
turn Alice colors one segment red and then Bob colors up to b segments blue.
This is repeated until there are no more colorless segments left. If Alice colors a
red triangle, Alice wins. If there are no more colorless segments and Alice hasn’t
succeeded in coloring a red triangle, Bob wins. Neither player is allowed to color
over an already colored line segment.
√
1. Prove that if b < 2n − 2 − 32 , then Alice has a winning strategy.
√
2. Prove that if b ≥ 2 n, then Bob has a winning strategy.

Solution.

SAUDI ARABIAN IMO Booklet 2021

 Solution to BMO selection tests

1. We will call a threat an uncolored segment whose coloring of red would produce
a triangle. We will show that Alice can use the following strategy to win: Alice
will keep coloring segments whose one end-point is A unless she can complete
a triangle. We will call the other endpoints opposite ends. Let us assume that
Bob can stop this strategy. Bob’s optimal strategy to counter Alice’s is first
eliminating all threats in his move and then using his remaining moves to color
segments coming out of A. Note that after the k-th red line is drawn, Bob
must color k − 1 threats blue, which are the lines connecting the new opposite
end with all the previous opposite ends. Thus in the k-th pair of moves of
Alice and Bob, the number of colored edges coming out of A has increased by
b + 1 − (k − 1) = b − k + 2. Assume there exists a l such that after l moves all
segments out of A have been colored before Alice could draw a triangle. Then
we have
l(l + 1) 3
(b + 2)l − ≥ n − 1 ⇒ l2 + 2l(b + ) + 2n − 2 ≤ 0,
2 2

√ equation3is non-negative, i.e. 4(b +

therefore the discriminant of the quadratic
3 2
2
) − 4(2n − 2) ≥ 0 and therefore b ≥ 2n − 2 − 2 . Since this inequality is
violated, it follows that Alice’s winning strategy works.

2. We will show that Bob can use the following strategy to win: Whenever Alice
colors a line AB, Bob will color b 2b c edges out of A blue and d 2b e edges out of
B. This ensures at most b b nc+1 + 1 red edges out of any point, which is not
2 √
larger than b 2b c + 1 for b ≥ 2 n. Assuming Alice completes a triangle ABC
and WLOG moves AB, AC and BC in sequence, it follows that before placing
BC there were at least b 2b c + 1 threats out of C. However this means, since
placing AC created these threats, that, not counting AC, there were at least
b 2b c + 1 red lines out of A and thus the total number of red lines coming out
of A is larger than b 2b c + 1, a contradiction.

SAUDI ARABIAN IMO Booklet 2021

 Solution to JBMO tests

1. Test 1

Problem 1. Find all positive integers a, b, c and prime number p such that

73p2 + 6 = 9a2 + 17b2 + 17c2 (1)

Solution. Suppose that b ≤ c, we distinguish two cases regarding the value of p

1. if p 6= 2 implies p is odd, so p2 ≡ 1 (mod 8). It follows that

a2 + b2 + c2 ≡ 9a2 + 17b2 + 17c2 ≡ 73p2 + 6 ≡ 7 (mod 8). (2)

Otherwise, a2 + b2 + c2 ≡ 0, 1, 2, 3, 4, 5, 6 (mod 8), which is contracts (2).

2. if p = 2 then 9a2 + 17b2 + 17c2 = 73p2 + 6 = 298. Since a, b, c ≥ 1, we have

298 = 9a2 + 17b2 + 17c2 ≥ 26 + 17c2

, which means c ≤ 4. We investigate two cases

• if b ≤ c = 4 then 9a2 + 17b2 = 26, which means a = b = 1.

• if b ≤ c ≤ 3 then it is easy to check that there is no solutions satisfied.

Hence, the only solution satisfied (1) is (a, b, c, p) = (1, 1, 2, 2).

Problem 2. In a circle O, there are six points, A, B, C, D, E, F in a counterclock-

wise order. BD ⊥ CF , and CF, BE, AD are concurrent. Let the perpendicular
from B to AC be M , and the perpendicular from D to CE be N . Prove that
AEkM N .

Solution. Let K be the concurrent point of CF, BE, AD, and let CF intersects BD
at L.

18
 Solution to JBMO tests

We have ∠BM C = 90◦ = ∠BLC since BM is perpendicular to AC and BL is

perpendicular to CF , so B, M, L, C lie on the same circle with diameter BC. Hence,
∠CM L = ∠CBL = ∠CBD = ∠CAD
implying that M L is parallel to AK. Similarly, we also have LN is parallel to EK.
Thus, we have
CM CL CN
= = .
CA CK CE
This implies that M N is parallel to AE, as desired.

Problem 3. Consider the sequence a1 , a2 , a3 , . . . defined by a1 = 9 and

(n + 5)an + 22
an+1 =
n+3
for n ≥ 1. Find all positive integers n for which an is a perfect square.

Solution. First of all, we will prove by induction on n that an = n2 + 7n + 1.

The base case is trivial. Assume that ak = k 2 + 7k + 1, so
(k + 5)ak + 22 (k + 5)(k 2 + 7k + 1) + 22
ak+1 = = = (k + 1)2 + 7(k + 1) + 1
k+3 k+3
We distinguish two cases regarding the value of n
• if n ≥ 9 then (n + 3)2 < n2 + 7n + 1 < (n + 4)2 , so an is not a perfect square.
• if n ≤ 8 then we have
a1 = 9 a2 = 31 a5 = 61 a7 = 99
a2 = 19 a4 = 45 a6 = 79 a8 = 121
Hence, an is a perfect square if and only if n = 1, 8.

SAUDI ARABIAN IMO Booklet 2021

20 Solution to JBMO tests

Problem 4. Let F is the set of all sequences {(a1 , a2 , . . . , a2020 ) with ai ∈ {−1, 1}}
for all i = 1, 2, . . . , 2020. Prove that there exists a set S, such that S ⊂ F, |S| =
2020 Pand for any (a1 , a2 , . . . , a2020 ) ∈ F there exists (b1 , b2 , . . . , b2020 ) ∈ S, such
that 2020
i=1 ai bi = 0.

Solution. For each i ∈ {1, 2, . . . , 2021}, let ei = (1, . . . , 1, −1, . . . , −1).

| {z } | {z }
i−1 2021−i
For two sequences a = (a1 , a2 , . . . , a2020 ), b = (b1 , b2 , . . . , b2020 ), we define

a · b = a1 b1 + a2 b2 + · · · + a2020 b2020 .

It’s easy to verify that a · b is even for each a, b ∈ F . Let a = (a1 , a2 , . . . , a2020 ) ∈ F
and denote bi = a · ei for each i ∈ {1, 2, . . . , 2020}, then

bi+1 − bi = a · ei+1 − a · ei = 2ai ⇒ |bi+1 − bi | = 2, ∀i ∈ {1, 2 . . . , 2020}.

Let S = {e1 , e2 , . . . , e2020 }. It is clear that b2021 = −b1 and bi is even for each
i ∈ {1, 2, . . . , 2020}. If b1 6= 0, there exists an integer k such that 1 < k < 2021 and
bk = 0. Hence, S satisfies the problem’s requirements.

2. Test 2

Problem 5. Let (an )n≥1 be a sequence given by a1 = 45 and an = a2n−1 + 15an−1

for n > 1. Prove that the sequence contains no perfect squares.

Solution. By induction we can show that an > 0 for all positive integer n.
Suppose that there is exist positive integer n such that an is perfect square.

an = a2n−1 + 15an1 = an−1 (an−1 + 15)

so an−1 | an for all positive integers n. Thus, it follows that

a1 = 45 | an , for all positive integers n.

Let k > 1 is the smallest positive integer satisfied ak is perfect square and ak−1 = 45x
with x is positive integer. We have

ak = 45x(45x + 15) = 152 · 3x(3x + 1)

is a perfect square. On the other hand, (3x, 3x + 1) = 1 implies 3x and 3x + 1 are

perfect square, so 3x = 0 and 3x + 1 = 1. It is impossible since an > 0 for all n.

Problem 6. In a triangle ABC, let K be a point on the median BM such that

CM = CK. It turned out that ∠CBM = 2∠ABM . Show that BC = KM .
Solution. Let L be the reflection of C through BM . Since CK = CM , we have
∠CKM = ∠CM K. On the other hand, since L is the reflection of C through KL,
we have ∠LKM = ∠CKM = ∠CM K, implying that KL is parallel to CM .

SAUDI ARABIAN IMO Booklet 2021

 Solution to JBMO tests

Also, we have KL = KC = CM = M K, and KL is parallel to AM . Hence, KM AL

is a parallelogram, implying that KM = AL and KM is parallel to AL. We have
∠LBM = ∠CBM = 2∠ABM , hence ∠KBA = ∠ABL. Since AL is parallel to
M B, we have ∠BAL = ∠M BA = ∠LBA, implying that LB = LA. Hence, we
have
KM = LA = LB = BC
as desired.

Problem 7. We have n > 2 nonzero integers such that everyone of them is

divisible by the sum of the other n − 1 numbers, Show that the sum of the n
numbers is precisely 0.

Solution. Let these numbers be a1 , a2 , . . . , an and S is the sum of these numbers.

For every i ∈ {1, 2, . . . , n}, we have S − ai | ai , which means S − ai | S.
Suppose that S 6= 0, without the lost of generality, S > 0. We investigate two cases

• If ∃i ∈ {1, 2, . . . , n} such that ai < 0 then |S − ai | > |S| so S − ai - S.

• ai > 0 for all i ∈ {1, 2, . . . , n}. Let ak be the smallest of a1 , a2 , . . . , an . We

have S − am > 2am − am = am , so S − am - am .

Hence, S 6= 0 is impossible, which means S = 0.

Problem 8. Let us call a set of positive integers nice if the number of its elements
equals to the average of its numbers. Call a positive integer n an amazing number
if the set {1, 2, , . . . , n} can be partitioned into nice subsets.

a) Prove that every perfect square is amazing

b) Show that there are infinitely many positive integers which are not amazing.

SAUDI ARABIAN IMO Booklet 2021

22 Solution to JBMO tests

Solution. a) Let A = {1, 2, . . . , n} and n = k 2 for some positive integer k. Denote

B as the set of first m odd positive integers. It’s clear that B is nice.
Assume that n ≥ 2m − 1, let C = A \ B. C is nice if and only if

(1 + 2 + · · · + n) − m2 n−k
= n − m ⇐⇒ n = n2 − 4mn + 4m2 ⇐⇒ m = .
n−m 2
Therefore, we can choose m so that C is nice. Hence, n is amazing.
b) We prove that if n = 4k + 2 for some positive integer k, then n is not amazing.
Assume that A = {1, 2, . . . , n} can be partitioned into nice subsets A1 , A2 , . . . , Am
with cardinality a1 , a2 , . . . , am respectively. Therefore,
m m m
n(n + 1) X XX X X
= x= x= a2i ≡ ai = n (mod 2),
2 x∈A i=1 x∈A i=1 i=1
i

that yields contradiction.

SAUDI ARABIAN IMO Booklet 2021

Solution to IMO Team selection tests

1. Day 1

Problem 1. For a non-empty set T denote by p(T ) the product of all elements
of T . Does there exist a set T of 2021 elements such that for any a ∈ T one has
that p(T ) − a is an odd integer. Consider two cases:

1. All elements of T are irrational numbers?

2. At least one element of T is a rational number?

Solution.
1. Consider the polynomial
f (x) = x(x + 2)(x + 4) . . . (x + 4040) − x − (2m − 1)
for some m ∈ Z+ then lim f (x) = +∞ and f (0) = 22020 ·2020!−(2m−1).Take
x→+∞

m big enough to get f (0) < 0 then by the continuous property of f (x), there
exists some real number x0 such that f (x0 ) = 0. Then take the set T as
follows
T = {x0 , x0 + 2, x0 + 4, . . . , x0 + 4040}
Then p(T ) = x0 (x0 + 2) (x0 + 4) . . . (x0 + 4040) and p(T ) − x0 = 2m − 1 is
an odd integer. Since every element in T has form x0 + 2k with k ∈ Z then
p(T ) − a is an odd integer for all a ∈ T . Finally, take m = 22019 · 2020! then
f (0) = 1, suppose on the contrary that x0 ∈ Q. Note that f (x) is monic then
x0 ∈ Z and x0 | f (0) = 1, implies that x0 ∈ {−1; 1}, but this is contradiction
since it is easy to check that f (x) cannot have odd integer root.
2. We will proof that the answer is negative. Note that for all x, y ∈ T then x − y
is even. Suppose that T contains some rational number b. Then we can list
elements of T as follows b, b + a1 , b + a2 , . . . , b + a2020 in which a1 , a2 , . . . , ak
are even.
Put c = b (b + a1 ) (b + a2 ) . . . (b + ak ) − b then c is odd. Consider polynomial
g(x) = x (x + a1 ) (x + a2 ) . . . (x + ak ) − x − c
then g(b) = 0 and x = b is the rational root of g(x). Note that g is monic
then b ∈ Z. From this we conclude that all the elements in T are integers that
share the same parity, so does p(T ). Thus p(T ) − b is even, contradiction.

23
24 Solution to IMO Team selection tests

Problem 2. Find all positive integers n, such that n is a perfect number and
ϕ(n) is power of 2. Note: a positive integer n is called perfect if the sum of all
its positive divisors is equal to 2n.

Solution. Suppose that ϕ(n) = 2m for some m ∈ Z+ . Base on the formula of ϕ(n),
we have Y
ϕ(n) = pt−1 (p − 1) = 2m
p|n

with vp (n) = t. This implies that t = 1 for all odd prime divisor, since otherwise,
p | 2m , a contradiction. Thus p − 1 is the power of 2 .
With odd prime divisor of n, put p = 2s + 1 for some s ∈ Z+ . If s = 1 then p = 3,
otherwise s must be even since p ≡ (−1)s +1 ≡ 0( mod 3) when s is the odd number,
contradiction. In case s has some proper odd prime divisor q then put s = qt with
q
t > 1 then 2s + 1 = (2t ) + 1 is divisible by 2t + 1 contradiction also.
k
These imply that s is also a power of 2 , so by putting s = 2k , we get p = 22 + 1.
Now let n = 2a p1 p2 . . . pl with a ≥ 0, l ≥ 0 and p1 , p2 , . . . , pl are odd primes in
k
ascending order, in which p1 = 22 + 1. So

2n = σ(n) = 2a+1 − 1 (p1 + 1) (p2 + 1) . . . (pl + 1)

is the sum of divisors of n. Note that l > 0, otherwise, σ(n) = 2a+1 −1, contradiction.
If p1 > 3 then 3 - 2n and
k
 k   k

p1 + 1 = 22 + 2 = 2 22 −1 + 1 ≡ 2 (−1)2 −1 + 1 ≡ 0 (mod3)

implying that 3 | 2n, contradiction. Thus p1 = 3 and v3 (2n) = 1 leads to l ≤ 2.

There are two cases
• If l = 2 then 2a+1 · 3 · p2 = (2a+1 − 1) · 4 · (p2 + 1), note that v2 (p2 + 1) = 1 so
comparing the exponent of 2 in both sides to get a = 2. Thus 6p2 = 7 (p2 + 1),
contradiction.
• If l = 1 then 2a+1 · 3 = (2a+1 − 1) · 4, then a = 1 implies that n = 6 is a perfect
square.
Therefore, n = 6 is only solution of this problem.

Problem 3. Let I and IA be the incenter and the A-excenter of an acute-angled

triangle ABC with AB < AC. Let the incircle meets BC at D, and the line AD
meets BIA and CIA at E and F , respectively. Prove that the circumcircles of
triangles AID and IA EF are tangent to each other.

Solution. Let (p, q) denote the directed angle between lines p and q.
The points B, C, I, and IA lie on the circle Γ with diameter IIA . Let ω and Ω denote
the circles (IA EF ) and (AID), respectively. Let T be the second intersection point
of ω and Γ.

SAUDI ARABIAN IMO Booklet 2021

 Solution to IMO Team selection tests

Then T is the Miquel point of the complete quadrilateral formed by the lines
BC, BIA , CIA , and DEF , so T also lies on circle (BDE) (as well as on circle
(CDF )). We claim that T is desired tangency point of ω and Ω.
In order to show that T lies on Ω, use cyclic quadrilaterals BDET and BIIA T to
write
(DT, DA) = (DT, DE) = (BT, BE) =  (BT, BIA ) =  (IT, IIA ) = (IT, IA)

To show that ω and Ω are tangent at T , let ` be the tangent to ω at T , so that

 (T IA , `) =  (EIA , ET ) . Using circles (BDET ) and (BICIA ), we get
 (EIA , ET ) = (EB, ET ) = (DB, DT )
Therefore,
(T I, `) = 90◦ +  (T IA , `) = 90◦ + (DB, DT ) = (DI, DT )
which shows that ` is tangent to Ω at T .

2. Day 2

Problem 4. In a regular 100-gon, 41 vertices are colored black and the remaining
59 vertices are colored white. Prove that there exist 24 convex quadrilaterals
Q1 , Q2 , . . . , Q24 whose corners (vertices of the quadrilateral) are vertices of the
100 -gon, so that

SAUDI ARABIAN IMO Booklet 2021

26 Solution to IMO Team selection tests

• the quadrilaterals Q1 , Q2 , . . . , Q24 are pairwise disjoint, and

• every quadrilateral Qi has three corners of one color and one corner of the
other color.

Solution. Call a quadrilateral skew-colored, if it has three corners of one color and
one corner of the other color. We will prove the following
Claim. If the vertices of a convex (4k + 1) -gon P are colored black and white such
that each color is used at least k times, then there exist k pairwise disjoint skew-
colored quadrilaterals whose vertices are vertices of P . (One vertex of P remains
unused.)The problem statement follows by removing 3 arbitrary vertices of the 100
-gon and applying the Claim to the remaining 97 vertices with k = 24.
Proof of the Claim. We prove by induction. For k = 1 we have a pentagon with
at least one black and at least one white vertex. If the number of black vertices is
even then remove a black vertex; otherwise remove a white vertex. In the remaining
quadrilateral, there are an odd number of black and an odd number of white vertices,
so the quadrilateral is skew-colored.
For the induction step, assume k > 2. Let b and w be the numbers of black and
white vertices, respectively; then b, w > k and b + w = 4k + 1. Without loss of
generality we may assume w > b, so k 6 b 6 2k and 2k + 1 6 w 6 3k + 1.
We want to find four consecutive vertices such that three of them are white, the
fourth one is black. Denote the vertices by V1 , V2 , . . . , V4k+1 in counterclockwise
order, such that V4k+1 is black, and consider the following k groups of vertices:
(V1 , V2 , V3 , V4 ) , (V5 , V6 , V7 , V8 ) , . . . , (V4k−3 , V4k−2 , V4k−1 , V4k )
In these groups there are w white and b − 1 black vertices. Since w > b − 1, there is a
group, (Vi , Vi+1 , Vi+2 , Vi+3 ) that contains more white than black vertices. If three are
white and one is black in that group, we are done. Otherwise, if Vi , Vi+1 , Vi+2 , Vi+3
are all white then let Vj be the first black vertex among Vi+4 , . . . , V4k+1 ( recall that
V4k+1 is black); then Vj−3 , Vj−2 and Vj−1 are white and Vj is black.
Now we have four consecutive vertices Vi , Vi+1 , Vi+2 , Vi+3 that form a skew-colored
quadrilateral. The remaining vertices form a convex (4k − 3) -gon; w − 3 of them
are white and b − 1 are black. Since b − 1 > k − 1 and w − 3 > (2k + 1) − 3 > k − 1,
we can apply the Claim with k − 1.

Problem 5. Let ABC be a non isosceles triangle with incenter I and let the
circumcircle of the triangle ABC has radius R. Let AL is the external angle
bisector of ∠BAC with L ∈ BC. Let K is the point on the perpendicular bisector
of BC such that IL ⊥ IK. Prove that OK = 3R.

Solution. Denote M as the midpoint of the arc BC not containing A of (O), we

need to prove M K = 2OM . Denote BD, CE as the internal bisectors of ABC
then D, E, L are collinear. Note that L(AI, DB) = −1 and take the orthogonal
projection from I to get (Ix, Iy, IK, IM ) = −1 in which
IM ⊥ LA, IK ⊥ LI, Iy ⊥ LD, Ix ⊥ LB

SAUDI ARABIAN IMO Booklet 2021

 Solution to IMO Team selection tests

Suppose that Iy cuts M K at O0 , combining with IxkM K, then O0 is the midpoint

of M K. Thus it remains to prove M is the midpoint of OO0 .
Denote T as the ex-center respect to angle A of triangle ABC then M is the midpoint
of IT . Then M O = M O0 if and only if IO0 kOT , or OT ⊥ DE.
Now take U, V as the ex-centers respect to angles B, C of triangle ABC then A, B, C
are the foot of altitudes in triangle T U V and I, O are the orthocenter and nine-point
center of that triangle, thus the reflection S of I over O is the circumcenter. Note
that B, D, U and C, E, V are collinear then

PD/(O) = DA · DC = DU · DI = PD/(IU V )

and similarly, PE/(O) = PE/(IU V ) so DE is the radical axis of (O) and (IU V ) which
implies that DE is perpendicular to the line that joining centers of (O) and (IU V ).
We know that center Z of (IU V ) is the reflection of S over U V , and since IT = 2N S,
it is easy to check that Z ∈ T O. Thus, we have DE ⊥ OT which finishes the
proof.

Problem 6. Determine all functions f : Z → Z such that

f (a ) (a + b) = af (a) + bf (b)
2 +b2

n th (0)
for every a, b ∈ Z. Here,

f denotes the n iteration of f , i. e. f (x) = x and
(n+1) (n)
f (x) = f f (x) for all n ≥ 0.

SAUDI ARABIAN IMO Booklet 2021

28 Solution to IMO Team selection tests

Solution 1. Refer to the main equation as E(a, b).

2
E(0, b) reads as f b (b) = bf (b). For b = −1 this gives f (−1) = 0.
Now E(a, −1) reads as
2 +1 2
fa (a − 1) = af (a) = f a (a).

For x ∈ Z define the orbit of x by O(x) = {x, f (x), f (f (x)), . . .} ⊆ Z. We see that
the orbits O(a − 1) and O(a) differ by finitely many terms. Hence, any two orbits
differ by finitely many terms. In particular, this implies that either all orbits are
finite or all orbits are infinite.
Case 1: All orbits are finite. Then O(0) is finite. Using E(a, −a) we get
2
a(f (a) − f (−a)) = af (a) − af (−a) = f 2a (0) ∈ O(0) (1)
2
For |a| > max |z|, this yields f (a) = f (−a) and f 2a (0) = 0. Therefore, the se-
z∈O(0)


quence f k (0) : k = 0, 1, . . . is purely periodic with a minimal period T which di-
vides 2a2 . Analogously, T divides 2(a + 1)2 , therefore, T | gcd (2a2 , 2(a + 1)2 ) = 2,
2
i.e., f (f (0)) = 0 and a(f (a) − f (−a)) = f 2a (0) = 0 for all a. Thus,

f (a) = f (−a) for all a 6= 0; (2)

in particular, f (1) = f (−1) = 0 (3)

Next, for each n ∈ Z, by E(n, 1 − n) we get

2 +(1−n)2 2 −2n
nf (n) + (1 − n)f (1 − n) = f n (1) = f 2n (0) = 0 (4)

Assume that there exists some m 6= 0 such that f (m) 6= 0. Choose such an m for
which |m| is minimal possible. Then |m| > 1 due to (2);f (|m|) 6= 0 due to (3);
and f (1 − |m|) 6= 0 due to (4) for n = |m|. This contradicts to the minimality
assumption.
So, f (n) = 0 for n 6= 0. Finally, f (0) = f 3 (0) = f 4 (2) = 2f (2) = 0. Clearly, the
function f (x) ≡ 0 satisfies the problem condition, which provides the first of the
two answers.
Case 2: All orbits are infinite.
Since the orbits O(a) and O(a − 1) differ by finitely many terms for all a ∈ Z, each
two orbits O(a) and O(b) have infinitely many common terms for arbitrary a, b ∈ Z.
For a minute, fix any a, b ∈ Z. We claim that all pairs (n, m) of nonnegative
integers such that f n (a) = f m (b) have the same difference n − m. Arguing indi-
rectly, we have f n (a) = f m (b) and f p (a) = f q (b) with, say, n − m > p − q, then
f p+m+k (b) = f p+n+k (a) = f q+n+k (b), for all nonnegative integers k. This means that
f `+(n−m)−(p−q) (b) = f ` (b) for all sufficiently large `, i.e., that the sequence (f n (b)) is
eventually periodic, so O(b) is finite, which is impossible.
Now, for every a, b ∈ Z, denote the common difference n − m defined above by
X(a, b). We have X(a − 1, a) = 1 by (1). Trivially, X(a, b) + X(b, c) = X(a, c), as
if f n (a) = f m (b) and f p (b) = f q (c), then f p+n (a) = f p+m (b) = f q+m (c). These two
properties imply that X(a, b) = b − a for all a, b ∈ Z.

SAUDI ARABIAN IMO Booklet 2021

 Solution to IMO Team selection tests

2 +1 2
But (1) yields f a (f (a − 1)) = f a (f (a)), so
1 = X(f (a − 1), f (a)) = f (a) − f (a − 1) for all a ∈ Z
Recalling that f (−1) = 0, we conclude by (two-sided) induction on x that f (x) =
x + 1 for all x ∈ Z. Finally, the obtained function also satisfies the assumption.
Indeed, f n (x) = x + n for all n > 0, so
2 +b2
fa (a + b) = a + b + a2 + b2 = af (a) + bf (b).

3. Day 3

Problem 7. Let ABC be an isosceles triangle with BC = CA, and let D be

a point inside the side AB such that AD < DB. Let P and Q be two points
inside the sides BC and CA respectively, such that ∠DP B = ∠DQA = 90◦ . Let
the perpendicular bisector of P Q meets the line segment CQ at E and let the
circumcircles of triangles ABC and CP Q meet again at point F , different from
C. Suppose that P, E and F are collinear. Prove that ∠ACB = 90◦ .

Solution. Let ` be the perpendicular bisector of P Q, and denote by ω the circle

CF P Q. By DP ⊥ BC and DQ ⊥ AC, the circle ω passes through D; moreover,
CD is a diameter of ω.
The lines QE and P E are symmetric about `, and ` is a symmetry axis of ω as well;
it follows that the chords CQ and F P are symmetric about `, hence C and F are
symmetric about `. Therefore, the perpendicular bisector of CF coincides with `.
Thus ` passes through the circumcenter O of ABC.
Let M be the midpoint of AB. Since CM ⊥ DM, M also lies on ω. By ∠ACM =
∠BCM , the chords M P and M Q of ω are equal. Then, from M P = M Q it follows
that ` passes through M .

SAUDI ARABIAN IMO Booklet 2021

30 Solution to IMO Team selection tests

Finally, both O and M lie on lines ` anh CM , therefore O = M , and ∠ACB = 90◦
follows.

Problem 8. The Fibonacci numbers F0 , F1 , F2 , . . . are defined inductively by F0 =

0, F1 = 1, and Fn+1 = Fn + Fn−1 for n ≥ 1. Given an integer n ≥ 2, determine
the smallest size of a set S of integers such that for every k = 2, 3, . . . , n there
exist x, y ∈ S, such that x − y = Fk .
n
Solution. First we show that if a set S ⊂ Z satisfies the conditions then |S| > 2
+ 1.
Let d = [n/2], so n 6 2d 6 n + 1. In order to prove that |S| > d + 1, construct
a graph as follows. Let the vertices of the graph be the elements of S. For each
1 6 k 6 d, choose two elements x, y ∈ S such that x − y = F2k−1 , and add the pair
(x, y) to the graph as edge. (Note that by the problem’s constraints, there must be
a pair (x, y) with x − y = F2k−1 for every 3 6 2k − 1 6 2d − 1 6 n; moreover, due
to F1 = F2 we have a pair with x − y = F1 as well. ) We will say that the length of
the edge (x, y) is |x − y|.
We claim that the graph contains no cycle. For the sake of contradiction, suppose
that the graph contains a cycle (x1 , . . . , x` ), and let the longest edge in the cycle be
(x1 , x` ) with length F2m+1 . The other edges (x1 , x2 ) , . . . , (x`−1 , x` ) in the cycle are
shorter than F2m+1 and distinct, their lengths form a subset of {F1 , F3 , . . . , F2m−1 }.
But this is not possible because
`−1
X
F2m+1 = |x` − x1 | 6 |xi+1 − xi | 6 F1 + F3 + F5 + . . . + F2m−1
i=1
= F2 + (F4 − F2 ) + (F6 − F4 ) + . . . + (F2m − F2m−2 ) = F2m < F2m+1
Hence, the graph has d edges and cannot contain a cycle, therefore it must contain
at least d+1 vertices, so |S| > d+1. Now we show a suitable set with d+1 elements.
Let
S = {F0 , F2 , F4 , F5 , . . . , F2d }
For 1 6 k 6 d we have F0 , F2k−2 , F2k ∈ S with differences F2k − F2k−2 = F2k−1 and
F2k − F0 = F2k , so each of F1 , F2 , . . . , F2d occurs as difference between two elements
in S. So this set containing d + 1 numbers is suitable.

Problem 9. For a positive integer n, let d(n) be the number of positive divisors
of n, and let ϕ(n) be the number of positive integers not exceeding n which are
coprime with n. Prove that that for any number C there exists an integer n for
which
ϕ(d(n))
> C.
d(ϕ(n))

Solution. Fix N > 1, let p1 , . . . , pk be all primes between 1 and N and pk+1 , . . . , pk+s
be all primes between N + 1 and 2N . Since for j 6 k + s all prime divisors of pj − 1
do not exceed N , we have
k+s
Y Yk
(pj − 1) = pci i
j=1 i=1

SAUDI ARABIAN IMO Booklet 2021

 Solution to IMO Team selection tests

with some fixed exponents c1 , . . . , ck . Choose a huge prime number q and consider
a number
n = (p1 · . . . · pk )q−1 · (pk+1 · . . . · pk+s )
Then
ϕ(d(n)) = ϕ q k · 2s = q k−1 (q − 1)2s−1

and
k+s
! k
! k
q−2
Y Y Y
d(ϕ(n)) = d (p1 · . . . · pk ) (pi − 1) =d piq−2+ci = (q − 1 + ci )
i=1 i=1 i=1

So
k
ϕ(d(n)) q k−1 (q − 1)2s−1 s−1 q − 1
Y q
= Qk =2 · ·
d(ϕ(n)) i=1 (q − 1 + ci )
q i=1
q − 1 + ci

which can be made arbitrarily close to 2s−1 by choosing q large enough. It remains
to show that s can be arbitrarily large, i.e. that there can be arbitrarily many primes
between N and 2N .
P1
This follows, for instance, from the well-known fact that p
= ∞, where the sum
is taken over the set P of prime numbers. Indeed, if, for some constant C, there
were always at most C primes between 2` and 2`+1 , we would have

X1 ∞ ∞
X X 1 XC
= 6 `
<∞
p∈P
p `=0 p∈P
p `=0
2
p∈[2` ,2`+1 )

which is a contradiction.

4. Day 4

Problem 10. Given a positive integer k, show that there exists a prime p such
that one can choose distinct integers a1 , a2 , . . . , ak+3 ∈ {1, 2, . . . , p − 1} such that
p divides ai ai+1 ai+2 ai+3 − i for all i = 1, 2, 3, . . . , k.

Solution. First we choose distinct positive rational numbers r1 , . . . , rk+3 such that

ri ri+1 ri+2 ri+3 = i for 1 6 i 6 k

Let r1 = x, r2 = y, r3 = z be some distinct primes greater than k; the remaining

terms satisfy r4 = r1 r12 r3 and ri+4 = i+1
i i
r . It follows that if ri are represented as
irreducible fractions, the numerators are divisible by x for i ≡ 1 (mod 4), by y for
i ≡ 2 (mod 4), by z for i ≡ 3 (mod 4) and by none for i ≡ 0 (mod 4). Notice that
ri < ri+4 ; thus the sequences

r1 < r5 < r9 < . . . , r2 < r6 < r10 < . . . , r3 < r7 < r11 < . . . , r4 < r8 < r12 < . . .

are increasing and have no common terms, that is, all ri are distinct.

SAUDI ARABIAN IMO Booklet 2021

32 Solution to IMO Team selection tests

If each ri is represented by an irreducible fraction uvii , choose a prime p which divides

neither vi , 1 6 i 6 k + 1, nor vi vj (ri − rj ) = vj ui − vi uj for i < j, and define ai by
the congruence ai vi ≡ ui (modp). Since ri ri+1 ri+2 ri+3 = i, we have

ivi vi+1 vi+2 vi+3 = ri vi ri+1 vi+1 ri+2 vi+2 ri+3 vi+3
=ui ui+1 ui+2 ui+3 ≡ ai vi ai+1 vi+1 ai+2 vi+2 ai+3 vi+3 (mod p)

and therefore ai ai+1 ai+2 ai+3 ≡ i(modp) for 1 6 i 6 k.

If ai ≡ aj (modp), then ui vj ≡ ai vi vj ≡ uj vi (modp), a contradiction.

Problem 11. Suppose that a, b, c, d are positive real numbers satisfying (a+c)(b+
d) = ac + bd. Find the smallest possible value of

a b c d
+ + +
b c d a

Solution. First of all, apply the AM-GM inequality as follows:

a c  b d r r
ac bd 2(ac + bd)
+ + + >2 +2 = √
b d c a bd ac abcd

Continuing to apply the AM-GM inequality, then

  √ √
a c b d 2(a + c)(b + d) 2 ac · 2 bd
+ + + > √ >2· √ =8
b d c a abcd abcd

The above inequalities turn into equalities when a = c and b = d. Then the condition
(a + c)(b +√d) = ac + bd can be rewritten as 4ab = a2 + b2 . This is equivalent to
a/b = 2 ± 3.
√
Hence, S attains value 8, e.g., when a = c = 1 and b = d = 2 + 3.

Problem 12. Let p be an odd prime and let N = 14 (p3 − p) − 1. The numbers
1, 2, . . . , N are painted arbitrarily in two colors, red and blue. For any positive
integer n ≤ N , denote by r(n) the fraction of integers in {1, 2, . . . , n} that are red
(number of red numbers divided by n ). Prove that there exists a positive integer
a ∈ {1, 2, . . . , p − 1} such that r(n) 6= ap for all n = 1, 2, . . . , N

Solution. Denote by R(n) the number of red numbers in {1, 2, . . . , n}, i.e., R(n) =
nr(n). Similarly, denote by B(n) and b(n) = B(n)/n the number and proportion
of blue numbers in {1, 2, . . . , n}, respectively. Notice that B(n) + R(n) = n and
b(n) + r(n) = 1. Therefore, the statement of the problem does not change after
swapping the colors.
Arguing indirectly, for every a ∈ {1, 2, . . . , p − 1} choose some positive integer na
such that r (na ) = a/p and, hence, R (na ) = ana /p. Clearly, p | na , so that na = pma

SAUDI ARABIAN IMO Booklet 2021

 Solution to IMO Team selection tests

for some positive integer ma , and R (na ) = ama . Without loss of generality, we
assume that m1 < mp−1 , as otherwise one may swap the colors. Notice that

N p2 − 1
ma 6 < for all a = 1, 2, . . . , p − 1 .
p 4
The solution is based on a repeated application of the following simple observation.
Claim. Assume that ma < mb for some a, b ∈ {1, 2, . . . , p − 1}. Then
a p−a
mb > ma and mb > ma .
b p−b

Proof. The first inequality follows from bmb = R (nb ) > R (na ) = ama . The second
inequality is obtained by swapping colors. Let q = (p − 1)/2. We distinguish two
cases.
Case 1: All q numbers m1 , m2 , . . . , mq are smaller than mp−1 .
. Let ma be the maximal number among m1 , m2 , . . . , mq ; then ma > q > a. Applying
the Claim, we get

p−a p2 − 1
mp−1 > ma > (p − q)q =
p − (p − 1) 4

which contradicts (1).

Case 2: There exists k 6 q such that mk > mp−1 . Choose k to be the smallest index
satisfying mk > mp−1 ; by our assumptions, we have 1 < k 6 q < p − 1
Let ma be the maximal number among m1 , m2 , . . . , mk−1 ; then a 6 k − 1 6 ma <
mp−1 . Applying the Claim, we get

p−1 p−1 p−a

mk > mp−1 > · ma
k k p − (p − 1)
p−1
> · (p − k + 1)(k − 1)
k
k−1
> · (p − 1)(p − q)
k
1 p2 − 1
> ·
2 2
which contradicts (1) again.

SAUDI ARABIAN IMO Booklet 2021

 Problems without solution

Problem 1. Let ABC be an acute, non-isosceles triangle with AD, BE, CF are
altitudes and d is the tangent line of the circumcircle of triangle ABC at A. The
line throught H and parallel to EF cuts DE, DF at Q, P respectively. Prove that
d is tangent to the ex-circle respect to vertex D of triangle DP Q.

Problem 2. Let ABC be an acute, non isosceles triangle with the orthocenter H,
circumcenter O and AD is the diameter of (O). Suppose that the circle (AHD)
meets the lines AB, AC at F, Erespectively. Denote J, K as orthocenter and nine-
point center of AEF. Prove that HJ parallel to BC and KO = KH.

Problem 3. Let ABC be an acute, non-isosceles triangle inscribed in (O) and

BB 0 , CC 0 are altitudes. Denote E, F as the intersections of BB 0 , CC 0 with (O) and
D, P, Q are projections of A on BC, CE, BF. Prove that the perpendicular bisectors
of P Q bisects two segments AO, BC.

Problem 4. Let ABC be a triangle with incircle (I), tangent to BC, CA, AB at
D, E, F respectively. On the line DF, take points M, P such that CM k AB, AP k
BC. On the line DE, take points N, Q such that BN k AC, AQ k BC. Denote X
as intersection of P E, QF and K as the midpoint of BC. Prove that if AX = IK
then ∠BAC ≤ 60◦ .

Problem 5. Let ABCD be a rectangle with P lies on the segment AC. Denote Q
as a point on minor arc P B of (P AB) such that QB = QC. Denote R as a point
on minor arc P D of (P AD) such that RC = RD. The lines CB, CD meet (CQR)
again at M, N respectively. Prove that BM = DN.

Problem 6. Let A be a point lies outside circle (O) and tangent lines AB, ACof
(O). Consider points D, E, M on (O) such that M D = M E. The line DE cuts
M B, M C at R, S. Take X ∈ OB, Y ∈ OC such that RX, RY ⊥DE. Prove that
XY ⊥AM.

Problem 7. Let ABC be a triangle with AB = AC and M is the midpoint of the

altitude AD. Consider (ω) as the circle of center M and tangent to AB, AC. From
some point T on the line BC (outside triangle ABC), construct two tangents of (ω)
and they cut AB at P, Q, cut AC at R, S. Prove that P Q = RS.

Problem 8. Let ABC be an non-isosceles triangle with incenter I, circumcenter O

and a point D on segment BC such that (BID) cut segments AB at E 6= B and
(CID) cuts segmentAC at F 6= C. Circle (DEF ) cuts segments AB, AC again at
M, N. Let P = IB ∩ DE and Q = IC ∩ DF. Prove that EN, F M, P Q are parallel
and the median of vertex I in triangle IP Q bisects the arc BAC of (O).

34
 Problems without solution

Problem 9. Let ABC be a triangle inscribed in circle (O) with diamter KL passes
through the midpoint M of AB such that L, C lie on the different sides respect to
AB. A circle passes through M, K cuts LC at P, Q (point P lies between Q, C). The
line KQ cuts (LM Q) at R. Prove that ARBP is cyclic and AB is the symmedian
of triangle AP R.
Problem 10. Let AB be a chord of the circle (O). Denote M as the midpoint of
the minor arc AB. A circle (O0 ) tangent to segment AB and internally tangent to
(O). A line passes through M , perpendicular to O0 A, O0 B and cuts AB respectively
at C, D. Prove that AB = 2CD.
Problem 11. Consider circles (O1 ), (O2 ), (O3 ) are tangent to d at A, B, C and (O2 )
is the biggest circle, externally tangent to (O1 ), (O3 ). Let BD be the diameter of (O2 ).
The external tangent line (differs from d) of (O1 ), (O3 ) cuts (O2 ) at X, Y. Let K be
the midpoint of the arc XBY of (O2 ). Prove that the circle of diameter AC touches
DX, DY.
Problem 12. Let ABC be a triangle with circumcenter O and incenter I, ex-center
in angle A is J. Denote D as the tangent point of là (I) on BC and the angle bisector
of angle A cuts BC, (O) respectively at E, F. The circle (DEF ) meeds (O) again at
T. Prove that AT passes through an intersection of (J) and (DEF ).
Problem 13. Let ABCD be a quadrilteral with ∠A = ∠B = 90◦ , AB = AD.
Denote E as the midpoint of AD, suppose that CD = BC + AD, AD > BC. Prove
that ∠ADC = 2.∠ABE.
Problem 14. Let ABC be a triangle inscribed in a fix circle (O) with BC is fix
and A vary on (O). Denote H as the orthocenter of triangle ABC and take D, E on
AB, AC respectively such that H is the midpoint of DE. Prove that when A moves
on (O), the center of (ADE) belongs a fixed circle.
Problem 15. Let ABC be convex quadrilateral and X lying inside it such that
XA · XC 2 = XB · XD2 and ∠AXD + ∠BXC = ∠CXD. Prove that ∠XAD +
∠XCD = ∠XBC + ∠XDC.
Problem 16. Let ABC be an acute, non-isosceles triangle with circumcenter O,
incenter I and (I) tangent to BC, CA, AB at D, E, F respectively. Suppose that
EF cuts (O) at P, Q. Prove that (P QD) bisects segment BC.
Problem 17. Let ABC be an acute, non-isosceles triangle with circumcenter O.
Tangent lines to (O) at B, C meet at T. A line passes through T cuts segments AB
at D and cuts ray CA at E. Take M as midpoint of DE and suppose that M A cuts
(O) again at K. Prove that (M KT ) is tangent to (O).
Problem 18. Let ABC be a triangle with AB < AC and incircle (I) tangent to
BC at D. Take K on AD such that CD = CK. Suppose that AD cuts (I) at G and
BG cuts CK at L. Prove that K is the midpoint of CL.
Problem 19. Let ABC be a triangle with AB < AC inscribed in (O). Tangent
line at A of (O) cuts BC at D. Take H as the projection of A on OD and E, F as
projections of H on AB, AC. Suppose that EF cuts (O) at R, S. Prove that (HRS)
is tangent to OD.

SAUDI ARABIAN IMO Booklet 2021

36 Problems without solution

Problem 20. Let ABC be an acute, non-isosceles triangle with altitude AD (D ∈

BC), M is the midpoint of AD and O is the circumcenter. Line AO meets BC at
K and circle of center K, radius KA cuts AB, AC at E, F respectively. Prove that
AO bisects EF.

Problem 21. Let ABCD be a cyclic quadrilateral with O is circumcenter and AC

meets BD at I. Suppose that rays DA, CD meet at E and rays BA, CD meet at F.
The Gauss line of ABCD meets AB, BC, CD, DA at points M, N, P, Q respectively.
Prove that the circle of diameter OI is tangent to two circles (EN Q), (F M P ).

Problem 22. Let ABC be a non-isosceles triangle with altitudes AD, BE, CF with
orthocenter H. Suppose that DF ∩ HB = M, DE ∩ HC = N and T is the circum-
center of triangle HBC. Prove that AT ⊥M N.

Problem 23. Let ABC be triangle with the symmedian point L and circumradius
R. Construct parallelograms ADLE, BHLK, CILJ such that D, H ∈ AB; K, I ∈
BC; J, E ∈ CA. Suppose that DE, HK, IJ pairwise intersect at X, Y, Z. Prove that
inradius of XY Z is R2 .

Problem 24. Let ABC be triangle with M is the midpoint of BC and X, Y are
excenters with respect to angle B, C. Prove that M X, M Y intersect AB, AC at four
points are vertices of circumscribe quadrilateral.

Problem 25. The Magician and his Assistant show trick. The Viewer writes on
the board the sequence of N digits. Then the Assitant covers some pair of adjacent
digits so that they become invisible. Finally, the Magician enters the show, looks
at the board and guesses the covered digits and their order. Find the minimal N
such that the Magician and his Assistant can agree in advance so that the Magician
always guesses right.

Problem 26. Given an infinite sequence of numbers a1 , a2 , a3 , ... such that for each
positive integer k, there exists positive integer t for which ak = ak+t = ak+2t = ....
Does this sequences must be periodic?

Problem 27. Each of N people have chosen some 5 elements from a 23−element
set so that any two people share at most 3 chosen elements. Does this mean that
N ≤ 2020? Answer the same question with 25 instead of 23.

Problem 28. Find all positive integer n ≥ 3 such that it is possible to mark the
vertices of a regular n− gon with the number from 1 to n so that for any three
vertices A, B and C with AB = AC, the number in A is greater or smaller than
both numbers in B, C.

Problem 29. Prove that it is impossible to fill the cells of an 8 × 8 table with the
numbers from 1 to 64 (each number must be used once) so that for each 2 × 2 square,
the difference between products of the numbers on it’s diagonals will be equal to 1.

Problem 30. For a positive integer k, denote by f (k) the number of positive integer
m such that the remainder of km modulo 20193 is greater than m. Find the amount
of different numbers among f (1), f (2), ..., f (20193 ).

SAUDI ARABIAN IMO Booklet 2021

 Problems without solution

Problem 31. Let n be a positive integer. What is the smallest value of m with
m > n such that the set M = {n, n + 1, ..., m} can be partitioned into subsets so that
in each subset, there is a number which equals to the sum of all other numbers of
this subset?

Problem 32. Let N be a positive integer. Consider the sequence a1 , a2 , ..., aN of

positive integers, none of which is a multiple of 2N +1 . For n ≥ N + 1, the number an
is defined as follows: choose k to be the number among 1, 2, ..., n − 1 for which the
remainder obtained when ak is divided by 2n is the smallest, and define an = 2ak (if
there are more than one such k, choose the largeast such k). Prove that there exist
M for which an = aM holds for every n ≥ M.

Problem 33. Call a positive integer x to be remote from a square cubes if each
integer k satisfies both |x − k 2 | > 106 and |x − k 3 | > 106 . Prove that there exist
infinitely many positive integer n such that 2n is remote from squares and cubes.

Problem 34. Let coefficients of the polynomial P (x) = ad xd + ... + a2 x2 + a0 where

d ≥ 2, are positive integers. The sequences (bn ) is defined by b1 = a0 and bn+1 =
P (bn ) for n ≥ 1. Prove that for any n ≥ 2, there exists a prime number p such that
p|bn but it does not divide b1 , b2 , ..., bn−1 .

Problem 35. Let P (x) be a nonconstant integer polynomial and positive integer n.
The sequence a0 , a1 , ... is defined by a0 = n and ak = P (ak−1 ) for k ≥ 1. Given
that for each positive integer b, the sequence contains a b−th power of some positive
integer greater than 1. Prove that degP = 1.

Problem 36. There are 330 seats in the first row of the auditorium. Some of these
seats are occupied by 25 viewers. Prove that among the pairwise distances between
these viewers, there are two equal.

Problem 37. Given n ≥ distinct positve integers a1 , a2 , ..., an none of which is a

perfect cube. Find the maximal possible number of perfect cubes among their pairwise
products.

Problem 38. Prove that the set of all divisors of a positive integer which is not a
perfect square can be divided into pairs so that in each pair, one number is divided
by another.

Problem 39. Determine if there exists pairwise distinct positive integers

a1 , a2 , ..., a101 , b1 , b2 , ..., b101

satisfying
P the following property:
P for each non-empty subset S of {1, 2, ..., 101} the
sum i∈S ai divides 100! + i∈S bi .

Problem 40. Given m, n such that m > nn−1 and the number m+1, m+2, ..., m+n
are composite. Prove that there exist distinct primes p1 , p2 , ..., pn such that m + k is
divisible by pk for each k = 1, 2, ...

SAUDI ARABIAN IMO Booklet 2021