Let $n$ be a positive integer. Given $n$ points in the plane, prove that it is possible to draw an angle with measure $\frac{2\pi}{n}$ with vertex as each one of the given points, such that any point in the plane is covered by at least one of the angles.

In a certain city only simple (pairwise) exchanges of apartments are allowed (if two families exchange fiats , they are not allowed to participate in another exchange on the same day). Prove that any compound exchange may be effected in two days. It is assumed that under any exchange (simple or comp ound) each family occupies one fiat before and after the exchange and the family cannot split up . (A . Shnirelman , N .N . Konstantinov)

Place a pebble at each [i]non-positive[/i] integer point on the real line, and let $n$ be a fixed positive integer. At each step we choose some n consecutive integer points, remove one of the pebbles located at these points and rearrange all others arbitrarily within these points (placing at most one pebble at each point). Determine whether there exists a positive integer $n$ such that for any given $N > 0$ we can place a pebble at a point with coordinate greater than $N$ in a finite number of steps described above.

We number the columns of an $n\times n$-board from $1$ to $n$. In each cell, we place a number. This is done in such a way that each row precisely contains the numbers $1$ to $n$ (in some order), and also each column contains the numbers $1$ to $n$ (in some order). Next, each cell that contains a number greater than the cell's column number, is coloured grey. In the figure below you can see an example for the case $n = 3$. [asy] unitsize(0.6 cm); int i; fill((0,0)--(1,0)--(1,1)--(0,1)--cycle, gray(0.8)); fill(shift((1,0))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.8)); fill(shift((0,2))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.8)); for (i = 0; i <= 3; ++i) { draw((0,i)--(3,i)); draw((i,0)--(i,3)); } label("$1$", (0.5,3.5)); label("$2$", (1.5,3.5)); label("$3$", (2.5,3.5)); label("$3$", (0.5,2.5)); label("$1$", (1.5,2.5)); label("$2$", (2.5,2.5)); label("$1$", (0.5,1.5)); label("$2$", (1.5,1.5)); label("$3$", (2.5,1.5)); label("$2$", (0.5,0.5)); label("$3$", (1.5,0.5)); label("$1$", (2.5,0.5)); [/asy] (a) Suppose that $n = 5$. Can the numbers be placed in such a way that each row contains the same number of grey cells? (b) Suppose that $n = 10$. Can the numbers be placed in such a way that each row contains the same number of grey cells?

Let $S = \{(x, y) \in Z^2 | 0 \le x \le 11, 0\le y \le 9\}$. Compute the number of sequences $(s_0, s_1, . . . , s_n)$ of elements in $S$ (for any positive integer $n \ge 2$) that satisfy the following conditions: $\bullet$ $s_0 = (0, 0)$ and $s_1 = (1, 0)$, $\bullet$ $s_0, s_1, . . . , s_n$ are distinct, $\bullet$ for all integers $2 \le i \le n$, $s_i$ is obtained by rotating $s_{i-2}$ about $s_{i-1}$ by either $90^o$ or $180^o$ in the clockwise direction.

There are $n$ pawns on $n$ distinct squares of a $19\times 19$ chessboard. In each move, all the pawns are simultaneously moved to a neighboring square (horizontally or vertically) so that no two are moved onto the same square. No pawn can be moved along the same line in two successive moves. What is largest number of pawns can a player place on the board (being able to arrange them freely) so as to be able to continue the game indefinitely?

An arbitrary number of lines divide the plane into regions. Show that the regions can be colored red and blue so that neighboring regions have different colors.

All vertices of a regular 100-gon are colored in 10 colors. Prove that there exist 4 vertices of the given 100-gon which are the vertices of a rectangle and which are colored in at most 2 colors.

Given a set $A$ and a function $f: A\rightarrow A$, denote by $f_{1}(A)=f(A)$, $f_{2}(A)=f(f_{1}(A))$, $f_{3}(A)=f(f_{2}(A))$, and so on, ($f_{n}(A)=f(f_{n-1}(A))$, where the notation $f(B)$ means the set $\{ f(x) \ : \ x\in B\}$ of images of points from $B$). Denote also by $f_{\infty}(A)=f_{1}(A)\cap f_{2}(A)\cap \ldots = \bigcap_{n\geq 1}f_{n}(A)$. a) Show that if $A$ is finite, then $f(f_{\infty}(A))=f_{\infty}(A)$. b) Determine if the above is true for $A=\mathbb{N}\times \mathbb{N}$ and the function \[f\big((m,n)\big)=\begin{cases}(m+1,n) & \mbox{if }n\geq m\geq 1 \\ (0,0) & \mbox{if }m>n \\ (0,n+1) & \mbox{if }n=0. \end{cases}\]

Polina and Yan have $n$ cards, on the first card on one side $1$ is written, on the other side $n+1$, on the second card on one side $2$ is written, on the other side $n+2$, etc. Polina laid all cards in a circle in some order. Yan wants to turn some cards such that the numbers on the top sides of adjacent cards were not coprime. For every positive integer $n \geq 3$ determine can Yan accomplish that regardless of the actions of Polina. [i]M. Shutro[/i]

