To each element of the set $S = \{1,2,... ,1000\}$ a colour is assigned. Suppose that for any two elements $a, b$ of $S$, if $15$ divides $a + b$ then they are both assigned the same colour. What is the maximum possible number of distinct colours used?

Each day $289$ students are divided into $17$ groups of $17$. No two students are ever in the same group more than once. What is the largest number of days that this can be done?

Given the number $188188...188$ (number $188$ is written $101$ times). Some digits of this number are crossed out. What is the largest multiple of $7$, that could happen?

Let $a,b, c$ denote the real numbers such that $1 \le a, b, c\le 2$. Consider $T = (a - b)^{2018} + (b - c)^{2018} + (c - a)^{2018}$. Determine the largest possible value of $T$.

Given a point $E$ on the diameter $AC$ of the certain circle. Draw a chord $BD$ to maximise the area of the quadrangle $ABCD$.

What is the greatest number of rays in space beginning at one point and forming pairwise obtuse angles?

A convex hexagon is circumscribed about a circle of radius $1$. Consider the three segments joining the midpoints of its opposite sides. Find the greatest real number $r$ such that the length of at least one segment is at least $r.$

Let $a(x)$ and $b(x)$ be continuous functions on $[0,1]$ and let $0 \leq a(x) \leq a <1$ on that range. Under what other conditions (if any) is the solution of the equation for $u,$ $$ u= \max_{0 \leq x \leq 1} b(x) +a(x)u$$ given by $$u = \max_{0 \leq x \leq 1} \frac{b(x)}{1-a(x)}.$$

Let $a,b,c$ be positive real numbers so that $a+b+c = \frac{1}{\sqrt{3}}$. Find the maximum value of $$27abc+a\sqrt{a^2+2bc}+b\sqrt{b^2+2ca}+c\sqrt{c^2+2ab}.$$

All the fields of a square $n\times n$ (n>2) table are filled with $+1$ or $-1$ according to the rules: [i]At the beginning $-1$ are put in all the boundary fields. The number put in the field in turn (the field is chosen arbitrarily) equals to the product of the closest, from the different sides, numbers in its row or in its column. [/i] a) What is the minimal b) What is the maximal possible number of $+1$ in the obtained table?

Let $a, b, c$ be positive integers such that $a + 2b +3c = 100$. Find the greatest value of $M = abc$

The five sides of a regular pentagon are extended to lines $\ell_1, \ell_2, \ell_3, \ell_4$, and $\ell_5$. Denote by $d_i$ the distance from a point $P$ to $\ell_i$. For which point(s) in the interior of the pentagon is the product $d_1d_2d_3d_4d_5$ maximal?

In a $3 \times 25$ board, $1 \times 3$ pieces are placed (vertically or horizontally) so that they occupy entirely $3$ boxes on the board and do not have a common point. What is the maximum number of pieces that can be placed, and for that number, how many configurations are there? [hide=original formulation] Num tabuleiro 3 × 25 s˜ao colocadas pe¸cas 1 × 3 (na vertical ou na horizontal) de modo que ocupem inteiramente 3 casas do tabuleiro e n˜ao se toquem em nenhum ponto. Qual ´e o n´umero m´aximo de pe¸cas que podem ser colocadas, e para esse n´umero, quantas configura¸c˜oes existem? [url=https://www.obm.org.br/content/uploads/2018/09/Provas_OMCPLP_2018.pdf]source[/url][/hide]

Consider the set of all rectangles with a given area $S$. Find the largest value o $ M = \frac{16-p}{p^2+2p}$ where $p$ is the perimeter of the rectangle.

Given regular pentagon $ABCDE$. $M$ is an arbitrary point inside $ABCDE$ or on its side. Let the distances $|MA|, |MB|, ... , |ME|$ be renumerated and denoted with $$r_1\le r_2\le r_3\le r_4\le r_5.$$ Find all the positions of the $M$, giving $r_3$ the minimal possible value. Find all the positions of the $M$, giving $r_3$ the maximal possible value.

Given the following matrix $$\begin{pmatrix} 11& 17 & 25& 19& 16\\ 24 &10 &13 & 15&3\\ 12 &5 &14& 2&18\\ 23 &4 &1 &8 &22 \\ 6&20&7 &21&9 \end{pmatrix},$$ choose five of these elements, no two from the same row or column, in such a way that the minimum of these elements is as large as possible.

Suppose $a, b$ are integers and $a+b$ is a root of $x^2 +ax+b = 0$. What is the maximum possible value of $b^2$?

Delete $100$ digits from the number $1234567891011... 9899100$ so that the remaining number were as big as possible.

Let $x_1=a, x_2=a^{x_1}, ..., x_n=a^{x_{n-1}}$ where $a>1$. What is the maximum value of $a$ for which lim exists $\lim_{n\to \infty} x_n$ and what is this limit?

Consider a board consisting of $n\times n$ unit squares where $n \ge 2$. Two cells are called neighbors if they share a horizontal or vertical border. In the beginning, all cells together contain $k$ tokens. Each cell may contain one or several tokens or none. In each turn, choose one of the cells that contains at least one token for each of its neighbors and move one of those to each of its neighbors. The game ends if no such cell exists. (a) Find the minimal $k$ such that the game does not end for any starting configuration and choice of cells during the game. (b) Find the maximal $k$ such that the game ends for any starting configuration and choice of cells during the game. Proposed by Theresia Eisenkölbl

Let $X$ be the set of natural numbers whose all digits in the decimal representation are different. For $n \in N$, denote by $A_n$ the set of numbers whose digits are a permutation of the digits of $n$, and $d_n$ be the greatest common divisor of the numbers in $A_n$. (For example, $A_{1120} =\{112,121,...,2101,2110\}$, so $d_{1120} = 1$.) Find the maximum possible value of $d_n$.

Given three points $A, B$ and $C$ (not collinear) construct the equilateral triangle of greater perimeter such that each of its sides passes through one of the given points.

A $6 \times 6$ board is given such that each unit square is either red or green. It is known that there are no $4$ adjacent unit squares of the same color in a horizontal, vertical, or diagonal line. A $2 \times 2$ subsquare of the board is [i]chesslike[/i] if it has one red and one green diagonal. Find the maximal possible number of chesslike squares on the board. [i]Proposed by Nikola Velov[/i]

Hugo places a chess piece on the top left square of a $20 \times 20$ chessboard and makes $10$ moves with it. On each of these $10$ moves, he moves the piece either one square horizontally (left or right) or one square vertically (up or down). After the last move, he draws an $X$ on the square that the piece occupies. When Hugo plays the game over and over again, what is the largest possible number of squares that could eventually be marked with an $X$? Prove that your answer is correct.

Let $ABC$ be an equilateral triangle of side $1$, $D$ be a point on $BC$, and $r_1, r_2$ be the inradii of triangles $ABD$ and $ADC$. Express $r_1r_2$ in terms of $p = BD$ and find the maximum of $r_1r_2$.