On a blackboard a finite number of integers greater than one are written. Every minute, Nordi additionally writes on the blackboard the smallest positive integer greater than every other integer on the blackboard and not divisible by any of the numbers on the blackboard. Show that from some point onwards Nordi only writes primes on the blackboard.

Find all functions $f:R->R$ satisfying that for every $x$ (real number): $f(x)(1+|f(x)|)\geq x \geq f(x(1+|x|))$

Let $n$ be a positive integer. Alice and Bob play the following game. First, Alice picks $n + 1$ subsets $A_1,...,A_{n+1}$ of $\{1,... ,2^n\}$ each of size $2^{n-1}$. Second, Bob picks $n + 1$ arbitrary integers $a_1,...,a_{n+1}$. Finally, Alice picks an integer $t$. Bob wins if there exists an integer $1 \le i \le n + 1$ and $s \in A_i$ such that $s + a_i \equiv t$ (mod $2^n$). Otherwise, Alice wins. Find all values of $n$ where Alice has a winning strategy.

Let $A, B, C$ and $D$ be points on the circle $\omega$ such that $ABCD$ is a convex quadrilateral. Suppose that $AB$ and $CD$ intersect at a point $E$ such that $A$ is between $B$ and $E$ and that $BD$ and $AC$ intersect at a point $F$. Let $X \ne D$ be the point on $\omega$ such that $DX$ and $EF$ are parallel. Let $Y$ be the reflection of $D$ through $EF$ and suppose that $Y$ is inside the circle $\omega$. Show that $A, X$, and $Y$ are collinear.