EMC-2023
EMC-2023
– Junior
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
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 con-
taining all the points of the set (inside it or on the boundary).
Ivan Novak, Namik Agić
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
4 We say that a 2023-tuple of nonnegative integers (a1 , . . . , a2023 ) is sweet if the following condi-
tions hold:
- a1 + . . . + a2023 = 2023
- a21 + a222 + . . . + a22023
2023
≤1
a1 + 2a2 + . . . + 2023a2023 ≥ L
– Senior
2 Let ABC be a triangle such that ∠BAC = 90◦ . The incircle of triangle ABC is tangent to the
sides BC, CA, AB at D, E, F respectively. Let M be the midpoint of EF . Let P be the projection
of A onto BC and let K be the intersection of M P and AD. Prove that the circumcircles of
triangles AF E and P DK have equal radius.
Kyprianos-Iason Prodromidis
3 Let n be a positive integer. Let Bn be the set of all binary strings of length n. For a binary string
s1 . . . sn , we define it’s twist in the following way. First, we count how many blocks of consecutive
digits it has. Denote this number by b. Then, we replace sb with 1 − sb . A string a is said to be a
descendant of b if a can be obtained from b through a finite number of twists. A subset of Bn is
called divided if no two of its members have a common descendant. Find the largest possible
cardinality of a divided subset of Bn .
Remark. Here is an example of a twist: 101100 → 101000 because 1 | 0 | 11 | 00 has 4 blocks of
consecutive digits.
Viktor Simjanoski
4 Let f : N → N be a function such that for all positive integers x and y, the number f (x) + y is a
perfect square if and only if x + f (y) is a perfect square. Prove that f is injective.
Remark. A function f : N → N is injective if for all pairs (x, y) of distinct positive integers, f (x) ̸=
f (y) holds.
Ivan Novak