The sum of the angles $A$ and $C$ of a convex quadrilateral $ABCD$ is less than $180^{\circ} .$ Prove that \[AB \cdot CD + AD \cdot BC < AC(AB + AD).\]

Consider the triangle $ABC$ with $\angle BCA > 90^{\circ}$. The circumcircle $\Gamma$ of $ABC$ has radius $R$. There is a point $P$ in the interior of the line segment $AB$ such that $PB = PC$ and the length of $PA$ is $R$. The perpendicular bisector of $PB$ intersects $\Gamma$ at the points $D$ and $E$. Prove $P$ is the incentre of triangle $CDE$.

Let $n \geq 0$ be an integer. Prove that \[ \lceil \sqrt n +\sqrt{n+1}+\sqrt{n+2} \rceil = \lceil \sqrt{9n+8} \rceil\] Where $\lceil x \rceil $ is the smallest integer which is greater or equal to $x.$

Each person stands on a whole number on the number line from $0$ to $2022$ . In each turn, two people are selected by a distance of at least $2$. These go towards each other by $1$. When no more such moves are possible, the process ends. Show that this process always ends after a finite number of moves, and determine all possible configurations where people can end up standing. (whereby is for each configuration is only of interest how many people stand at each number.) [i](Birgit Vera Schmidt)[/i] [hide=original wording]Bei jeder ganzen Zahl auf dem Zahlenstrahl von 0 bis 2022 steht zu Beginn eine Person. In jedem Zug werden zwei Personen mit Abstand mindestens 2 ausgewählt. Diese gehen jeweils um 1 aufeinander zu. Wenn kein solcher Zug mehr möglich ist, endet der Vorgang. Man zeige, dass dieser Vorgang immer nach endlich vielen Zügen endet, und bestimme alle möglichen Konfigurationen, wo die Personen am Ende stehen können. (Dabei ist für jede Konfiguration nur von Interesse, wie viele Personen bei jeder Zahl stehen.)[/hide]

Prove that for all real numbers $x$ holds: $$\sin 5x = 16 \sin x \cdot \sin \left(x -\frac{\pi}{5} \right) \cdot \sin\left(x -\frac{2\pi}{5} \right) \sin \left(x +\frac{2\pi}{5} \right) $$

Let $k$ be a positive integer and $M_k$ the set of all the integers that are between $2 \cdot k^2 + k$ and $2 \cdot k^2 + 3 \cdot k,$ both included. Is it possible to partition $M_k$ into 2 subsets $A$ and $B$ such that \[ \sum_{x \in A} x^2 = \sum_{x \in B} x^2. \]

If $a, b, c$ are positive integers such that \[0 < a^{2}+b^{2}-abc \le c,\] show that $a^{2}+b^{2}-abc$ is a perfect square.

Two players play the following game, using a round table $4$ feet in diameter, and a large pile of quarters. Each player can put in his turn one quarter on the table, but the one who cannot put a quarter (because there is no free space on the table) loses the game. Is there a winning strategy for the first or for the second player?

Let $D$ be a point in the interior of $\triangle{ABC}$ such that $AB=ab$, $AC=ac$, $BC=bc$, $AD=ad$, $BD=bd$, $CD=cd$. Show that $\angle{ABD}+\angle{ACD}=60^{\circ}$. Source: 2016 Singapore Mathematical Olympiad (Open) Round 2, Problem 1

Hermione and Ron play a game that starts with $129$ hats arranged in a circle. They take turns magically transforming the hats into animals. On each turn, a player picks a hat and chooses whether to change it into a badger or into a raven. A player loses if after his or her turn there are two animals of the same species right next to each other. Hermione goes first. Who loses?

Determine the set of all polynomials $P(x)$ with real coefficients such that the set $\{P(n) | n \in \mathbb{Z}\}$ contains all integers, except possibly finitely many of them.

Let $S$ be a square with sides length $100$. Let $L$ be a path within $S$ which does not meet itself and which is composed of line segments $A_0A_1,A_1A_2,A_2A_3,\ldots,A_{n-1}A_n$ with $A_0=A_n$. Suppose that for every point $P$ on the boundary of $S$ there is a point of $L$ at a distance from $P$ no greater than $\frac {1} {2}$. Prove that there are two points $X$ and $Y$ of $L$ such that the distance between $X$ and $Y$ is not greater than $1$ and the length of the part of $L$ which lies between $X$ and $Y$ is not smaller than $198$.

Let $ p$ be a prime number, $ p\not \equal{} 3$, and integers $ a,b$ such that $p\mid a+b$ and $ p^2\mid a^3 \plus{} b^3$. Prove that $ p^2\mid a \plus{} b$ or $ p^3\mid a^3 \plus{} b^3$.

Find all pairs of positive integers $x,y$ such that $x^2 +615 = 2^y$

Let $p$ and $n$ be positive integers. Suppose that the numbers $c_{hk}$ ($h=1,2,\ldots,n$ ; $k=1,2,\ldots,ph$) satisfy $0 \leq c_{hk} \leq 1.$ Prove that $$ \left( \sum \frac{ c_{hk} }{h} \right)^2 \leq 2p \sum c_{hk} ,$$ where each summation is over all admissible ordered pairs $(h,k).$

Show that, if $n \neq 2$ is a positive integer, that there are $n$ triangular numbers $a_1$, $a_2$, $\ldots$, $a_n$ such that $\displaystyle{\sum_{i=1}^n \frac1{a_i} = 1}$ (Recall that the $k^{th}$ triangular number is $\frac{k(k+1)}2$).