For each pair $(\alpha, \beta)$ of non-negative reals with $\alpha+\beta \geq 2$, determine all functions $f:\mathbb{R} \rightarrow \mathbb{R}$, such that $$f(x)f(y) \leq f(xy)+\alpha x+\beta y$$for all reals $x, y$.

Find all positive integers $n \geq 3$, for which it is possible to draw $n$ chords on a circle, with their $2n$ endpoints being pairwise distinct, such that each chords intersects exactly $k$ others for: (a) $k=n-2$, (b) $k=n-3$.

Let $ABC$ be a triangle with incenter $I$, and the incircle touches $BC$ at $D$. The points $E, F$ are such that $BE \parallel AI \parallel CF$ and $\angle BEI=\angle CFI=90^{\circ}$. If $DE, DF$ meet the incircle at $E', F'$, show that $E'F' \perp AI$.

Let $n, m$ be positive integers. A set $S$ of positive integers is called $(n, m)$-good, if: (1) $m \in S$; (2) for all $a\in S$, all divisors of $a$ are also in $S$; (3) for all distinct $a, b \in S$, $a^n+b^n \in S$. For which $(n, m)$, the only $(n, m)$-good set is $\mathbb{N}$?

(a) A function $f:\mathbb{Z} \rightarrow \mathbb{Z}$ is called $\mathbb{Z}$-good if $f(a^2+b)=f(b^2+a)$ for all $a, b \in \mathbb{Z}$. What is the largest possible number of distinct values that can occur among $f(1), \ldots, f(2023)$, where $f$ is a $\mathbb{Z}$-good function? (b) A function $f:\mathbb{N} \rightarrow \mathbb{N}$ is called $\mathbb{N}$-good if $f(a^2+b)=f(b^2+a)$ for all $a, b \in \mathbb{N}$. What is the largest possible number of distinct values that can occur among $f(1), \ldots, f(2023)$, where $f$ is a $\mathbb{N}$-good function?

If $a, b, c, d>0$ and $abcd=1$, show that $$\frac{ab+1}{a+1}+\frac{bc+1}{b+1}+\frac{cd+1}{c+1}+\frac{da+1}{d+1} \geq 4. $$When does equality hold?

Find the smallest integer $b$ with the following property: For each way of colouring exactly $b$ squares of an $8 \times 8$ chessboard green, one can place $7$ bishops on $7$ green squares so that no two bishops attack each other.

Let $c \geq 4$ be an even integer. In some football league, each team has a home uniform and anaway uniform. Every home uniform is coloured in two different colours, and every away uniformis coloured in one colour. A team’s away uniform cannot be coloured in one of the colours fromthe home uniform. There are at most $c$ distinct colours on all of the uniforms. If two teams havethe same two colours on their home uniforms, then they have different colours on their away uniforms. We say a pair of uniforms is clashing if some colour appears on both of them. Suppose that for every team $X$ in the league, there is no team $Y$ in the league such that the home uniform of $X$ is clashing with both uniforms of $Y$. Determine the maximum possible number of teams in the league.

We are given a convex quadrilateral $ABCD$ whose angles are not right. Assume there are points $P, Q, R, S$ on its sides $AB, BC, CD, DA$, respectively, such that $PS \parallel BD$, $SQ \perp BC$, $PR \perp CD$. Furthermore, assume that the lines $PR, SQ$, and $AC$ are concurrent. Prove thatthe points $P, Q, R, S$ are concyclic.

Let $ABC$ be an acute triangle with $AB < AC$. Let $J$ be the center of the $A$-excircle of $ABC$. Let $D$ be the projection of $J$ on line $BC$. The internal bisectors of angles $BDJ$ and $JDC$ intersectlines $BJ$ and $JC$ at $X$ and $Y$, respectively. Segments $XY$ and $JD$ intersect at $P$. Let $Q$ be the projection of $A$ on line $BC$. Prove that the internal angle bisector of $QAP$ is perpendicular to line $XY$. Proposed by Dominik Burek, Poland

Find all positive integers $n$, for which there exist positive integers $a>b$, satisfying $n=\frac{4ab}{a-b}$.

Let $A, B \in \mathbb{N}$. Consider a sequence $x_1, x_2, \ldots$ such that for all $n\geq 2$, $$x_{n+1}=A \cdot \gcd(x_n, x_{n-1})+B. $$Show that the sequence attains only finitely many distinct values.