A $2^{2014} + 1$ by $2^{2014} + 1$ grid has some black squares filled. The filled black squares form one or more snakes on the plane, each of whose heads splits at some points but never comes back together. In other words, for every positive integer $n$ greater than $2$, there do not exist pairwise distinct black squares $s_1$, $s_2$, \dots, $s_n$ such that $s_i$ and $s_{i+1}$ share an edge for $i=1,2, \dots, n$ (here $s_{n+1}=s_1$). What is the maximum possible number of filled black squares? [i]Proposed by David Yang[/i]

Prove that for any natural number $ m $ there exists a natural number $ n $ such that any $ n $ distinct points on the plane can be partitioned into $ m $ non-empty sets whose [i]convex hulls[/i] have a common point. The [i] convex hull [/i] of a finite set $ X $ of points on the plane is the set of points lying inside or on the boundary of at least one convex polygon with vertices in $ X $, including degenerate ones, that is, the segment and the point are considered convex polygons. No three vertices of a convex polygon are collinear. The polygon contains its border.

Let $a_{1} < a_{2} < a_{3} < \cdots $ be an infinite increasing sequence of positive integers in which the number of prime factors of each term, counting repeated factors, is never more than $1987$. Prove that it is always possible to extract from $A$ an infinite subsequence $b_{1} < b_{2} < b_{3} < \cdots $ such that the greatest common divisor $(b_i, b_j)$ is the same number for every pair of its terms.

Let $n$ be a positive integer and let $p$ be a prime number. Prove that if $a$, $b$, $c$ are integers (not necessarily positive) satisfying the equations \[ a^n + pb = b^n + pc = c^n + pa\] then $a = b = c$. [i]Proposed by Angelo Di Pasquale, Australia[/i]

Define a sequence $\{x_n\}$ as: $\left\{\begin{aligned}& x_1=3 \\ & x_n=\frac{n+2}{3n}(x_{n-1}+2)\ \ \text{for} \ n\geq 2.\end{aligned}\right.$ Prove that this sequence has a finite limit as $n\to+\infty.$ Also determine the limit.

Ryan stands on the bottom-left square of a 2017 by 2017 grid of squares, where each square is colored either black, gray, or white according to the pattern as depicted to the right. Each second he moves either one square up, one square to the right, or both one up and to the right, selecting between these three options uniformly and independently. Noting that he begins on a black square, find the probability that Ryan is still on a black square after 2017 seconds. [center][img]http://i.imgur.com/WNp59XW.png[/img][/center]

Let $f:\mathbb{R}\longrightarrow \mathbb{R}$ be a function such that $f(x+y+xy)=f(x)+f(y)+f(xy)$ for all $x, y\in\mathbb{R}$. Prove that $f$ satisfies $f(x+y)=f(x)+f(y)$ for all $x, y\in\mathbb{R}$.

Let $x_1 \dots, x_{42}$, be real numbers such that $5x_{i+1}-x_i-3x_ix_{i+1}=1$ for each $1 \le i \le 42$, with $x_1=x_{43}$. Find all the product of all possible values for $x_1 + x_2 + \dots + x_{42}$. [i] Proposed by Michael Ma [/i]

Let be two complex numbers $ a,b $ chosen such that $ |a+b|\ge 2 $ and $ |a+b|\ge 1+|ab|. $ Prove that $$ \left| a^{n+1} +b^{n+1} \right|\ge \left| a^{n} +b^{n} \right| , $$ for any natural number $ n. $ [i]Alin Pop[/i]

A sequence of real numbers $a_1,a_2,\ldots$ satisfies the relation $$a_n=-\max_{i+j=n}(a_i+a_j)\qquad\text{for all}\quad n>2017.$$ Prove that the sequence is bounded, i.e., there is a constant $M$ such that $|a_n|\leq M$ for all positive integers $n$.

Prove that for every positive integer $n,$ the set $\{2,3,4,\ldots,3n+1\}$ can be partitioned into $n$ triples in such a way that the numbers from each triple are the lengths of the sides of some obtuse triangle. [i]Proposed by Canada[/i]

Let define a function $f: \mathbb{N} \rightarrow \mathbb{Z}$ such that : $i)$$f(p)=1$ for all prime numbers $p$. $ii)$$f(xy)=xf(y)+yf(x)$ for all positive integers $x,y$ find the smallest $n \geq 2016$ such that $f(n)=n$

Let $x_1,\ldots,x_n$ be a sequence with each term equal to $0$ or $1$. Form a triangle as follows: its first row is $x_1,\ldots,x_n$ and if a row if $a_1, a_2, \ldots, a_m$, then the next row is $a_1 + a_2, a_2 + a_3, \ldots, a_{m-1} + a_m$ where the addition is performed modulo $2$ (so $1+1=0$). For example, starting from $1$, $0$, $1$, $0$, the second row is $1$, $1$, $1$, the third one is $0$, $0$ and the fourth one is $0$. A sequence is called good it is the same as the sequence formed by taking the last element of each row, starting from the last row (so in the above example, the sequence is $1010$ and the corresponding sequence from last terms is $0010$ and they are not equal in this case). How many possibilities are there for the sequence formed by taking the first element of each row, starting from the last row, which arise from a good sequence?

Determine all integers $n\geqslant 2$ with the following property: every $n$ pairwise distinct integers whose sum is not divisible by $n$ can be arranged in some order $a_1,a_2,\ldots, a_n$ so that $n$ divides $1\cdot a_1+2\cdot a_2+\cdots+n\cdot a_n.$ [i]Arsenii Nikolaiev, Anton Trygub, Oleksii Masalitin, and Fedir Yudin[/i]