Find the maximal number of crosses with 5 squares that can be placed on 8x8 grid without overlapping.

Bill plays a game in which he rolls two fair standard six-sided dice with sides labeled one through six. He wins if the number on one of the dice is three times the number on the other die. If Bill plays this game three times, compute the probability that he wins at least once.

Every natural number is coloured in one of the $ k$ colors. Prove that there exist four distinct natural numbers $ a, b, c, d$, all coloured in the same colour, such that $ ad \equal{} bc$, $ \displaystyle \frac b a$ is power of 2 and $ \displaystyle \frac c a$ is power of 3.

Consider a set of $n > 3$ points in the plane, no three of which are collinear, and a natural number $k < n$. Prove the following statements: (a) If $k \le \frac{n}{2}$, then each point can be connected with at least k other points by segments so that no three segments form a triangle. (b) If $k \ge \frac{n}{2}$, and each point is connected with at least k other points by segments, then some three segments form a triangle.

Players $A$ and $B$ play a game with $N \geq 2012$ coins and $2012$ boxes arranged around a circle. Initially $A$ distributes the coins among the boxes so that there is at least $1$ coin in each box. Then the two of them make moves in the order $B,A,B,A,\ldots $ by the following rules: [b](a)[/b] On every move of his $B$ passes $1$ coin from every box to an adjacent box. [b](b)[/b] On every move of hers $A$ chooses several coins that were [i]not[/i] involved in $B$'s previous move and are in different boxes. She passes every coin to an adjacent box. Player $A$'s goal is to ensure at least $1$ coin in each box after every move of hers, regardless of how $B$ plays and how many moves are made. Find the least $N$ that enables her to succeed.

The plane is covered with circles in such a way that the center of each circle does not belong to any other circle. Prove that each point of the plane belongs to at most five circles.

There are many cities in penguin's land. A road runs between some of them, which either can be one or two lanes. When two streets meet outside of a city, it becomes prevent traffic chaos by building a bridge and avoiding any junctions. Now the penguin parliament has passed a new law, according to which every street is only a one-way street may be used. The Minister of Transport now liked the direction of each street stipulate that in each city at most one lane more or less leads in and out. He also knows that the streets of every city have odd number of tracks. Show that he can succeed in his endeavor.

Let $r$ be a positive integer, and let $a_0 , a_1 , \cdots $ be an infinite sequence of real numbers. Assume that for all nonnegative integers $m$ and $s$ there exists a positive integer $n \in [m+1, m+r]$ such that \[ a_m + a_{m+1} +\cdots +a_{m+s} = a_n + a_{n+1} +\cdots +a_{n+s} \] Prove that the sequence is periodic, i.e. there exists some $p \ge 1 $ such that $a_{n+p} =a_n $ for all $n \ge 0$.

Suppose there are three empty buckets and $n \ge 3$ marbles. Ani and Budi play a game. For the first turn, Ani distributes all the marbles into the buckets so that each bucket has at least one marble. Then Budi and Ani alternate turns, starting with Budi. On a turn, the current player may choose a bucket and take 1, 2, or 3 marbles from it. The player that takes the last marble wins. Find all $n$ such that Ani has a winning strategy, including what Ani's first move (distributing the marbles) should be for these $n$.

An Indian raga has two kinds of notes: a short note, which lasts for $1$ beat and a long note, which lasts for $2$ beats. For example, there are $3$ ragas which are $3$ beats long; $3$ short notes, a short note followed by a long note, and a long note followed by a short note. How many Indian ragas are 11 beats long?

On the plane are chosen $n \ge 3$ points, not all on the same line. Drawing all lines passing through two of these points one obtains k different lines. Prove that $k \ge n$.

For a set $A$ of integers, define $f(A)=\{x^2+xy+y^2: x,y\in A\}$. Is there a constant $c$ such that for all positive integers $n$, there exists a set $A$ of size $n$ such that $|f(A)|\le cn$? [i]David Yang.[/i]

$5$ people stand in a line facing one direction. In every round, the person at the front moves randomly to any position in the line, including the front or the end. Suppose that $\frac{m}{n}$ is the expected number of rounds needed for the last person of the initial line to appear at the front of the line, where $m$ and $n$ are relatively prime positive integers. What is $m + n$?

In a row are 23 boxes such that for $1\le k \le 23$, there is a box containing exactly $k$ balls. In one move, we can double the number of balls in any box by taking balls from another box which has more. Is it always possible to end up with exactly $k$ balls in the $k$-th box for $1\le k\le 23$?

Given an integer number $n \geq 3$, consider $n$ distinct points on a circle, labelled $1$ through $n$. Determine the maximum number of closed chords $[ij]$, $i \neq j$, having pairwise non-empty intersections. [i]János Pach[/i]