2023 Macedonian Team Selection Test

Day 1

Problem 1

Let $s(n)$ denote the smallest prime divisor and $d(n)$ denote the number of positive divisors of a positive integer $n>1$. Is it possible to choose $2023$ positive integers $a_{1},a_{2},...,a_{2023}$ with $a_{1}<a_{2}-1<...<a_{2023}-2022$ such that for all $k=1,...,2022$ we have $d(a_{k+1}-a_{k}-1)>2023^{k}$ and $s(a_{k+1}-a_{k}) > 2023^{k}$? Proposed by Nikola Velov

Problem 2

Let $ABC$ be an acute triangle such that $AB<AC$ and $AB<BC$. Let $P$ be a point on the segment $BC$ such that $\angle APB = \angle BAC$. The tangent to the circumcircle of triangle $ABC$ at $A$ meets the circumcircle of triangle $APB$ at $Q \neq A$. Let $Q'$ be the reflection of $Q$ with respect to the midpoint of $AB$. The line $PQ$ meets the segment $AQ'$ at $S$. Prove that $$\frac{1}{AB}+\frac{1}{AC} > \frac{1}{CS}.$$ Proposed by Nikola Velov

Problem 3

Let $f:\mathbb{N} \rightarrow \mathbb{N}$ be a monotonically increasing function over the natural numbers, such that $f(f(n))=n^{2}$. What is the smallest, and what is the largest value that $f(2023)$ can take? Proposed by Ilija Jovcheski

Day 2

Problem 4

Let $f: \mathbb{R}^2 \to \mathbb{R}$ be a function satisfying the following property: If $A, B, C \in \mathbb{R}^2$ are the vertices of an equilateral triangle with sides of length $1$, then $$f(A) + f(B) + f(C) = 0.$$Show that $f(x) = 0$ for all $x \in \mathbb{R}^2$. Proposed by Ilir Snopce

Problem 5

Let $Q(x) = a_{2023}x^{2023}+a_{2022}x^{2022}+\dots+a_{1}x+a_{0} \in \mathbb{Z}[x]$ be a polynomial with integer coefficients. For an odd prime number $p$ we define the polynomial $Q_{p}(x) = a_{2023}^{p-2}x^{2023}+a_{2022}^{p-2}x^{2022}+\dots+a_{1}^{p-2}x+a_{0}^{p-2}.$ Assume that there exist infinitely primes $p$ such that $$\frac{Q_{p}(x)-Q(x)}{p}$$is an integer for all $x \in \mathbb{Z}$. Determine the largest possible value of $Q(2023)$ over all such polynomials $Q$. Proposed by Nikola Velov

Problem 6

Lucky and Jinx were given a paper with $2023$ points arranged as the vertices of a regular polygon. They were then tasked to color all the segments connecting these points such that no triangle formed with these points has all edges in the same color, nor in three different colors and no quadrilateral (not necessarily convex) has all edges in the same color. After the coloring it was determined that Jinx used at least two more colors than Lucky. How many colors did each of them use? Proposed by Ilija Jovcheski