European Mathematical Cup
Enjoy solving complex problems using
creative mathematical thinking? So do we!
Visit www.janestreet.com to learn more about our educational
programs, internships and full-time roles.
And of course - Good Luck!
Voliš rješavati teške probleme koristeći
kreativno matematičko razmišljanje? I mi!
Posjeti www.janestreet.com gdje možeš saznati više o edukacijama,
stažiranjima i prilikama za zaposlenje.
I naravno - Puno sreće!
MLADI NADARENI MATEMATIČARI
12th European Mathematical Cup Marin Getaldic
9th December 2023 - 17th December 2023
Junior Category
Problem 1. Suppose a, b, c are positive integers such that
gcd(a, b) + gcd(a, c) + gcd(b, c) = b + c + 2023.
Prove that gcd(b, c) = 2023.
Remark: For positive integers x and y, gcd(x, y) denotes their greatest common divisor.
(Ivan Novak)
Problem 2. Let n ⩾ 5 be an integer. There are n points in the plane, no three of them collinear. Each day, Tom
erases one of the points, until there are three points left. On the i-th day, for 1 ⩽ i ⩽ n − 3, before erasing that
day’s point, Tom writes down the positive integer v(i) such that the convex hull of the points at that moment
has v(i) vertices. Finally, he writes down v(n − 2) = 3. Find the greatest possible value that the expression
|v(1) − v(2)| + |v(2) − v(3)| + . . . + |v(n − 3) − v(n − 2)|
can obtain among all possible initial configurations of n points and all possible Tom’s moves.
Remark. A convex hull of a finite set of points in the plane is the smallest convex polygon containing all the
points of the set (inside it or on the boundary).
(Ivan Novak, Namik Agić)
Problem 3. Consider an acute-angled triangle ABC with |AB| < |AC|. Let M and N be the midpoints of
segments BC and AB, respectively. The circle with diameter AB intersects the lines BC, AM and AC at D,
E, and F , respectively. Let G be the midpoint of F C. Prove that the lines N F , DE and GM are concurrent.
(Michal Pecho)
Problem 4. We say a 2023-tuple of nonnegative integers (a1 , a2 , . . . a2023 ) is sweet if the following conditions
hold:
• a1 + a2 + . . . + a2023 = 2023,
• a1
21 + a2
22 + ... + a2023
22023 ⩽ 1.
Determine the greatest positive integer L such that
a1 + 2a2 + . . . + 2023a2023 ⩾ L
holds for every sweet 2023-tuple (a1 , a2 , . . . , a2023 ).
(Ivan Novak)
Time: 240 minutes. Each problem is worth 10 points.
The use of calculators or any other instruments except rulers and compasses is not permitted.
Cheating in any form is strictly prohibited. Sharing or posting the problems or solutions before the end of the
competition (18th of December) to anyone who might participate is strictly prohibited.
