Alice is playing a game with $2018$ boxes, numbered $1 - 2018$, and a number of balls. At the beginning, boxes $1 - 2017$ have one ball each, and box $2018$ has $2018n$ balls. Every turn, Alice chooses $i$ and $j$ with $i > j$, and moves exactly $i$ balls from box $i$ to box $j$. Alice wins if all balls end up in box $1$. What is the minimum value of n so that Alice can win this game?

Let $ a, b, c, d \in \mathbb {R}, $ $ b \neq0. $ Find the functions of the $ f: \mathbb{R} \to \mathbb{R} $ such that $ f (x + d \cdot f (y)) = ax + by + c, $ for all $ x, y \in \mathbb{R}. $

We are given sufficiently many stones of the forms of a rectangle $2\times 1$ and square $1\times 1$. Let $n > 3$ be a natural number. In how many ways can one tile a rectangle $3 \times n$ using these stones, so that no two $2 \times 1$ rectangles have a common point, and each of them has the longer side parallel to the shorter side of the big rectangle?

The audience arranges $n$ coins in a row. The sequence of heads and tails is chosen arbitrarily. The audience also chooses a number between $1$ and $n$ inclusive. Then the assistant turns one of the coins over, and the magician is brought in to examine the resulting sequence. By an agreement with the assistant beforehand, the magician tries to determine the number chosen by the audience. [list][b](a)[/b] Prove that if this is possible for some $n$, then it is also possible for $2n$. [b](b)[/b] Determine all $n$ for which this is possible.[/list]

A collection of $n > 2$ numbers is called [i]crowded [/i] if each of them is less than their sum divided by $n - 1$ . Let $\{a, b, c, ,...\}$ be a crowded collection of $n$ numbers whose sum equals $S$. Prove that: (a) each of the numbers is positive, (b) we always have $a + b > c$, (c) we always have $a + b \ge \frac{S}{n-1}$ . (Regina Schleifer)

We are given a $\Delta ABC$. Point $D$ on the circumscribed circle k is such that $CD$ is a symmedian in $\Delta ABC$. Let $X$ and $Y$ be on the rays $\overrightarrow{CB}$ and $\overrightarrow{CA}$, so that $CX=2CA$ and $CY=2CB$. Prove that the circle, tangent externally to $k$ and to the lines $CA$ and $CB$, is tangent to the circumscribed circle of $\Delta XDY$.

Let $a_{0}=\sqrt{2}, b_{0}=2,a_{n+1}=\sqrt{2-\sqrt{4-a_{n}^{2}}},b_{n+1}=\frac{2b_{n}}{2+\sqrt{4+b_{n}^{2}}}$. a) Prove that the sequences $(a_{n})$ and $(b_{n})$ are decreasing and converge to $0$. b) Prove that the sequence $(2^{n}a_{n})$ is increasing, the sequence $(2^{n}b_{n})$ is decreasing and both converge to the same limit. c) Prove that there exists a positive constant $C$ such that for all $n$ the following inequality holds: $0 <b_{n}-a_{n} <\frac{C}{8^{n}}$.

Consider a square ABCD. A point P was selected on its diagonal AC. Let H be the orthocenter of the triangle APD, let M be the midpoint of AD and N be the midpoint of CD. Prove that PN is orthogonal to MH.

Let $S$ be a set which is closed under the binary operation $\circ$, with the following properties: (i) there is an element $e \in S$ such that $a \circ e = e \circ a = a$, for each $a \in S$. (ii) $(a \circ b) \circ (c \circ d)=(a \circ c) \circ (b \circ d)$, for all $a,b, c,d \in S$. Prove or disprove: (a) $\circ$ is associative on S (b) $\circ$ is commutative on S

$BC$ is a segment, $M$ is point on $BC$, $A$ is a point such that $A, B, C$ are non-collinear. (i) Prove that if $M$ is the midpoint of $BC$, then $AB^2 + AC^2 = 2(AM^2 + BM^2).$ (ii) If there exists another point (except $M$) on segment $BC$ satisfying (i), find the region of point $A$ might occupy.

$99$ different points $P_1, P_2, ..., P_{99}$ are marked on circle $O$. For each $P_i$, define $n_i$ as the number of marked points you encounter starting from $P_i$ to its antipode, moving clockwise. Prove the following inequality. $$n_1+n_2+\cdots+n_{99} \leq \frac{99\cdot 98}{2}+49=4900$$

Let $r\geq1$ be areal number that holds with the property that for each pair of positive integer numbers $m$ and $n$, with $n$ a multiple of $m$, it is true that $\lfloor{nr}\rfloor$ is multiple of $\lfloor{mr}\rfloor$. Show that $r$ has to be an integer number. [b]Note: [/b][i]If $x$ is a real number, $\lfloor{x}\rfloor$ is the greatest integer lower than or equal to $x$}.[/i]

$X$ is a set of $2020$ distinct real numbers. Prove that there exist $a,b\in \mathbb{R}$ and $A\subset X$ such that $$\sum_{x\in A}(x-a)^2 +\sum_{x\in X\backslash A}(x-b)^2\le \frac{1009}{1010}\sum_{x\in X}x^2$$

