On the board, we write the integers $1, 2, 3, \dots, 2019$. At each minute, we pick two numbers on the board $a$ and $b$, delete them, and write down the number $s(a + b)$ instead, where $s(n)$ denotes the sum of the digits of the integer $n$. Let $N$ be the last number on the board at the end. [list=a] [*] Is it possible to get $N = 19$? [*] Is it possible to get $N = 15$? [/list]

Let $P_1$, $P_2$, $\dots$, $P_{2n}$ be $2n$ distinct points on the unit circle $x^2+y^2=1$, other than $(1,0)$. Each point is colored either red or blue, with exactly $n$ red points and $n$ blue points. Let $R_1$, $R_2$, $\dots$, $R_n$ be any ordering of the red points. Let $B_1$ be the nearest blue point to $R_1$ traveling counterclockwise around the circle starting from $R_1$. Then let $B_2$ be the nearest of the remaining blue points to $R_2$ travelling counterclockwise around the circle from $R_2$, and so on, until we have labeled all of the blue points $B_1, \dots, B_n$. Show that the number of counterclockwise arcs of the form $R_i \to B_i$ that contain the point $(1,0)$ is independent of the way we chose the ordering $R_1, \dots, R_n$ of the red points.

Let $\mathbb{Q}$ be the set of rational numbers. A function $f: \mathbb{Q} \to \mathbb{Q}$ is called aquaesulian if the following property holds: for every $x,y \in \mathbb{Q}$, \[ f(x+f(y)) = f(x) + y \quad \text{or} \quad f(f(x)+y) = x + f(y). \] Show that there exists an integer $c$ such that for any aquaesulian function $f$ there are at most $c$ different rational numbers of the form $f(r) + f(-r)$ for some rational number $r$, and find the smallest possible value of $c$.

Let $ a_1, a_2, ..., a_{300}$ be nonnegative real numbers, with $ \sum_{i\equal{}1}^{300} a_i \equal{} 1$. Find the maximum possible value of $ \sum_{i \neq j, i|j} a_ia_j$.

Let $-1 < x_1 < x_2 , \cdots < x_n < 1$ and $x_1^{13} + x_2^{13} + \cdots + x_n^{13} = x_1 + x_2 + \cdots + x_n$. Prove that if $y_1 < y_2 < \cdots < y_n$, then \[ x_1^{13}y_1 + \cdots + x_n^{13}y_n < x_1y_1 + x_2y_2 + \cdots + x_ny_n. \]

In how many ways every unit square of a $2018$ x $2018$ board can be colored in red or white such that number of red unit squares in any two rows are distinct and number of red squares in any two columns are distinct.

The numbers $1,2,\dots,2000$ are written on the board. Two players are playing a game with alternating moves. A move consists of erasing two number $a,b$ and writing $a^b$. After some time only one number is left. The first player wins, if the numbers last digit is $2$, $7$ or $8$. If not, the second player wins. Who has a winning strategy? [I]Proposed by V. Frank[/i]

We attach to the vertices of a regular hexagon the numbers $1$, $0$, $0$, $0$, $0$, $0$. Now, we are allowed to transform the numbers by the following rules: (a) We can add an arbitrary integer to the numbers at two opposite vertices. (b) We can add an arbitrary integer to the numbers at three vertices forming an equilateral triangle. (c) We can subtract an integer $t$ from one of the six numbers and simultaneously add $t$ to the two neighbouring numbers. Can we, just by acting several times according to these rules, get a cyclic permutation of the initial numbers? (I. e., we started with $1$, $0$, $0$, $0$, $0$, $0$; can we now get $0$, $1$, $0$, $0$, $0$, $0$, or $0$, $0$, $1$, $0$, $0$, $0$, or $0$, $0$, $0$, $1$, $0$, $0$, or $0$, $0$, $0$, $0$, $1$, $0$, or $0$, $0$, $0$, $0$, $0$, $1$ ?)

Let $ p,q,n$ be three positive integers with $ p \plus{} q < n$. Let $ (x_{0},x_{1},\cdots ,x_{n})$ be an $ (n \plus{} 1)$-tuple of integers satisfying the following conditions : (a) $ x_{0} \equal{} x_{n} \equal{} 0$, and (b) For each $ i$ with $ 1\leq i\leq n$, either $ x_{i} \minus{} x_{i \minus{} 1} \equal{} p$ or $ x_{i} \minus{} x_{i \minus{} 1} \equal{} \minus{} q$. Show that there exist indices $ i < j$ with $ (i,j)\neq (0,n)$, such that $ x_{i} \equal{} x_{j}$.

Let $n \geq 3$ be a fixed integer. The number $1$ is written $n$ times on a blackboard. Below the blackboard, there are two buckets that are initially empty. A move consists of erasing two of the numbers $a$ and $b$, replacing them with the numbers $1$ and $a+b$, then adding one stone to the first bucket and $\gcd(a, b)$ stones to the second bucket. After some finite number of moves, there are $s$ stones in the first bucket and $t$ stones in the second bucket, where $s$ and $t$ are positive integers. Find all possible values of the ratio $\frac{t}{s}$.

Initially, there are $14$ numbers written on the board - zeros and ones. Every minute, Anton chooses half of the numbers on the board and adds $1$ to each of them, while Mykhailo multiplies all the other numbers by $8$. At some point (possibly initially), all the numbers on the board become equal. How many ones could have been on the board initially? [i]Proposed by Oleksii Masalitin[/i]

Construct a tetromino by attaching two $2 \times 1$ dominoes along their longer sides such that the midpoint of the longer side of one domino is a corner of the other domino. This construction yields two kinds of tetrominoes with opposite orientations. Let us call them $S$- and $Z$-tetrominoes, respectively. Assume that a lattice polygon $P$ can be tiled with $S$-tetrominoes. Prove that no matter how we tile $P$ using only $S$- and $Z$-tetrominoes, we always use an even number of $Z$-tetrominoes. [i]Proposed by Tamas Fleiner and Peter Pal Pach, Hungary[/i]

In $\triangle ABC$, a point $D$ lies on line $BC$. The circumcircle of $ABD$ meets $AC$ at $F$ (other than $A$), and the circumcircle of $ADC$ meets $AB$ at $E$ (other than $A$). Prove that as $D$ varies, the circumcircle of $AEF$ always passes through a fixed point other than $A$, and that this point lies on the median from $A$ to $BC$. [i]Proposed by Allen Liu[/i]

We have $2^m$ sheets of paper, with the number $1$ written on each of them. We perform the following operation. In every step we choose two distinct sheets; if the numbers on the two sheets are $a$ and $b$, then we erase these numbers and write the number $a + b$ on both sheets. Prove that after $m2^{m -1}$ steps, the sum of the numbers on all the sheets is at least $4^m$ . [i]Proposed by Abbas Mehrabian, Iran[/i]