Signals used for communication are binary sequences of length $10$. Unfortunately, the receiving device got broken so that it cannot distinguish between two signals unless those differ in more than five places. What is the largest possible number of signals that can still be used to prevent ambiguities?

Inside a square with sides of length $1$ unit several non-overlapping smaller squares with sides parallel to the sides of the large square are placed (the small squares may differ in size). Draw a diagonal of the large square and consider all of the small squares intersecting it. Can the sum of their perimeters be greater than $1993$? (AN Vblmogorov)

Let $S$ be a set of $n\ge 3$ points in the interior of a circle. $a)$ Show that there are three distinct points $a,b,c\in S$ and three distinct points $A,B,C$ on the circle such that $a$ is (strictly) closer to $A$ than any other point in $S$, $b$ is closer to $B$ than any other point in $S$ and $c$ is closer to $C$ than any other point in $S$. $b)$ Show that for no value of $n$ can four such points in $S$ (and corresponding points on the circle) be guaranteed.

Find all integers $a$ such that there is a prime number of $p\ge 5$ that divides ${p-1 \choose 2}$ $+ {p-1 \choose 3} a$ $+{p-1 \choose 4} a^2$+ ...+$ {p-1 \choose p-3} a^{p-5} .$

On a $30\times 30$ board both rows $ 1$ to $30$ and columns are numbered, in addition, to each box is assigned the number $ij$, where the box is in row $i$ and column $j$. $N$ columns and $m$ rows are chosen, where $1 <n$ and $m <30$, and the cells that are simultaneously in any of the rows and in any of the selected columns are painted blue. They paint the others red . (a) Prove that the sum of the numbers in the blue boxes cannot be prime. (b) Can the sum of the numbers in the red cells be prime?

a) On a plane, $11$ gears are arranged so that the teeth of the first gear mesh with the teeth of the second gear, the teeth of the second gear with those of the third gear, etc., and the teeth of the last gear mesh with those of the first gear. Can the gears rotate? b) On a plane, $n$ gears are arranged so that the teeth of the first gear mesh with the teeth of the second gear, the teeth of the second gear with those of the third gear, etc., and the teeth of the last gear mesh with those of the first gear. Can the gears rotate?

A $5 \times 5$ table is called regular f each of its cells contains one of four pairwise distinct real numbers,such that each of them occurs exactly one in every $2 \times 2$ subtable.The sum of all numbers of a regular table is called the total sum of the table.With any four numbers,one constructs all possible regular tables,computes their total sums and counts the distinct outcomes.Determine the maximum possible count.

A graph $ G$ with $ n$ vertices is given. Some $ x$ of its edges are colored red so that each triangle has at most one red edge. The maximum number of vertices in $ G$ that induce a bipartite graph equals $ y.$ Prove that $ n\ge 4x/y.$

How many 5 digit positive integers are there such that each of its digits, except for the last one, is greater than or equal to the next digit?

Let $n\geq 3$ be a fixed integer. Each side and each diagonal of a regular $n$-gon is labelled with a number from the set $\left\{1;\;2;\;...;\;r\right\}$ in a way such that the following two conditions are fulfilled: [b]1.[/b] Each number from the set $\left\{1;\;2;\;...;\;r\right\}$ occurs at least once as a label. [b]2.[/b] In each triangle formed by three vertices of the $n$-gon, two of the sides are labelled with the same number, and this number is greater than the label of the third side. [b](a)[/b] Find the maximal $r$ for which such a labelling is possible. [b](b)[/b] [i]Harder version (IMO Shortlist 2005):[/i] For this maximal value of $r$, how many such labellings are there? [hide="Easier version (5th German TST 2006) - contains answer to the harder version"] [i]Easier version (5th German TST 2006):[/i] Show that, for this maximal value of $r$, there are exactly $\frac{n!\left(n-1\right)!}{2^{n-1}}$ possible labellings.[/hide] [i]Proposed by Federico Ardila, Colombia[/i]

Let $n \ge 2$ be a natural number. For an $n$-element subset $F$ of $\{1, . . . , 2n\}$ we define $m(F)$ as the minimum of all $lcm \,\, (x, y)$ , where $x$ and $y$ are two distinct elements of $F$. Find the maximum value of $m(F)$.

