olymmath

MK-MO 2023

North Macedonia national mathematics olympiad 2023.

Other problems

Problem 1

Determine all functions f:R→Rf:\mathbb{R} \rightarrow \mathbb{R} such that for all x,y∈Rx,y \in \mathbb{R} we have: xf(x+y)+yf(y−x)=f(x2+y2) .xf(x+y)+yf(y-x) = f(x^2+y^2)\,. Authored by Nikola Velov

Problem 2

Let pp and qq be odd prime numbers and aa a positive integer so that p∣aq+1p|a^q+1 and q∣ap+1q|a^p+1 . Show that p∣a+1p|a+1 or q∣a+1q|a+1 .

Authored by Nikola Velov

Problem 3

In a city of gnomes there are 10001000 identical towers, each of which has 10001000 stories, with exactly one gnome living on each story. Every gnome in the city wears a hat colored in one of 10001000 possible colors and any two gnomes in the same tower have different hats. A pair of gnomes are friends if they wear hats of the same color, one of them lives in the kk -th story of his tower and the other one in the (k+1)(k+1) -st story of his tower. Determine the maximal possible number of pairs of gnomes which are friends.

Authored by Nikola Velov

Problem 4

Let ABCABC be a scalene acute triangle with orthocenter HH . The circle with center AA and radius AHAH meets the circumcircle of BHCBHC at Ta≠HT_{a} \neq H . Define TbT_{b} and TcT_{c} similarly. Show that HH lies on the circumcircle of TaTbTcT_{a}T_{b}T_{c} .

Authored by Nikola Velov

Problem 5

There are nn boys and nn girls sitting around a circular table, where n>3n>3 . In every move, we are allowed to swap the places of 22 adjacent children. The entropy of a configuration is the minimal number of moves such that at the end of them each child has at least one neighbor of the same gender.

Find the maximal possible entropy over the set of all configurations.

Authored by Viktor Simjanoski