The following facts are known in a mathematical contest: [list] (a) The number of problems tested was $n\ge 4$ (b) Each problem was solved by exactly four contestants. (c) For each pair of problems, there is exactly one contestant who solved both problems [/list] Assuming the number of contestants is greater than or equal to $4n$, find the minimum value of $n$ for which there always exists a contestant who solved all the problems.

Based on a city's rules, the buildings of a street may not have more than $9$ stories. Moreover, if the number of stories of two buildings is the same, no matter how far they are from each other, there must be a building with a higher number of stories between them. What is the maximum number of buildings that can be built on one side of a street in this city?

On the chessboard, $ 32$ black pawns and $ 32$ white pawns are arranged. In every move, a pawn can capture another pawn of the opposite color, moving diagonally to an adjacent square where the captured one stands. White pawns move only in upper-left or upper-right directions, while black ones can move in down-left or in down-right directions only; the captured pawn is removed from the board. A pawn cannot move without capturing an opposite pawn. Find the least possible number of pawns which can stay on the chessboard.

In a room there are several children and a pile of 1000 sweets. The children come to the pile one after another in some order. Upon reaching the pile each of them divides the current number of sweets in the pile by the number of children in the room, rounds the result if it is not integer, takes the resulting number of sweets from the pile and leaves the room. All the boys round upwards and all the girls round downwards. The process continues until everyone leaves the room. Prove that the total number of sweets received by the boys does not depend on the order in which the children reach the pile. [i]Maxim Didin[/i]

We want to place $2012$ pockets, including variously colored balls, into $k$ boxes such that [b]i)[/b] For any box, all pockets in this box must include a ball with the same color or [b]ii)[/b] For any box, all pockets in this box must include a ball having a color which is not included in any other pocket in this box Find the smallest value of $k$ for which we can always do this placement whatever the number of balls in the pockets and whatever the colors of balls.

There are $ 63$ points arbitrarily on the circle $ \mathcal{C}$ with its diameter being $ 20$. Let $ S$ denote the number of triangles whose vertices are three of the $ 63$ points and the length of its sides is no less than $ 9$. Fine the maximum of $ S$.

The sequence $ \{a_n \} $ is defined as follows: $ a_0 = 1 $ and $ {a_n} = \sum \limits_ {k = 1} ^ {[\sqrt n]} {{a_ {n - {k ^ 2 }}}} $ for $ n \ge 1. $ Prove that among $ a_1, a_2, \ldots, a_ {10 ^ 6} $ there are at least $500$ even numbers. (Here, $ [x] $ is the largest integer not exceeding $ x $.)

The doctor instructed a person to take $48$ pills for next $30$ days. Every day he take at least $1$ pill and at most $6$ pills. Show that exist the numbers of conscutive days such that the total numbers of pills he take is equal with $11$.

Let $S = \{P_1,P_2,...,P_{2000}\}$ be a set of $2000$ points in the interior of a circle of radius $1$, one of which at its center. For $i = 1,2,...,2000$ denote by $x_i$ the distance from $P_i$ to the closest point $P_j \ne P_i$. Prove that $x_1^2 +x_2^2 +...+x_{2000}^2<9$ .

A pile of $2020$ stones is given. Arnaldo and Bernaldo play the following game: In each move, it is allowed to remove $1, 4, 16, 64, ...$ (any power of $4$) stones from the pile. They make their moves alternately, and the player who can no longer play loses. If Arnaldo is the first to play, who has the winning strategy?

Suppose that $p(n)$ is the number of partitions of a natural number $n$. Prove that there exists $c>0$ such that $P(n)\ge n^{c \cdot \log n}$. [i]proposed by Mohammad Mansouri[/i]

We draw $n$ convex quadrilaterals in the plane. They divide the plane into regions (one of the regions is infinite). Determine the maximal possible number of these regions.

On the Island of Camelot live $13$ grey, $15$ brown and $17$ crimson chameleons . If two chameleons of different colours meet , they both simultaneously change colour to the third colour (e .g . if a grey and brown chameleon meet each other they both change to crimson) . Is it possible that they will eventually all be the same colour? (V . G . Ilichev)

