$\bullet$ Determine a natural $n$ such that the constant sum $S$ of a magic square of $ n \times n$ (that is, the sum of its elements in any column, or the diagonal) differs as little as possible from $1992$. $\bullet$ Construct or describe the construction of this magic square.

$64$ distinct points are positioned in the plane so that they determine exactly $2003$ different lines. Prove that among the $64$ points there are at least $4$ collinear points.

$n \geq 4$ players participated in a tennis tournament. Any two players have played exactly one game, and there was no tie game. We call a company of four players $bad$ if one player was defeated by the other three players, and each of these three players won a game and lost another game among themselves. Suppose that there is no bad company in this tournament. Let $w_i$ and $l_i$ be respectively the number of wins and losses of the $i$-th player. Prove that \[\sum^n_{i=1} \left(w_i - l_i\right)^3 \geq 0.\] [i]Proposed by Sung Yun Kim, South Korea[/i]

( "Sisyphian Labour" ) There are $1001$ steps going up a hill , with rocks on some of them {no more than 1 rock on each step ) . Sisyphus may pick up any rock and raise it one or more steps up to the nearest empty step . Then his opponent Aid rolls a rock (with an empty step directly below it) down one step . There are $500$ rocks, originally located on the first $500$ steps. Sisyphus and Aid move rocks in turn , Sisyphus making the first move . His goal is to place a rock on the top step. Can Aid stop him? ( S . Yeliseyev)

For even positive integer $n$ we put all numbers $1,2,...,n^2$ into the squares of an $n\times n$ chessboard (each number appears once and only once). Let $S_1$ be the sum of the numbers put in the black squares and $S_2$ be the sum of the numbers put in the white squares. Find all $n$ such that we can achieve $\frac{S_1}{S_2}=\frac{39}{64}.$

The numbers from $1$ to $2000$ are placed on the vertices of a regular polygon with $2000$ sides, one on each vertex, so that the following is true: If four integers $A, B, C, D$ satisfy that $1 \leq A<B<C<D \leq 2000$, then the segment that joins the vertices of the numbers $A$ and $B$ and the segment that joins the vertices of $C$ and $D$ do not intersect inside the polygon. Prove that there exists a perfect square such that the number diametrically opposite to it is not a perfect square.

In the plane are given $1997$ points. Show that among the pairwise distances between these points, there are at least $32$ different values.

We are given $n$ circles which have the same center. Two lines $D_1,D_2$ are concurent in $P$, a point inside all circles. The rays determined by $P$ on the line $D_i$ meet the circles in points $A_1,A_2,...,A_n$ and $A'_1, A'_2,..., A'_n$ respectively and the rays on $D_2$ meet the circles at points $B_1,B_2, ... ,B_n$ and $B'_2, B'_2 ..., B'_n$ (points with the same indices lie on the same circle). Prove that if the arcs $A_1B_1$ and $A_2B_2$ are equal then the arcs $A_iB_i$ and $A'_iB'_i$ are equal, for all $i = 1,2,... n$.

For each natural $n \ge 4$, find the smallest natural number $k$ that satisfies following condition: For an arbitrary arrangement of $k$ chips of two colors on $n\times n$ board, there exists a non-empty set such that all columns and rows contain even number ($0$ is also possible) of chips each color.

Five students $ A, B, C, D, E$ took part in a contest. One prediction was that the contestants would finish in the order $ ABCDE$. This prediction was very poor. In fact, no contestant finished in the position predicted, and no two contestants predicted to finish consecutively actually did so. A second prediction had the contestants finishing in the order $ DAECB$. This prediction was better. Exactly two of the contestants finished in the places predicted, and two disjoint pairs of students predicted to finish consecutively actually did so. Determine the order in which the contestants finished.

In a table $4\times 4$ we put $k$ blocks such that i) Each block covers exactly 2 cells ii) Each cell is covered by, at least, one block iii) If we delete a block; there is, at least, one cell that is not covered. Find the maximum value of $k$. Note: The blocks can overlap.

In the plane, $10^6$ points are marked, no three of which are collinear. All possible segments between them are drawn. Grisha assigned to each drawn segment a real number with absolute value no greater than $1$. For every group of $6$ marked points, he calculated the sum of the numbers on all $15$ connecting segments. It turned out that the absolute value of each such sum is at least \(C\), and there are both positive and negative such sums. What is the maximum possible value of \(C\)?

Let $n\geqslant 3$ be an integer. Ion draws a regular $n$-gon and all its diagonals. On every diagonal and edge, Ion writes a positive integer, such that for any triangle formed with the vertices of the $n$-gon, one of the numbers on its edges is the sum of the two other numbers on its edges. Determine the smallest possible number of distinct values that Ion can write.

Let $A_1, A_2, ... , A_k$ be the subsets of $\left\{1,2,3,...,n\right\}$ such that for all $1\leq i,j\leq k$:$A_i\cap A_j \neq \varnothing$. Prove that there are $n$ distinct positive integers $x_1,x_2,...,x_n$ such that for each $1\leq j\leq k$: $$lcm_{i \in A_j}\left\{x_i\right\}>lcm_{i \notin A_j}\left\{x_i\right\}$$ [i]Proposed by Morteza Saghafian, Mahyar Sefidgaran[/i]

