November 9 to 13, 2023 Version: English

Time allowed: 4 hours and 30 minutes.

During the rst 30 minutes, questions may be asked.
Tools for writing and drawing are the only ones allowed.

Problem 1: Find all strictly increasing sequences 1 = a1 < a2 < a3 < ⋯ of positive integers
satisfying
3(a1 + a2 + . . . + an ) = an+1 + an+2 + ⋅ ⋅ ⋅ + a2n
for all positive integers n.

Problem 2: Let a1 , a2 , . . . , a2023 be positive real numbers with

a1 + a22 + a33 + ⋅ ⋅ ⋅ + a2023
2023 = 2023.

Show that
1
a2023
1 + a2022
2 + ⋅ ⋅ ⋅ + a22022 + a2023 > 1 + .
2023

Problem 3: Denote a set of equations in the real numbers with variables x1 , x2 , x3 ∈ R

Flensburgian if there exists an i ∈ {1, 2, 3} such that every solution of the set of equations where
all the variables are pairwise dierent, satises xi > xj for all j ≠ i.
Determine for which positive integers n ≥ 2, the following set of two equations
an + b = a and cn+1 + b2 = ab

in the three real variables a, b, c is Flensburgian.

Problem 4: Determine all functions f ∶ R → R that satisfy

f (f (x) + y) + xf (y) = f (xy + y) + f (x)

for all real numbers x and y .

Problem 5: Find the smallest positive real number α, such that

√
x+y √ x2 + y 2
≥ α xy + (1 − α)
2 2
for all positive real numbers x and y .
 November 9 to 13, 2023 Version: English

Problem 6: Let n be a positive integer. Each cell of an n × n table is coloured in one of k

colours where every colour is used at least once. Two dierent colours A and B are said to
touch each other, if there exists a cell coloured in A sharing a side with a cell coloured in B .
The table is coloured in such a way that each colour touches at most 2 other colours. What is
the maximal value of k in terms of n?

Problem 7: A robot moves in the plane in a straight line, but every one meter it turns 90○
to the right or to the left. At some point it reaches its starting point without having visited
any other point more than once, and stops immediately. What are the possible path lengths of
the robot?

Problem 8: In the city of Flensburg there is a single, innitely long, street with houses
numbered 2, 3, . . . The police in Flensburg is trying to catch a thief who every night moves
from the house where she is currently hiding to one of its neighbouring houses.
To taunt the local law enforcement the thief reveals every morning the highest prime divisor of
the number of the house she has moved to.
Every Sunday afternoon the police searches a single house, and they catch the thief if they
search the house she is currently occupying. Does the police have a strategy to catch the thief
in nite time?

Problem 9: Determine if there exists a triangle that can be cut into 101 congruent trian-
gles.

Problem 10: On a circle, n ≥ 3 points are marked. Each marked point is coloured red, green
or blue. In one step, one can erase two neighbouring marked points of dierent colours and
mark a new point between the locations of the erased points with the third colour. In a nal
state, all marked points have the same colour which is called the colour of the nal state. Find
all n for which there exists an initial state of n marked points with one missing colour, from
which one can reach a nal state of any of the three colours by applying a suitable sequence of
steps.
 November 9 to 13, 2023 Version: English

Problem 11: Let ABC be a triangle and let J be the centre of the A-excircle. The reection
of J in BC is K . The points E and F are on BJ and CJ , respectively, such that ∠EAB =
∠CAF = 90○ . Prove that ∠F KE + ∠F JE = 180○ .
Remark: The A-excircle is the circle that touches the side BC and the extensions of AC and
AB .

Problem 12: Let ABC be an acute triangle with AB > AC . The internal angle bisector of
∠BAC intersects BC at D. Let O be the circumcentre of ABC . Let AO intersect the segment
BC at E . Let J be the incentre of AED. Prove that if ∠ADO = 45○ then OJ = JD.

Problem 13: Let ABC be an acute triangle with AB < AC and incentre I . Let D be the
projection of I onto BC . Let H be the orthocentre of ABC . Given ∠IDH = ∠CBA − ∠ACB ,
prove that AH = 2 ⋅ ID.

Problem 14: Let ABC be a triangle with centroid G. Let D, E and F be the circumcentres
of BCG, CAG and ABG, respectively. Let X be the intersection of the perpendiculars from
E to AB and from F to AC . Prove that DX bisects the segment EF .

Problem 15: Let ω1 and ω2 be circles with no common points, such that neither circle lies
inside the other. Points M and N are chosen on the circles ω1 and ω2 , respectively, such that
the tangent to the circle ω1 at M and the tangent to the circle ω2 at N intersect at P and such
that P M N is an isosceles triangle with P M = P N . The circles ω1 and ω2 meet the segment
M N again at A and B , respectively. The line P A meets the circle ω1 again at C and the line
P B meets the circle ω2 again at D. Prove that ∠BCN = ∠ADM .
 November 9 to 13, 2023 Version: English

Problem 16: Prove that there exist nonconstant polynomials f and g with integer coecients
such that, for innitely many primes p, there are no integers x and y with p ∣ f (x)−g(y).

Problem 17: Let S(m) be the sum of the digits of the positive integer m. Find all pairs
(a, b) of positive integers such that S(ab+1 ) = ab .

Problem 18: Let p > 7 be a prime number and let A be a subset of {0, 1, . . . , p − 1} consisting
of at least p−1
2 elements. Show that for each integer r , there exist (not necessarily distinct)
numbers a, b, c, d ∈ A such that
ab − cd ≡ r (mod p).

Problem 19: Show that the sum of the digits of 222⋅2023 is greater than 2023.

Problem 20: Let n be a positive integer. A German set in an n × n square grid is a set
of n cells which contains exactly one cell in each row and column. Given a labelling of the
cells with the integers from 1 to n2 using each integer exactly once, we say that an integer is a
German product if it is the product of the labels of the cells in a German set.
(a) Let n = 8. Determine whether there exists a labelling of an 8 × 8 grid such that the
following condition is fullled: The dierence of any two German products is always
divisible by 65.
(b) Let n = 10. Determine whether there exists a labelling of a 10 × 10 grid such that the
following condition is fullled: The dierence of any two German products is always
divisible by 101.