Determine all functions $f$ from the set of non-negative integers to itself such that $f(a + b) = f(a) + f(b) + f(c) + f(d)$, whenever $a, b, c, d$, are non-negative integers satisfying $2ab = c^2 + d^2$.

Let $p > 3$ be a prime number, and let $F_p$ denote the (finite) set of residue classes modulo $p$. Let $S_d$ denote the set of $2$-variable polynomials $P(x, y)$ with coefficients in $F_p$, total degree $\le d$, and satisfying $P(x, y) = P(y,- x -y)$. Show that $$|S_d| = p^{\lceil (d+1)(d+2)/6 \rceil}$$. The total degree of a $2$-variable polynomial $P(x, y)$ is the largest value of $i + j$ among monomials $x^iy^j$ appearing in $P$.

We start with any finite list of distinct positive integers. We may replace any pair $n, n + 1$ (not necessarily adjacent in the list) by the single integer $n-2$, now allowing negatives and repeats in the list. We may also replace any pair $n, n + 4$ by $n - 1$. We may repeat these operations as many times as we wish. Either determine the most negative integer which can appear in a list, or prove that there is no such minimum.

A frog trainer places one frog at each vertex of an equilateral triangle $ABC$ of unit sidelength. The trainer can make one frog jump over another along the line joining the two, so that the total length of the jump is an even multiple of the distance between the two frogs just before the jump. Let $M$ and $N$ be two points on the rays $AB$ and $AC$, respectively, emanating from $A$, such that $AM = AN = \ell$, where $\ell$ is a positive integer. After a finite number of jumps, the three frogs all lie in the triangle $AMN$ (inside or on the boundary), and no more jumps are performed. Determine the number of final positions the three frogs may reach in the triangle $AMN$. (During the process, the frogs may leave the triangle $AMN$, only their nal positions are to be in that triangle.)

A set $S=\{ s_1,s_2,...,s_k\}$ of positive real numbers is "polygonal" if $k\geq 3$ and there is a non-degenerate planar $k-$gon whose side lengths are exactly $s_1,s_2,...,s_k$; the set $S$ is multipolygonal if in every partition of $S$ into two subsets,each of which has at least three elements, exactly one of these two subsets in polygonal. Fix an integer $n\geq 7$. (a) Does there exist an $n-$element multipolygonal set, removal of whose maximal element leaves a multipolygonal set? (b) Is it possible that every $(n-1)-$element subset of an $n-$element set of positive real numbers be multipolygonal?

Prove that a $46$-element set of integers contains two distinct doubletons $\{u, v\}$ and $\{x,y\}$ such that $u + v \equiv x + y$ (mod $2016$).

Two circles, $\omega_1$ and $\omega_2$, centred at $O_1$ and $O_2$, respectively, meet at points $A$ and $B$. A line through $B$ meets $\omega_1$ again at $C$, and $\omega_2$ again at $D$. The tangents to $\omega_1$ and $\omega_2$ at $C$ and $D$, respectively, meet at $E$, and the line $AE$ meets the circle $\omega$ through $A, O_1, O_2$ again at $F$. Prove that the length of the segment $EF$ is equal to the diameter of $\omega$.

Determine all integers $n \ge 3$ whose decimal expansion has less than $20$ digits, such that every quadratic non-residue modulo $n$ is a primitive root modulo $n$. An integer $a$ is a quadratic non-residue modulo $n$, if there is no integer $b$ such that $a - b^2$ is divisible by $n$. An integer $a$ is a primitive root modulo $n$, if for every integer $b$ relatively prime to n there is a positive integer $k$ such that $a^k - b$ is divisible by $n$.

Given a prime $p$, prove that the sum $\sum_{k=1}^{\lfloor \frac{q}{p} \rfloor}{k^{p-1}}$ is not divisible by $q$ for all but finitely many primes $q$.