Every point with integer coordinates in the plane is the center of a disk with radius $1/1000$. (1) Prove that there exists an equilateral triangle whose vertices lie in different discs. (2) Prove that every equilateral triangle with vertices in different discs has side-length greater than $96$. [i]Radu Gologan, Romania[/i] [hide="Remark"] The "> 96" in [b](b)[/b] can be strengthened to "> 124". By the way, part [b](a)[/b] of this problem is the place where I used [url=http://mathlinks.ro/viewtopic.php?t=5537]the well-known "Dedekind" theorem[/url]. [/hide]

A [i]Benelux n-square[/i] (with $n\geq 2$) is an $n\times n$ grid consisting of $n^2$ cells, each of them containing a positive integer, satisfying the following conditions: $\bullet$ the $n^2$ positive integers are pairwise distinct. $\bullet$ if for each row and each column we compute the greatest common divisor of the $n$ numbers in that row/column, then we obtain $2n$ different outcomes. (a) Prove that, in each Benelux n-square (with $n \geq 2$), there exists a cell containing a number which is at least $2n^2.$ (b) Call a Benelux n-square [i]minimal[/i] if all $n^2$ numbers in the cells are at most $2n^2.$ Determine all $n\geq 2$ for which there exists a minimal Benelux n-square.

In the plane, there is a figure in the form of an $L$-tromino, which is composed of $3$ unit squares, which we will denote by $\Phi_0$. On every move, we choose an arbitrary straight line in the plane and using it we construct a new figure. The $\Phi_n$, obtained in the $n$-th move, is obtained as the union of the figure $\Phi_{n-1}$ and its axial reflection with respect to the chosen line. Also, for the move to be valid, it is necessary that the surface of the newly obtained piece to be twice as large as the previous one. Is it possible to cover the whole plane in that process?

Suppose that $ a_1$, $ a_2$, $ \ldots$, $ a_n$ are integers such that $ n\mid a_1 \plus{} a_2 \plus{} \ldots \plus{} a_n$. Prove that there exist two permutations $ \left(b_1,b_2,\ldots,b_n\right)$ and $ \left(c_1,c_2,\ldots,c_n\right)$ of $ \left(1,2,\ldots,n\right)$ such that for each integer $ i$ with $ 1\leq i\leq n$, we have \[ n\mid a_i \minus{} b_i \minus{} c_i \] [i]Proposed by Ricky Liu & Zuming Feng, USA[/i]

Determine the smallest constant $N$ so that the following may hold true: Geostan has deployed secret agents in Combostan. All pairs of agents can communicate, either directly or through other agents. The distance between two agents is the smallest number of agents in a communication chain between the two agents. Andreas and Edvard are among these agents, and Combostan has given Noah the task of determining the distance between Andreas and Edvard. Noah has a list of numbers, one for each agent. The number of an agent describes the longest of the two distances from the agent to Andreas and Edvard. However, Noah does not know which number corresponds to which agent, or which agents have direct contact. Given this information, he can write down $N$ numbers and prove that the distance between Andreas and Edvard is one of these $N$ numbers. The number $N$ is independent of the agents’ communication network.

For which natural number $n$ is it possible to draw $n$ line segments between vertices of a regular $2n$-gon so that every vertex is an endpoint for exactly one segment and these segments have pairwise different lengths?

In every cell of a table with $n$ rows and ten columns, a digit is written. It is known that for every row $A$ and any two columns, you can always find a row that has different digits from $A$ only when it intersects with two columns. Prove that $n\geq512$.

A set of $n$ standard dice are shaken and randomly placed in a straight line. If $n < 2r$ and $r < s$, then the probability that there will be a string of at least $r$, but not more than $s$, consecutive $1$'s can be written as $\frac{P}{6^{s+2}}$. Find an explicit expression for $P$.

On each of the $2014^2$ squares of a $2014 \times 2014$-board a light bulb is put. Light bulbs can be either on or off. In the starting situation a number of the light bulbs is on. A move consists of choosing a row or column in which at least $1007$ light bulbs are on and changing the state of all $2014$ light bulbs in this row or column (from on to off or from off to on). Find the smallest non-negative integer $k$ such that from each starting situation there is a finite sequence of moves to a situation in which at most $k$ light bulbs are on.

Find the smallest nonnegative integer $n$ such that in every set of $n$ numbers there are always two distinct numbers such that their sum or difference is divisible by $2022$.

Integers $n$ and $k$ satisfy $n > 2023k^3$. Kingdom Kitty has $n$ cities, with at most one road between each pair of cities. It is known that the total number of roads in the kingdom is at least $2n^{3/2}$. Prove that we can choose $3k + 1$ cities such that the total number of roads with both ends being a chosen city is at least $4k$.