Three tokens $A$, $B$, $C$ are, each one in a vertex of an equilateral triangle of side $n$. Its divided on equilateral triangles of side 1, such as it is shown in the figure for the case $n=3$ Initially, all the lines of the figure are painted blue. The tokens are moving along the lines painting them of red, following the next two rules: [b](1) [/b]First $A$ moves, after that $B$ moves, and then $C$, by turns. On each turn, the token moves over exactly one line of one of the little triangles, form one side to the other. [b](2)[/b] Non token moves over a line that is already painted red, but it can rest on one endpoint of a side that is already red, even if there is another token there waiting its turn. Show that for every positive integer $n$ it is possible to paint red all the sides of the little triangles.

Natural numbers from $1$ to $99$ (not necessarily distinct) are written on $99$ cards. It is given that the sum of the numbers on any subset of cards (including the set of all cards) is not divisible by $100$. Show that all the cards contain the same number.

How many ways are there to place $31$ knights in the cells of an $8 \times 8$ unit grid so that no two attack one another? (A knight attacks another knight if the distance between the centers of their cells is exactly $\sqrt5$.)

Let $n\in N$ $n\geq2$ and the set $X$ with $n+1$ elements. The ordered sequences $(a_{1}, a_{2},\ldots,a_{n})$ and $(b_{1},b_{2},\ldots b_{n})$ of distinct elements of $X$ are said to be $\textit{separated}$ if there exists $i\neq j$ such that $a_{i}=b_{j}$. Determine the maximal number of ordered sequences of $n$ elements from $X$ such that any two of them are $\textit{separated}$. Note: ordered means that, for example $(1,2,3)\neq(2,3,1)$.

Prove that for all natural $n\ge 6 000$ any convex $1994$-gon can be cut into $n$ such quadrilaterals thata circle can be circumscribed around each of them

Pavel and Sara roll two, fair six-sided dice (with faces labeled from $ 1$ to $6$) but do not look at the result. A third-party observer whispers the product of the face-up numbers to Pavel and the sum of the face-up numbers to Sara. Pavel and Sara are perfectly rational and truth-telling, and they both know this. Pavel says, “With the information I have, I am unable to deduce the sum of the two numbers rolled.” Sara responds, “Interesting! With the information I have, I am unable to deduce the product of the two numbers rolled.” Pavel responds, “Wow! I still cannot deduce the sum. But I’m sure you know the product by now!” What is the product?

Each of the cells of a table 2014 x 2014 is colored in white or black. It is known that each square 2 x 2 contains an even number of black cells and each cross (3 x 3 square without its corner cells) contains an odd number of black cells. Prove that the 4 corner cells of the table are in the same color.

1-Let $A$ and $B$ be two diametrically opposite points on a circle with radius $1$. Points $P_1,P_2,...,P_n$ are arbitrarily chosen on the circle. Let a and b be the geometric means of the distances of $P_1,P_2,...,P_n$ from $A$ and $B$, respectively. Show that at least one of the numbers $a$ and $b$ does not exceed $\sqrt{2}$

For a set $ P$ of five points in the plane, no three of them being collinear, let $ s(P)$ be the numbers of acute triangles formed by vertices in $ P$. Find the maximum value of $ s(P)$ over all such sets $ P$.

We are given one red and $k>1$ blue cells, and a pack of $2n$ cards, enumerated by the numbers from $1$ to $2n$. Initially, the pack is situated on the red cell and arranged in an arbitrary order. In each move, we are allowed to take the top card from one of the cells and place it either onto the top of another cell on which the number on the top card is greater by $1$, or onto an empty cell. Given $k$, what is the maximal $n$ for which it is always possible to move all the cards onto a blue cell?

An $n \times m$ table ( $n \le m$ ) is filled in accordance with the rules of the game "Minesweeper": mines are placed at some cells (not more than one mine at the cell) and in the remaining cells one writes the number of the mines in the neighboring (by side or by vertex) cells. Then the sum of allnumbers in the table is computed (this sum is equal to $9$ for the picture). What is the largest possible value of this sum? (V. Lebed) [img]https://cdn.artofproblemsolving.com/attachments/2/9/726ccdbc57807788a5f6e88a5acb42b10a6cc0.png[/img]

We have $n$ points in the plane such that they are not all collinear. We call a line $\ell$ a 'good' line if we can divide those $n$ points in two sets $A,B$ such that the sum of the distances of all points in $A$ to $\ell$ is equal to the sum of the distances of all points in $B$ to $\ell$. Prove that there exist infinitely many points in the plane such that for each of them we have at least $n+1$ good lines passing through them.

In a school, more than $90\% $ of the students know both English and German, and more than $90\%$ percent of the students know both English and French. Prove that more than $90\%$ percent of the students who know both German and French also know English.

All the cells of a $10\times10$ board are colored white initially. Two players are playing a game with alternating moves. A move consists of coloring any un-colored cell black. A player is considered to loose, if after his move no white domino is left. Which of the players has a winning strategy? [I]Proposed by A. Khrabrov[/i]

