The sides and diagonals of a regular $n$-gon $R$ are colored in $k$ colors so that: (i) For each color $a$ and any two vertices $A$,$B$ of $R$ , the segment $AB$ is of color $a$ or there is a vertex $C$ such that $AC$ and $BC$ are of color $a$. (ii) The sides of any triangle with vertices at vertices of $R$ are colored in at most two colors. Prove that $k\leq 2$.

Let $ABC$ be an acute triangle with circumcircle $\Omega$. Let $B_0$ be the midpoint of $AC$ and let $C_0$ be the midpoint of $AB$. Let $D$ be the foot of the altitude from $A$ and let $G$ be the centroid of the triangle $ABC$. Let $\omega$ be a circle through $B_0$ and $C_0$ that is tangent to the circle $\Omega$ at a point $X\not= A$. Prove that the points $D,G$ and $X$ are collinear. [i]Proposed by Ismail Isaev and Mikhail Isaev, Russia[/i]

Azambuja writes a rational number $q$ on a blackboard. One operation is to delete $q$ and replace it by $q+1$; or by $q-1$; or by $\frac{q-1}{2q-1}$ if $q \neq \frac{1}{2}$. The final goal of Azambuja is to write the number $\frac{1}{2018}$ after performing a finite number of operations. [b]a)[/b] Show that if the initial number written is $0$, then Azambuja cannot reach his goal. [b]b)[/b] Find all initial numbers for which Azambuja can achieve his goal.

Find the smallest number of the form $1...1$ in its decimal expression which is divisible by $\underbrace{\hbox{3...3}}_{\hbox{100}}$,.

Let $x_1, x_2, \ldots$ be a sequence of $0,1$, such that it satisfies the following three conditions: 1) $x_2=x_{100}=1$, $x_i=0$ for $1 \leq i \leq 100$ and $i \neq 2,100$; 2) $x_{2n-1}=x_{n-50}+1, x_{2n}=x_{n-50}$ for $51 \leq n \leq 100$; 3) $x_{2n}=x_{n-50}, x_{2n-1}=x_{n-50}+x_{n-100}$ for $n>100$. Show that the sequence is periodic.

Consider all ordered pairs $(m, n)$ of positive integers satisfying $59 m - 68 n = mn$. Find the sum of all the possible values of $n$ in these ordered pairs.

One day while the Kubik family attends one of Michael's baseball games, Tony gets bored and walks to the creek a few yards behind the baseball field. One of Tony's classmates Mitchell sees Tony and goes to join him. While playing around the creek, the two boys find an ordinary six-sided die buried in sediment. Mitchell washes it off in the water and challenges Tony to a contest. Each of the boys rolls the die exactly once. Mitchell's roll is $3$ higher than Tony's. "Let's play once more," says Tony. Let $a/b$ be the probability that the difference between the outcomes of the two dice is again exactly $3$ (regardless of which of the boys rolls higher), where $a$ and $b$ are relatively prime positive integers. Find $a+b$.

$2015$ points are given in a plane such that from any five points we can choose two points with distance less than $1$ unit. Prove that $504$ of the given points lie on a unit disc.

A rook is randomly placed on an otherwise empty $8 \times 8$ chessboard. Owen makes moves with the rook by randomly choosing $1$ of the $14$ possible moves. Find the expected value of the number of moves it takes Owen to move the rook to the top left square. Note that a rook can move any number of squares either in the horizontal or vertical direction each move.

Let $n\ge 3$ be a positive integer. Find the largest real number $t_n$ as a function of $n$ such that the inequality \[\max\left(|a_1+a_2|, |a_2+a_3|, \dots ,|a_{n-1}+a_{n}| , |a_n+a_1|\right) \ge t_n \cdot \max(|a_1|,|a_2|, \dots ,|a_n|)\] holds for all real numbers $a_1, a_2, \dots , a_n$ . [i]Proposed by Rohan Goyal and Rijul Saini[/i]

Determine all real-valued functions $f$ on the set of real numbers satisfying \[2f(x)=f(x+y)+f(x+2y)\] for all real numbers $x$ and all non-negative real numbers $y$.

Let $H, K, L$ be the feet from the altitudes from vertices $A, B, C$ of the triangle $ABC$, respectively. Prove that $| AK | \cdot | BL | \cdot| CH | = | HK | \cdot | KL | \cdot | LH | = | AL | \cdot | BH | \cdot | CK | $.

A $k \times k$ array contains each of the numbers $1, 2, \dots, m$ exactly once, with the remaining entries all zero. Suppose that all the row sums and column sums are equal. What is the smallest possible value of $m$ if $k = 3^n$ ($n \in \mathbb{N}^+$)? [i]Attila Sztranyák and Péter Erben[/i]

