Two different integers $u$ and $v$ are written on a board. We perform a sequence of steps. At each step we do one of the following two operations: (i) If $a$ and $b$ are different integers on the board, then we can write $a + b$ on the board, if it is not already there. (ii) If $a$, $b$ and $c$ are three different integers on the board, and if an integer $x$ satisfies $ax^2 +bx+c = 0$, then we can write $x$ on the board, if it is not already there. Determine all pairs of starting numbers $(u, v)$ from which any integer can eventually be written on the board after a finite sequence of steps.

Let $ABC$ be a triangle with $AC>AB$ , and denote its circumcircle by $\Omega$ and incentre by $I$. Let its incircle meet sides $BC,CA,AB$ at $D,E,F$ respectively. Let $X$ and $Y$ be two points on minor arcs $\widehat{DF}$ and $\widehat{DE}$ of the incircle, respectively, such that $\angle BXD = \angle DYC$. Let line $XY$ meet line $BC$ at $K$. Let $T$ be the point on $\Omega$ such that $KT$ is tangent to $\Omega$ and $T$ is on the same side of line $BC$ as $A$. Prove that lines $TD$ and $AI$ meet on $\Omega$. Tommy Walker Mackay, United Kingdom

We call a positive integer $n{}$ peculiar if, for any positive divisor $d{}$ of $n{}$ the integer $d(d + 1)$ divides $n(n + 1).$ Prove that for any four different peculiar positive integers $A, B, C$ and $D{}$ the following holds: \[\gcd(A, B, C, D) = 1.\]

For a sequence $a_1<a_2<\cdots<a_n$ of integers, a pair $(a_i,a_j)$ with $1\leq i<j\leq n$ is called interesting if there exists a pair $(a_k,a_l)$ of integers with $1\leq k<l\leq n$ such that $$\frac{a_l-a_k}{a_j-a_i}=2.$$For each $n\geq 3$, find the largest possible number of interesting pairs in a sequence of length $n$.

Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ such that the following conditions are true for every pair of positive integers $(x, y)$: $(i)$: $x$ and $f(x)$ have the same number of positive divisors. $(ii)$: If $x \nmid y$ and $y \nmid x$, then: $$\gcd(f(x), f(y)) > f(\gcd(x, y))$$

Find all positive integers $d$ for which there exists a degree $d$ polynomial $P$ with real coefficients such that there are at most $d$ different values among $P(0),P(1),P(2),\cdots,P(d^2-d)$ .