Two sets of positive integers $A, B$ are called [i]connected [/i] if they are not empty and for all $a \in A, b \in B$, number $ab + 1$ is a perfect square. i) Given $A =\{1, 2,3, 4\}$. Prove that there does not exist any set $B$ such that $A, B$ are connected. ii) Suppose that $A, B$ are connected with $|A|,|B| \ge 2$. For any $a_1 > a_2 \in A$ and $b_1 > b_2 \in B$, prove that $a_1b_1 > 13a_2b_2$.

In a quadrilateral $ABCD$, a circle is inscribed that is tangent to the sides $AB, BC, CD$ and $DA$ at points $M, N, P$ and $Q$, respectively. If $(AM) (CP) = (BN) (DQ)$, prove that $ABCD$ is an cyclic quadrilateral.

Let $x\in\mathbb{R}$. What is the maximum value of the following expression: $\sqrt{x-2018} + \sqrt{2020-x}$ ?

Let $ a,b,$ and $ c$ denote three distinct integers, and let $ P$ denote a polynomial having integer coefficients. Show that it is impossible that $ P(a) \equal{} b, P(b) \equal{} c,$ and $ P(c) \equal{} a$.

Let $ABCDEF$ be a convex hexagon with area $S$ such that $AB \parallel DE$, $BC \parallel EF$, $CD \parallel FA$ holds, and whose all angles are obtuse and opposite sides are not the same length. Prove that the following inequality holds: $$A_{ABC} + A_{BCD} + A_{CDE} + A_{DEF} + A_{EFA} + A_{FAB} < S$$ , where $A_{XYZ}$ is the area of triangle $XYZ$

\[\int_{\pi/4}^{\pi/2} \tan^{-1}\left(\tan^2(x)\right)\sin(2x)\,\mathrm dx\] [i]Proposed by Vlad Oleksenko[/i]

Sheldon and Bella play a game on an infinite grid of cells. On each of his turns, Sheldon puts one of the following tetrominoes (reflections and rotations aren't permitted) [asy] size(200); draw((0, 0)--(1, 0)--(1, 2)--(0, 2)--cycle); draw((1, 1)--(2, 1)--(2, 3)--(1, 3)--cycle); draw((0,1)--(1,1)); draw((1,2)--(2,2)); draw((5, 0.5)--(6, 0.5)--(6, 1.5)--(5, 1.5)--cycle); draw((6, 0.5)--(7, 0.5)--(7, 1.5)--(6, 1.5)--cycle); draw((6, 1.5)--(7, 1.5)--(7, 2.5)--(6, 2.5)--cycle); draw((7, 1.5)--(8, 1.5)--(8, 2.5)--(7, 2.5)--cycle); [/asy] somewhere on the grid without overlap. Then, Bella colors that tetromino such that it has a different color from any other tetromino that shares a side with it. After $2631$ such moves by each player, the game ends, and Sheldon's score is the number of colors used by Bella. What's the maximum $N$ such that Sheldon can guarantee that his score will be at least $N$?

The plane is tiled by congruent squares and congruent pentagons as indicated. The percent of the plane that is enclosed by the pentagons is closest to $ \textbf{(A)} \ 50 \qquad \textbf{(B)} \ 52 \qquad \textbf{(C)} \ 54 \qquad \textbf{(D)} \ 56 \qquad \textbf{(E)} \ 58 \qquad$ [asy]unitsize(3mm); defaultpen(linewidth(0.8pt)); path p1=(0,0)--(3,0)--(3,3)--(0,3)--(0,0); path p2=(0,1)--(1,1)--(1,0); path p3=(2,0)--(2,1)--(3,1); path p4=(3,2)--(2,2)--(2,3); path p5=(1,3)--(1,2)--(0,2); path p6=(1,1)--(2,2); path p7=(2,1)--(1,2); path[] p=p1^^p2^^p3^^p4^^p5^^p6^^p7; for(int i=0; i<3; ++i) { for(int j=0; j<3; ++j) { draw(shift(3*i,3*j)*p); } }[/asy]

Let $ \{a_k\}$ be a sequence of integers such that $ a_1 \equal{} 1$ and $ a_{m \plus{} n} \equal{} a_m \plus{} a_n \plus{} mn$, for all positive integers $ m$ and $ n$. Then $ a_{12}$ is $ \textbf{(A)}\ 45 \qquad \textbf{(B)}\ 56 \qquad \textbf{(C)}\ 67 \qquad \textbf{(D)}\ 78 \qquad \textbf{(E)}\ 89$

Let $a_1=1,$ $a_2=2,$ $a_n=2a_{n-1}+a_{n-2},$ $n=3,4,\cdots.$ Prove that for any integer $n\geq5,$ $a_n$ has at least one prime factor $p,$ such that $p\equiv 1\pmod{4}.$

The cells of a table [b]m x n[/b], $m \geq 5$, $n \geq 5$ are colored in 3 colors where: (i) Each cell has an equal number of adjacent (by side) cells from the other two colors; (ii) Each of the cells in the 4 corners of the table doesn’t have an adjacent cell in the same color. Find all possible values for $m$ and $n$.

Determine all natural numbers $n$ such that $9^n - 7$ can be represented as a product of at least two consecutive natural numbers.