Given right $n$-gon wit the point $O$ -- its centre. All the vertices are marked either with $+1$ or $-1$. We may change all the signs in the vertices of regular $k$-gon ($2 \le k \le n$) with the same centre $O$. (By $2$-gon we understand a segment, being halved by $O$.) Prove that in a), b) and c) cases there exists such a set of $(+1)$s and $(-1)$s, that we can never obtain a set of $(+1)$s only. a) $n = 15$, b) $n = 30$, c) $n > 2$, d) Let us denote $K(n)$ the maximal number of $(+1)$ and $(-1)$ sets such, that it is impossible to obtain one set from another. Prove, for example, that $K(200) = 2^{80}$

Let $X$ be a set of $100$ elements. Find the smallest possible $n$ satisfying the following condition: Given a sequence of $n$ subsets of $X$, $A_1,A_2,\ldots,A_n$, there exists $1 \leq i < j < k \leq n$ such that $$A_i \subseteq A_j \subseteq A_k \text{ or } A_i \supseteq A_j \supseteq A_k.$$

The numbers $1, 2,..., 2020$ are written on the blackboard. Venus and Serena play the following game. First, Venus connects by a line segment two numbers such that one of them divides the other. Then Serena connects by a line segment two numbers which has not been connected and such that one of them divides the other. Then Venus again and they continue until there is a triangle with one vertex in $2020$, i.e. $2020$ is connected to two numbers that are connected with each other. The girl that has drawn the last line segment (completed the triangle) is the winner. Which of the girls has a winning strategy? (Tomáš Bárta, Czech Republic)

Seven equally-spaced points are drawn on a circle of radius $1$. Three distinct points are chosen uniformly at random. What is the probability that the center of the circle lies in the triangle formed by the three points?

Alice and Bob are play a game in a $(2n)*(2n)$ chess boared.Alice starts from the top right point moving 1 unit in every turn.Bob starts from the down left square and does the same.The goal of Alice is to make a closed shape ending in its start position and cannot reach any point that was reached before by any of players .if a players cannot move the other player keeps moving.what is the maximum are of the shape that the first player can build with every strategy of second player.

In a simple graph, there are two disjoint set of vertices $A$ and $B$ where $A$ has $k$ and $B$ has $2016$ vertices. Four numbers are written to each vertex using the colors red, green, blue and black. There is no any edge at the beginning. For each vertex in $A$, we first choose a color and then draw all edges from this vertex to the vertices in $B$ having a larger number with the chosen color. It is known that for each vertex in $B$, the set of vertices in $A$ connected to this vertex are different. Find the minimal possible value of $k$.

Given an odd integer $n \geq 3$. Let $V$ be the set of vertices of a regular $n$-gon, and $P$ be the set of all regular polygons formed by points in $V$. For instance, when $n=15$, $P$ consists of $1$ regular $15$-gon, $3$ regular pentagons, and $5$ regular triangles. Initially, all points in $V$ are uncolored. Two players, $A$ and $B$, play a game where they take turns coloring an uncolored point, with player $A$ starting and coloring points red, and player $B$ coloring points blue. The game ends when all points are colored. A regular polygon in $P$ is called $\textit{good}$ if it has more red points than blue points. Find the largest positive integer $k$ such that no matter how player $B$ plays, player $A$ can ensure that there are at least $k$ $\textit{good}$ polygons.

Is it possible to fill the cells of a table of size $2019\times2019$ with pairwise distinct positive integers in such a way that in each rectangle of size $1\times2$ or $2\times1$ the larger number is divisible by the smaller one, and the ratio of the largest number in the table to the smallest one is at most $2019^4?$

Consider a complete graph of $2020$ vertices. What is the least number of edges that need to be marked such that each triangle ($3$-vertex subgraph) has an odd number of marked edges?

A group of 6 math students is staying at a mathematical hotel to participate in a math tournament that will take place in the city in the coming days. This group, composed of 3 women and 3 men, was assigned rooms in a specific way by the hotel administration: in separate rooms and alternating between genders, specifically: woman, man, woman, man, woman, man, occupying the last 6 rooms in a corridor numbered from 101 to 110. \begin{tabular}{|c|c|c|c|c|c|c|c|c|c|} \hline M & H & M & H & M & H & & & & \\ \hline 110 & 109 & 108 & 107 & 106 & 105 & 104 & 103 & 102 & 101 \\ \hline \end{tabular} Against the hotel's rules, the group devised the following game: A valid room exchange occurs when two students in consecutive rooms move to two empty rooms, such that the difference between their new room numbers and their original ones is the same. For example, if the students in rooms 105 and 106 move to rooms 101 and 102, this would be a valid exchange since both numbers decreased by 4 units. Determine if, following these rules, the students can manage to have rooms 101, 102, and 103 occupied by men and rooms 104, 105, and 106 occupied by women in just 3 valid exchanges.

If there are several heaps of stones on the table, it is said that there are $\textit{many}$ stones on the table, if we can find $50$ piles and number them with the numbers from $1$ to $50$ so that the first pile contains at least one stone, the second - at least two stones,..., the $50$-th has at least $50$ stones. Let the table be initially contain $100$ piles of $100$ stones each. Find the largest $n \leq 10 000$ such that after removing any $n$ stones, there will still be $\textit{many}$ stones left on the table.

In every cell of a table with $n$ rows and $m$ columns is written one of the letters $a$, $b$, $c$. Every two rows of the table have the same letter in at most $k\geq 0$ positions and every two columns coincide at most $k$ positions. Find $m$, $n$, $k$ if \[\frac{2mn+6k}{3(m+n)}\geq k+1\]