There are $36$ cards in a deck arranged in the sequence spades, clubs, hearts, diamonds, spades, clubs, hearts, diamonds, etc. Somebody took part of this deck off the top, turned it upside down, and cut this part into the remaining part of the deck (i.e. inserted it between two consecutive cards). Then four cards were taken off the top, then another four, etc. Prove that in any of these sets of four cards, all the cards are of different suits. (A Merkov, Moscow)

There are $n$ cities in Qingqiu Country. The distance between any two cities are different. The king of the country plans to number the cities and set up two-way air lines in such ways: The first time, set up a two-way air line between city 1 and the city nearest to it. The second time, set up a two-way air line between city 2 and the city second nearest to it. ... The $n-1$th time, set up a two-way air line between city $n-1$ and the city farthest to it. Prove: The king can number the cities in a proper way so that he can go to any other city from any city by plane.

Let $a_1, a_2, a_3, \dots, a_{20}$ be a permutation of the numbers $1, 2, \dots, 20$. How many different values can the expression $a_1-a_2+a_3-\dots - a_{20}$ have?

City of Mar del Plata is a square shaped $WSEN$ land with $2(n + 1)$ streets that divides it into $n \times n$ blocks, where $n$ is an even number (the leading streets form the perimeter of the square). Each block has a dimension of $100 \times 100$ meters. All streets in Mar del Plata are one-way. The streets which are parallel and adjacent to each other are directed in opposite direction. Street $WS$ is driven in the direction from $W$ to $S$ and the street $WN$ travels from $W$ to $N$. A street cleaning car starts from point $W$. The driver wants to go to the point $E$ and in doing so, he must cross as much as possible roads. What is the length of the longest route he can go, if any $100$-meter stretch cannot be crossed more than once? (The figure shows a plan of the city for $n=6$ and one of the possible - but not the longest - routes of the street cleaning car. See http://goo.gl/maps/JAzD too.) [img]http://s14.postimg.org/avfg7ygb5/CPS_2012_P5.jpg[/img]

In how many ways we can paint a $N \times N$ chessboard using 4 colours such that squares with a common side are painted with distinct colors and every $2 \times 2$ square (formed with 4 squares in consecutive lines and columns) is painted with the four colors?

The positive numbers $a_1, a_2, \ldots , a_{2024}$ are placed on a circle clockwise in this order. Let $A_i$ be the arithmetic mean of the number $a_i$ and one or several following it clockwise. Prove that the largest of the numbers $A_1, A_2, \ldots , A_{2024}$ is not less than the arithmetic mean of all numbers $a_1, a_2, \ldots , a_{2024}$.

Some cells of a $10\times10$ board are marked so that each cell has an even number of neighboring (i.e. sharing a side) marked cells. Find the maximum possible number of marked cells.

Let $a_1,a_2,\dots, a_{17}$ be a permutation of $1,2,\dots, 17$ such that $(a_1-a_2)(a_2-a_3)\dots(a_{17}-a_1)=n^{17}$ .Find the maximum possible value of $n$ .

Let $n, k$ be positive integers with $k \geq 3$. The edges of of a complete graph $K_n$ are colored in $k$ colors, such that for any color $i$ and any two vertices, there exists a path between them, consisting only of edges in color $i$. Prove that there exist three vertices $A, B, C$ of $K_n$, such that $AB, BC$ and $CA$ are all distinctly colored.

Determine the smallest integer $j$ such that it is possible to fill the fields of the table $10\times 10$ with numbers from $1$ to $100$ so that every $10$ consecutive numbers lie in some of the $j\times j$ squares of the table. Czech Republic

A connected graph has $100$ vertices, the degrees of all the vertices do not exceed $4$ and no two vertices of degree $4$ are adjacent. Prove that it is possible to remove several edges that have no common vertices from this graph such that there would be no triangles in the resulting graph.

$32$ stones, with pairwise different weights, and lever scales without weights are given. How to determine by $35$ scaling, which stone is the heaviest and which is the second by weight?