Let $ABC$ be a triangle with $AC > BC,$ let $\omega$ be the circumcircle of $\triangle ABC,$ and let $r$ be its radius. Point $P$ is chosen on $\overline{AC}$ such taht $BC=CP,$ and point $S$ is the foot of the perpendicular from $P$ to $\overline{AB}$. Ray $BP$ mets $\omega$ again at $D$. Point $Q$ is chosen on line $SP$ such that $PQ = r$ and $S,P,Q$ lie on a line in that order. Finally, let $E$ be a point satisfying $\overline{AE} \perp \overline{CQ}$ and $\overline{BE} \perp \overline{DQ}$. Prove that $E$ lies on $\omega$.

Let $a, b, c$ be positive real numbers satisfying \[a+b+c = a^2 + b^2 + c^2.\]Let \[M = \max\left(\frac{2a^2}{b} + c, \frac{2b^2}{a} + c \right) \quad \text{ and } \quad N = \min(a^2 + b^2, c^2).\]Find the minimum possible value of $M/N$.

Let $m$ and $n$ be positive integers greater than $1$. In each unit square of an $m\times n$ grid lies a coin with its tail side up. A move consists of the following steps. select a $2\times 2$ square in the grid; flip the coins in the top-left and bottom-right unit squares; flip the coin in either the top-right or bottom-left unit square. Determine all pairs $(m,n)$ for which it is possible that every coin shows head-side up after a finite number of moves. Thanasin Nampaisarn, Thailand

Determine all ordered pairs $(a,p)$ of positive integers, with $p$ prime, such that $p^a+a^4$ is a perfect square. Proposed by Tahjib Hossain Khan, Bangladesh

A fighting game club has $2024$ members. One day, a game of Smash is played between some pairs of members so that every member has played against exactly $3$ other members. Each match has a winner and a loser. A member will be happy if they won in at least $2$ of the matches. What is the maximum number of happy members over all possible match-ups and all possible outcomes?

Prove that for all integers $n \geq 3$, there exist odd positive integers $x$, $y$ such that $7x^2 + y^2 = 2^n$.

Let $\mathbb{R}$ be the set of real numbers. Let $f:\mathbb{R}\rightarrow\mathbb{R}$ be a function such that \[f(x+y)f(x-y)\geqslant f(x)^2-f(y)^2\]for every $x,y\in\mathbb{R}$. Assume that the inequality is strict for some $x_0,y_0\in\mathbb{R}$. Prove that either $f(x)\geqslant 0$ for every $x\in\mathbb{R}$ or $f(x)\leqslant 0$ for every $x\in\mathbb{R}$.

Let $ABC$ be a triangle and let $X$ and $Y$ be points on the $A$-symmedian such that $AX = XB$ and $AY = YC$. Let $BX$ and $CY$ meet at $Z$. Let the $Z$-excircle of triangle $XYZ$ touch $ZX$ and $ZY$ at $E$ and $F$. Show that $A$, $E$, $F$ are collinear.