There are 25 people. Every two of them are use some language to speak between. They use only one language even if they both know another one. Among every three of them there is one who speaking with two other on the same language. Prove that there exist one who speaking with 10 other on the same language.

Let $n\ge 2$ be a positive integer. Fill up a $n\times n$ table with the numbers $1,2,...,n^2$ exactly once each. Two cells are termed adjacent if they have a common edge. It is known that for any two adjacent cells, the numbers they contain differ by at most $n$. Show that there exist a $2\times 2$ square of adjacent cells such that the diagonally opposite pairs sum to the same number.

In an athletics tournament, five teams participate. Each athlete has a shirt numbered with a positive integer, and all athletes on the same team have different numbers. Each athlete participates in a single event and only one athlete from each team is present in each event. Emídio noticed that the sum of the athletes' jersey numbers in each event is always $20$. What is the maximum number of athletes in the tournament?

A rectangular array of positive integers has $4$ rows. The sum of the entries in each column is $20$. Within each row, all entries are distinct. What is the maximum possible number of columns?

Crocodile chooses $1$ x $4$ tile from $2018$ x $2018$ square.The bear has tilometer that checks $3$x$3$ square of $2018$ x $2018$ is there any of choosen cells by crocodile.Tilometer says "YES" if there is at least one choosen cell among checked $3$ x $3$ square.For what is the smallest number of such questions the Bear can certainly get an affirmative answer?

A grasshopper is jumping about in a grid. From the point with coordinates $(a, b)$ it can jump to either $(a + 1, b),(a + 2, b),(a + 1, b + 1),(a, b + 2)$ or $(a, b + 1)$. In how many ways can it reach the line $x + y = 2014?$ Where the grasshopper starts in $(0, 0)$.

A collection $F$ of distinct (not necessarily non-empty) subsets of $X = \{1,2,\ldots,300\}$ is [i]lovely[/i] if for any three (not necessarily distinct) sets $A$, $B$ and $C$ in $F$ at most three out of the following eight sets are non-empty \begin{align*}A \cap B \cap C, \ \ \ \overline{A} \cap B \cap C, \ \ \ A \cap \overline{B} \cap C, \ \ \ A \cap B \cap \overline{C}, \\ \overline{A} \cap \overline{B} \cap C, \ \ \ \overline{A} \cap B \cap \overline {C}, \ \ \ A \cap \overline{B} \cap \overline{C}, \ \ \ \overline{A} \cap \overline{B} \cap \overline{C} \end{align*} where $\overline{S}$ denotes the set of all elements of $X$ which are not in $S$. What is the greatest possible number of sets in a lovely collection?

Let $A_1,A_2,\ldots,A_n$ be subsets of a finite set $S$ such that $|A_j|=8$ for each $j$. For a subset $B$ of $S$ let $F(B)=\{j \mid 1\le j\le n \ \ \text{and} \ A_j \subset B\}$. Suppose for each subset $B$ of $S$ at least one of the following conditions holds [list][b](a)[/b] $|B| > 25$, [b](b)[/b] $F(B)={\O}$, [b](c)[/b] $\bigcap_{j\in F(B)} A_j \neq {\O}$.[/list] Prove that $A_1\cap A_2 \cap \cdots \cap A_n \neq {\O}$.

Let $ S$ be the set of natural numbers $ n$ satisfying the following conditions: $ (i)$ $ n$ has $ 1000$ digits, $ (ii)$ all the digits of $ n$ are odd, and $ (iii)$ any two adjacent digits of $ n$ differ by $ 2$. Determine the number of elements of $ S$.

The kingdom of Anisotropy consists of $n$ cities. For every two cities there exists exactly one direct one-way road between them. We say that a [i]path from $X$ to $Y$[/i] is a sequence of roads such that one can move from $X$ to $Y$ along this sequence without returning to an already visited city. A collection of paths is called [i]diverse[/i] if no road belongs to two or more paths in the collection. Let $A$ and $B$ be two distinct cities in Anisotropy. Let $N_{AB}$ denote the maximal number of paths in a diverse collection of paths from $A$ to $B$. Similarly, let $N_{BA}$ denote the maximal number of paths in a diverse collection of paths from $B$ to $A$. Prove that the equality $N_{AB} = N_{BA}$ holds if and only if the number of roads going out from $A$ is the same as the number of roads going out from $B$. [i]Proposed by Warut Suksompong, Thailand[/i]

Suppose we have a pack of $2n$ cards, in the order $1, 2, . . . , 2n$. A perfect shuffle of these cards changes the order to $n+1, 1, n+2, 2, . . ., n- 1, 2n, n$ ; i.e., the cards originally in the first $n$ positions have been moved to the places $2, 4, . . . , 2n$, while the remaining $n$ cards, in their original order, fill the odd positions $1, 3, . . . , 2n - 1.$ Suppose we start with the cards in the above order $1, 2, . . . , 2n$ and then successively apply perfect shuffles. What conditions on the number $n$ are necessary for the cards eventually to return to their original order? Justify your answer. [hide="Remark"] Remark. This problem is trivial. Alternatively, it may be required to find the least number of shuffles after which the cards will return to the original order.[/hide]