Twenty-five points are given on the plane. Among any three of them, one can choose two less than one inch apart. Prove that there are 13 points among them which lie in a circle of radius 1.

A unit square is cut by $n$ straight lines . Prove that in at least one of these parts one can completely fit a square with side $\frac{1}{n+1}$ [hide=original wording]Одиничний квадрат розрізано $n$ прямими на частини. Доведіть, що хоча б в одній з цих частин можна повністю розмістити квадрат зі стороною $\frac{1}{n+1}$[/hide] [hide=notes] The selection panel jury made a mistake because the solution known to it turned out to be incorrect. As it turned out, the assertion of the problem is still correct, although it cannot be proved by simple methods, see. article: Keith Ball. Тhe plank problem for symmetric bodies // Іпѵепііопез МаіЬешаІіеае. — 1991. — Ѵоі. 104, по. 1. — Р. 535-543. [url]https://arxiv.org/abs/math/9201218[/url][/hide]

Let $r>1$ be a rational number. Alice plays a solitaire game on a number line. Initially there is a red bead at $0$ and a blue bead at $1$. In a move, Alice chooses one of the beads and an integer $k \in \mathbb{Z}$. If the chosen bead is at $x$, and the other bead is at $y$, then the bead at $x$ is moved to the point $x'$ satisfying $x'-y=r^k(x-y)$. Find all $r$ for which Alice can move the red bead to $1$ in at most $2021$ moves.

The figure on the right shows the map of Squareville, where each city block is of the same length. Two friends, Alexandra and Brianna, live at the corners marked by $A$ and $B$, respectively. They start walking toward each other's house, leaving at the same time, walking with the same speed, and independently choosing a path to the other's house with uniform distribution out of all possible minimum-distance paths [that is, all minimum-distance paths are equally likely]. What is the probability they will meet? [asy] size(200); defaultpen(linewidth(0.8)); for(int i=0;i<=2;++i) { for(int j=0;j<=4;++j) { draw((i,j)--(i+1,j)--(i+1,j+1)--(i,j+1)--cycle); } } for(int i=3;i<=4;++i) { for(int j=3;j<=6;++j) { draw((i,j)--(i+1,j)--(i+1,j+1)--(i,j+1)--cycle); } } label("$A$",origin,SW); label("$B$",(5,7),SE); [/asy]

Determine all functions $f: \mathbb{Z}\to\mathbb{Z}$ satisfying \[f\big(f(m)+n\big)+f(m)=f(n)+f(3m)+2014\] for all integers $m$ and $n$. [i]Proposed by Netherlands[/i]

Find all pairs of nonnegative integers $(x, p)$, where $p$ is prime, that verify $$x(x+1)(x+2)(x+3)=1679^{p-1}+1680^{p-1}+1681^{p-1}.$$

In the figure below, choose point $D$ on $\overline{BC}$ so that $\triangle ACD$ and $\triangle ABD$ have equal perimeters. What is the area of $\triangle ABD$? [asy]draw((0,0)--(4,0)--(0,3)--(0,0)); label("$A$", (0,0), SW); label("$B$", (4,0), ESE); label("$C$", (0, 3), N); label("$3$", (0, 1.5), W); label("$4$", (2, 0), S); label("$5$", (2, 1.5), NE);[/asy] $\textbf{(A) }\frac{3}{4}\qquad\textbf{(B) }\frac{3}{2}\qquad\textbf{(C) }2\qquad\textbf{(D) }\frac{12}{5}\qquad\textbf{(E) }\frac{5}{2}$

Triangle $\vartriangle ABC$ has $m\angle C = 135^o$, and $D$ is the foot of the altitude from $C$ to $AB$. We are told that $CD = 2$ and that $AD$ and $BD$ are finite positive integers. What is the sum of all distinct possible values of $AB$?

Let $ m,n$ be integers such that $ 0\le m\le 2n$. Then prove that the number $ 2^{2n \plus{} 2} \plus{} 2^{m \plus{} 2} \plus{} 1$ is perfect square iff $ m \equal{} n$.

Solve in nonnegative integers the equation $5^t + 3^x4^y = z^2$.

Each of the subsets $ A_1$, $ A_2$, $ \dots,$ $ A_n$ of a 2009-element set $ X$ contains at least 4 elements. The intersection of every two of these subsets contains at most 2 elements. Prove that in $ X$ there is a 24-element subset $ B$ containing neither of the sets $ A_1$, $ A_2$, $ \dots,$ $ A_n$.

A cube has one of its vertices and all edges connected to that vertex deleted. How many ways can the letters from the word "$AMONGUS$" be placed on the remaining vertices of the cube so that one can walk along the edges to spell out "$AMONGUS$"? Note that each vertex will have at most $1$ letter, and one vertex is deleted and not included in the walk