In a certain country there are 9 cities and two airline companies: AeroSol and AeroLuna. Between each pair of cities there are flights from one and only one of them. the two companies. Furthermore, for any triple of cities $X$, $Y$,$ Z$ σt least one of the flights between them is served by AeroLuna. It is possible to find $4$ cities such that all flights between them be served by AeroLuna?

Ten girls, numbered from 1 to 10, sit at a round table, in a random order. Each girl then receives a new number, namely the sum of her own number and those of her two neighbours. Prove that some girl receives a new number greater than 17.

In Geneva there are $16$ secret agents, each of whom is watching one or more other agents. It is known that if agent $A$ is watching agent $B$, then $B$ is not watching $A$. Moreover, any $10$ agents can be ordered so that the first is watching the second, the second is watching the third, etc, the last is watching the first. Show that any $11$ agents can also be so ordered.

There are $n$ boxes which is numbere from $1$ to $n$. The box with number $1$ is open, and the others are closed. There are $m$ identical balls ($m\geq n$). One of the balls is put into the open box, then we open the box with number $2$. Now, we put another ball to one of two open boxes, then we open the box with number $3$. Go on until the last box will be open. After that the remaining balls will be randomly put into the boxes. In how many ways this arrangement can be done?

Let $n$ be a positive integer. At most how many distinct unit vectors can be selected in $\mathbb{R}^n$ such that from any three of them, at least two are orthogonal?

Allen and Brian are playing a game in which they roll a $6$-sided die until one of them wins. Allen wins if two consecutive rolls are equal and at most 3. Brian wins if two consecutive rolls add up to $7$ and the latter is at most $3$. What is the probability that Allen wins

Let $n>1$ be an integer. Hippo chooses a list of $n$ points in the plane $P_1, \dots, P_n$; some of these points may coincide, but not all of them can be identical. After this, Wombat picks a point from the list $X$ and measures the distances from it to the other $n-1$ points in the list. The average of the resulting $n-1$ numbers will be denoted $m(X)$. Find all values of $n$ for which Hippo can prepare the list in such a way, that for any point $X$ Wombat may pick, he can point to a point $Y$ from the list such that $XY=m(X)$.

a) A game is played on an infinite plane. There are fifty one pieces, one “wolf” and $50$ “sheep”. There are two players. The first commences by moving the wolf. Then the second player moves one of the sheep, the first player moves the wolf, the second player moves a sheep, and so on. The wolf and the sheep can move in any direction through a distance of up to one metre per move. Is it true that for any starting position the wolf will be able to capture at least one sheep? b) A game is played on an infinite plane. There are two players. One has a piece known as a “wolf”, while the other has $K$ pieces known as “sheep”. The first player moves the wolf, then the second player moves a sheep, the first player moves the wolf again, the second player moves a sheep, and so on. The wolf and the sheep can move in any direction, with a maximum distance of one metre per move. Is it true that for any value of $K$ there exists an initial position from which the wolf can not capture any sheep? PS. (a) was the junior version, (b) the senior one

Integers $1 \le n \le 200$ are written on a blackboard just one by one. We surrounded just $100$ integers with circle. We call a square of the sum of surrounded integers minus the sum of not surrounded integers $score$ of this situation. Calculate the average score in all ways.

Consider the segment $[0; 1]$. At each step we may split one of the available segments into two new segments and write the product of lengths of these two new segments onto a blackboard. Prove that the sum of the numbers on the blackboard never will exceed $1/2$. [i]Mikhail Lukin[/i]

There are There are $64$ towns in a country, and some pairs of towns are connected by roads but we do not know these pairs. We may choose any pair of towns and find out whether they are connected by a road. Our aim is to determine whether it is possible to travel between any two towns using roads. Prove that there is no algorithm which would enable us to do this in less than $2016$ questions. but we do not know these pairs. We may choose any pair of towns and find out whether they are connected by a road. Our aim is to determine whether it is possible to travel between any two towns using roads. Prove that there is no algorithm which would enable us to do this in less than $2016$ questions.

In a classroom there are $m$ students. During the month of July each of them visited the library at least once but none of them visited the library twice in the same day. It turned out that during the month of July each student visited the library a different number of times, furthermore for any two students $A$ and $B$ there was a day in which $A$ visited the library and $B$ did not and there was also a day when $B$ visited the library and $A$ did not do so. Determine the largest possible value of $m$.