A game is played by two contestants A and B, each one having ten chips numbered from 1 to 10. The board of game consists of two numbered rows, from 1 to 1492 on the first row and from 1 to 1989 on the second. At the $n$-th turn, $n=1,2,\ldots,10$, A puts his chip numbered $n$ in any empty cell, and B puts his chip numbered $n$ in any empty cell on the row not containing the chip numbered $n$ from A. B wins the game if, after the 10th turn, both rows show the numbers of the chips in the same relative order. Otherwise, A wins. [list=a] [*] Which player has a winning strategy? [*] Suppose now both players has $k$ chips numbered 1 to $k$. Which player has a winning strategy? [*] Suppose further the rows are the set $\mathbb{Q}$ of rationals and the set $\mathbb{Z}$ of integers. Which player has a winning strategy? [/list]

Ten test papers are to be prepared for the National Olympiad. Each paper has 4 problems, and no two papers have more than 1 problem in common. At least how many problems are needed?

We are given $n$ coins of different weights and $n$ balances, $n>2$. On each turn one can choose one balance, put one coin on the right pan and one on the left pan, and then delete these coins out of the balance. It's known that one balance is wrong (but it's not known ehich exactly), and it shows an arbitrary result on every turn. What is the smallest number of turns required to find the heaviest coin? [hide=Thanks]Thanks to the user Vlados021 for translating the problem.[/hide]

Let $ a_1, a_2,\ldots ,a_8$ be $8$ distinct points on the circumference of a circle such that no three chords, each joining a pair of the points, are concurrent. Every $4$ of the $8$ points form a quadrilateral which is called a [i]quad[/i]. If two chords, each joining a pair of the $8$ points, intersect, the point of intersection is called a [i]bullet[/i]. Suppose some of the bullets are coloured red. For each pair $(i j)$, with $ 1 \le i < j \le 8$, let $r(i,j)$ be the number of quads, each containing $ a_i, a_j$ as vertices, whose diagonals intersect at a red bullet. Determine the smallest positive integer $n$ such that it is possible to colour $n$ of the bullets red so that $r(i,j)$ is a constant for all pairs $(i,j)$.

Let $n \geq 5$ be a positive integer and let $A$ and $B$ be sets of integers satisfying the following conditions: i) $|A| = n$, $|B| = m$ and $A$ is a subset of $B$ ii) For any distinct $x,y \in B$, $x+y \in B$ iff $x,y \in A$ Determine the minimum value of $m$.

All faces of a polyhedron are triangles. Each of the vertices of this polyhedron is assigned independently one of three colors : green, white or black. We say that a face is [i]Extremadura[/i] if its three vertices are of different colors, one green, one white and one black. Is it true that regardless of how the vertices's color, the number of [i]Extremadura[/i] faces of this polyhedron is always even?

Five teams participated in the commercial football tournament. Each had to play exactly one match with each other. Due to financial difficulties, the organizers canceled some games. In the end It turned out that all teams scored a different number of points and not a single team in the points column had a zero. What is the smallest number of games could be played in a tournament if three points were awarded for a win, for a draw - one, for a defeat - zero?

Given a positive integer $n$, show that for no set of integers modulo $n$, whose size exceeds $1+\sqrt{n+4}$, is it possible that the pairwise sums of unordered pairs be all distinct.

The function $f : (0,...2005) \rightarrow N$ has the properties that $f(2x+1)=f(2x)$, $f(3x+1)=f(3x)$ and $f(5x+1)=f(5x)$ with $x \in (0,1,2,...,2005)$. How many different values can the function assume?

Numbers $1, 2, 3, . . . , 100$ are arranged in a circle in some order. A [i]good pair[/i] is a pair of numbers of the same parity, between which there are exactly $3$ numbers. What is the smallest possible number good pairs?

You are given a word consisting of letters $a;b;c$ You can apply 3 operations on this word: [b]1)[/b] You can write any $3$ letter long $\text{subword}$ in reverse. ($\text{xyz}\rightarrow \text{zyx}$) [b]2)[/b] You can add same $2$ letters between any $2$ consecutive letters. ($\text{xyxy}\rightarrow \text{xy}$[b]zz[/b]$\text{xy}$) [b]3)[/b] You can remove any $\text{subword}$ in the given form $\text{xyyx}$ ($\text{x}$[b]yzzy[/b]$\text{xy}\rightarrow\text{xxy}$) Given these $3$ operations, can you go from $\text{abccab}$ to $\text{baccba}$? (Note: A $\text{subword}$ is a string of consecutive letters from the given word)

Let $n$ points be given inside a rectangle $R$ such that no two of them lie on a line parallel to one of the sides of $R$. The rectangle $R$ is to be dissected into smaller rectangles with sides parallel to the sides of $R$ in such a way that none of these rectangles contains any of the given points in its interior. Prove that we have to dissect $R$ into at least $n + 1$ smaller rectangles. [i]Proposed by Serbia[/i]

Let $n\ge 2$ be an integer. Elwyn is given an $n\times n$ table filled with real numbers (each cell of the table contains exactly one number). We define a [i]rook set[/i] as a set of $n$ cells of the table situated in $n$ distinct rows as well as in n distinct columns. Assume that, for every rook set, the sum of $n$ numbers in the cells forming the set is nonnegative.\\ \\ By a move, Elwyn chooses a row, a column, and a real number $a,$ and then he adds $a$ to each number in the chosen row, and subtracts $a$ from each number in the chosen column (thus, the number at the intersection of the chosen row and column does not change). Prove that Elwyn can perform a sequence of moves so that all numbers in the table become nonnegative.