The squares of an $m\times n$ board are labeled from $1$ to $mn$ so that the squares labeled $i$ and $i+1$ always have a side in common. Show that for some $k$ the squares $k$ and $k+3$ have a side in common.

Prove that if $n$ is large enough, among any $n$ points of plane we can find $1000$ points such that these $1000$ points have pairwise distinct distances. Can you prove the assertion for $n^{\alpha}$ where $\alpha$ is a positive real number instead of $1000$?

Let $S$ be a nonempty set of positive integers. We say that a positive integer $n$ is [i]clean[/i] if it has a unique representation as a sum of an odd number of distinct elements from $S$. Prove that there exist infinitely many positive integers that are not clean.

Each of the squares on a $15$×$15$ board has a zero. At every step you choose a row or a column, we delete all the numbers from it and then we write the numbers from $1$ to $15$ in the empty cells, in an arbitrary order. find the sum possible maximum of the numbers on the board that can be achieved after a number finite number of steps.

There is a $11\times 11$ square grid. We divided this in $5$ rectangles along unit squares. How many ways that one of the rectangles doesn’t have a edge on basic circumference. Note that we count as different ways that one way coincides with another way by rotating or reversing.

Each field of the $1987\times 1987$ board is filled with numbers, which absolute value is not greater than one. The sum of all the numbers in every $2\times 2$ square equals $0$. Prove that the sum of all the numbers is not greater than $1987$.

Let $m$ and $n$ be odd positive integers. Each square of an $m$ by $n$ board is coloured red or blue. A row is said to be red-dominated if there are more red squares than blue squares in the row. A column is said to be blue-dominated if there are more blue squares than red squares in the column. Determine the maximum possible value of the number of red-dominated rows plus the number of blue-dominated columns. Express your answer in terms of $m$ and $n$.

We have a set of weights with masses $1$ gm, $2$ gm, $4$ gm and so on, all values being powers of $2$ . Some of these weights may have equal mass. Some weights were put on both sides of a balance beam, resulting in equilibrium. It is known that on the left hand side all weights were distinct . Prove that on the right hand side there were no fewer weights than on the left hand side.

We have a set of 2n positive integers whose sum is a multiple of n. One operation consists of choosing n of them and adding the same positive integer to all of them. Show that, starting from the initial 2n numbers, we can get all are equal, performing a maximum of 2n - 1 operations.

Is it possible to draw in the plane the graph presented in the figure so that all the vertices are different points and all the edges are unit segments? (The segments can intersect at points different from vertices.)

On a table, there are many coins and a container with two coins. Vale and Diego play the following game, where Vale starts and then Diego plays, alternating turns. If at the beginning of a turn the container contains \( n \) coins, the player can add a number \( d \) of coins, where \( d \) divides exactly into \( n \) and \( d < n \). The first player to complete at least 2024 coins in the container wins. Prove that there exists a strategy for Vale to win, no matter the decisions made by Diego.

A government’s land with dimensions $n \times n$ are going to be sold in phases. The land is divided into $n^2$ squares with dimension $1 \times 1$. In the first phase, $n$ farmers bought a square, and for each rows and columns there is only one square that is bought by a farmer. After one season, each farmer could buy one more square, with the conditions that the newly-bought square has a common side with the farmer’s land and it hasn’t been bought by other farmers. Determine all values of n such that the government’s land could not be entirely sold within $n$ seasons.

We are given a collection of $2^{2^k}$ coins, where $k$ is a non-negative integer. Exactly one coin is fake. We have an unlimited number of service dogs. One dog is sick but we do not know which one. A test consists of three steps: select some coins from the collection of all coins; choose a service dog; the dog smells all of the selected coins at once. A healthy dog will bark if and only if the fake coin is amongst them. Whether the sick dog will bark or not is random. \\ Devise a strategy to find the fake coin, using at most $2^k+k+2$ tests, and prove that it works.

Consider $A = \{1, 2, ..., 16\}$. A partition of $A$ into nonempty sets $A_1, A_2,..., A_n$ is said to be good if none of the Ai contains elements $a, b, c$ (not necessarily distinct) such that $a = b + c$. (a) Find a good partition $\{A_1, A_2, A_3, A_4\}$ of $A$. (b) Prove that no partition $\{A_1, A_2, A_3\}$ of $A$ is good