Find the number of ways to put a number in every unit square of a $3 \times 3$ square such that any number is divisible by the number directly to the top and the number directly to the left of it, and the top-left number is $1$ and the bottom right number is $2013$.

A $2N\times2N$ board is covered by non-overlapping dominos of $1\times2$ size. A lame rook (which can only move one cell at a time, horizontally or vertically) has visited each cell once on its route across the board. Call a move by the rook longitudinal if it is a move from one cell of a domino to another cell of the same domino. What is: [list=a] [*]the maximum possible number of longitudinal moves? [*]the minimum possible number of longitudinal moves? [/list]

Joy has a square board of size $n \times n$. At every step, he colours a cell of the board. He cannot colour any cell more than once. He also counts points while colouring the cells. At first, he has $0$ points. Every step, after colouring a cell $c$, he takes the largest possible set $S$ that creates a "$+$" sign where all cells are coloured and $c$ lies in the centre. Then, he gets the size of set $S$ as points. After colouring the whole $n \times n$ board, what is the maximum possible amount of points he can get?

A $tetromino$ is a figure made up of four unit squares connected by common edges. [List=i] [*] If we do not distinguish between the possible rotations of a tetromino within its plane, prove that there are seven distinct tetrominos. [*]Prove or disprove the statement: It is possible to pack all seven distinct tetrominos into $4\times 7$ rectangle without overlapping. [/list]

Consider all segments dividing the area of a triangle $ABC$ in two equal parts. Find the length of the shortest segment among them, if the side lengths $a,$ $b,$ $c$ of triangle $ABC$ are given. How many of these shortest segments exist ?

$101$ people, sitting at a round table in any order, had $1,2,... , 101$ cards, respectively. A transfer is someone give one card to one of the two people adjacent to him. Find the smallest positive integer $k$ such that there always can through no more than $ k $ times transfer, each person hold cards of the same number, regardless of the sitting order.

Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the sequence $1$, $2$, $\dots$ , $n$ satisfying $$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$. Proposed by United Kingdom

The numbers $1, 2, \ldots 49$ are placed in a $7\times 7$ array, and the sum of the numbers in each row and in each column is computed. Some of these $14$ sums are odd while others are even. Let $A$ denote the sum of all the odd sums and $B$ the sum of all even sums. Is it possible that the numbers were placed in the array in such a way that $A = B$?

Given $n\ge 3$. consider a sequence $a_1,a_2,...,a_n$, if $(a_i,a_j,a_k)$ with i+k=2j (i<j<k) and $a_i+a_k\ne 2a_j$, we call such a triple a $NOT-AP$ triple. If a sequence has at least one $NOT-AP$ triple, find the least possible number of the $NOT-AP$ triple it contains.

Let $m,n$ be positive integers. An $n\times n$ board has rows and columns numbered $1,2,\dots,n$ from left to right and top to bottom, respectively. This board is colored with colors $r_1,r_2,\dots,r_m$ such that the cell at the intersection of $i$th row and $j$th column is colored with $r_{i+j-1}$ where indices are taken modulo $m$. After the board is colored, Ahmet wants to put $n$ stones to the board so that each row and column has exactly one stone, also he wants to put the same amount of stones to each color. Find all pairs $(m,n)$ for which he can accomplish his goal. Proposed by [i]Sena Başaran[/i]

A square table of size $7\times 7$ with the four corner squares deleted is given. [list=a] [*] What is the smallest number of squares which need to be colored black so that a $5-$square entirely uncolored Greek cross (Figure 1) cannot be found on the table? [*] Prove that it is possible to write integers in each square in a way that the sum of the integers in each Greek cross is negative while the sum of all integers in the square table is positive. [/list] [asy] size(3.5cm); usepackage("amsmath"); MP("\text{Figure }1.", (1.5, 3.5), N); DPA(box((0,1),(3,2))^^box((1,0),(2,3)), black); [/asy]

Cells of a $n*n$ square are filled with positive integers in the way that in the intersection of the $i-$th column and $j-$th row, the number $i+j$ is written. In every step, we can choose two non-intersecting equal rectangles with one dimension equal to $n$ and swap all the numbers inside these two rectangles with one another. ( without reflection or rotation ) Find the minimum number of moves one should do to reach the position where the intersection of the $i-$th column and $j-$row is written $2n+2-i-j$.

2000 people are sitting around a round table. Each one of them is either a truth-sayer (who always tells the truth) or a liar (who always lies). Each person said: "At least two of the three people next to me to the right are liars". How many truth-sayers are there in the circle?