Let $M$ be the set of five points in space, none of which four do not lie in a plane. Let $R$ be a set of seven planes with properties: a) Each plane from the set $R$ contains at least one point of the set$ M$. b) None of the points of the set M lie in the five planes of the set $R$. Prove that there are also two distinct points $P$, $Q$, $ P \in M$, $Q \in M$, that the line $PQ$ is not the intersection of any two planes from the set $R$.

On a rectangular board with $m \times n$ squares ($m, n \ge 3$) there are dominoes ($2 \times 1$ or $1\times 2$ tiles), which do not overlap and do not extend beyond the board. Every domino covers exactly two squares of the board. Assume that the dominos cover the has the property that no more dominos can be added to the board and that the four corner spaces of the board are not all empty. Prove that at least $2/3$ of the squares of the board are covered with dominos.

We are given six points in space with distinct distances, no three of them collinear. Consider all triangles with vertices among these points. Show that among these triangles there is one such that its longest side is the shortest side in one of the other triangles.

When we cut a rope into two pieces, we say that the cut is special if both pieces have different lengths. We cut a chord of length $2008$ into two pieces with integer lengths and we write those lengths on the board. Afterwards, we cut one of the pieces into two new pieces with integer lengths and we write those lengths on the board. This process ends until all pieces have length $1$. $a)$ Find the minimum possible number of special cuts. $b)$ Prove that, for all processes that have the minimum possible number of special cuts, the number of different integers on the board is always the same.

(a)The game of "super- chess" is played on a $30 \times 30$ board and involves $20$ different pieces. Each piece moves according to its own rules , but cannot move from any square to more than $20$ other squares . A piece "captures" another piece which is on a square to which it has moved. A permitted move (e.g. $m$ squares forward and $n$ squares to the right) does not depend on the piece 's starting square . Prove that (i) A piece cannot cap ture a piece on a given square from more than $20$ starting squares. (ii) It is possible to arrange all $20$ pieces on the board in such a way that not one of them can capture any of the others in one move. (b) The game of "super-chess" is played on a $100 \times 100$ board and involves $20$ different pieces. Each piece moves according to its own rules , but cannot move from any square to more than $20$ other squares. A piece "captures" another piece which is on a square to which it has moved. It is possible that a permitted move (e.g. $m$ squares forward and $n$ squares to the right) may vary, depending on the piece's position . Prove that one can arrange all $20$ pieces on the board in such a way that not one of them can capture any of the others in one move. ( A . K . Tolpygo, Kiev) PS. (a) for Juniors , (b) for Seniors

Let $N$ be the number of ordered lists of $9$ positive integers $(a,b,c,d,e,f,g,h,i)$ such that $$\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+\frac{1}{d}+\frac{1}{e}+\frac{1}{f}+\frac{1}{g}+\frac{1}{h}+\frac{1}{i}=1.$$ Determine whether $N$ is even or odd.

The numbers $1, 2, 3, \ldots$ are arranged in a spiral in the vertices of an infinite square grid (see figure). Then in the centre of each square the sum of the numbers in its vertices is placed. Prove that for each positive integer n the centres of the squares contain infinitely many multiples of $n$.

$A_0B, A_0C$ rays that satisfy $\angle BA_0C=14^{\circ}$. You are to place points $A_1, A_2, ...$ by the following rules. [b]Rules[/b] (1) On the first move, place $A_1$ on any point on $A_0B$(except $A_0$). (2) On the $n>1$th move, place $A_n$ on $A_0B$ iff $A_{n-1}$ is on $A_0C$, and place $A_n$ on $A_0C$ iff $A_{n-1}$ is one $A_0B$. $A_n$ must be place on the point that satisfies $A_{n-2}A_n{n-1}=A_{n-1}A_n$. All the points must be placed in different locations. What is the maximum number of points that can be placed?

In a chess tournament, each player played at most one game against each other, and the number of games played by each player is not less than the set natural number $ n $. Prove that it is possible to divide players into two groups $ A $ and $ B $ in such a way that the number of games played by each player of group $ A $ with players of group $ B $ is not less than $ n/2 $ and at the same time the number of games played by each player of the $ B $ group with players of the $ A $ group was not less than $ n/2 $.

There is an equilateral triangle $ABC$ on the plane. Three straight lines pass through $A$, $B$ and $C$, respectively, such that the intersections of these lines form an equilateral triangle inside $ABC$. On each turn, Ming chooses a two-line intersection inside $ABC$, and draws the straight line determined by the intersection and one of $A$, $B$ and $C$ of his choice. Find the maximum possible number of three-line intersections within $ABC$ after 300 turns. [i] Proposed by usjl[/i]

Determine all pairs $(m, n)$ of positive integers, for which cube $K$ with edges of length $n$, can be build in with cuboids of shape $m \times 1 \times 1$ to create cube with edges of length $n + 2$, which has the same center as cube $K$.

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.

In a room, there are $2005$ boxes, each of them containing one or several sorts of fruits, and of course an integer amount of each fruit. [b]a)[/b] Show that we can find $669$ boxes, which altogether contain at least a third of all apples and at least a third of all bananas. [b]b)[/b] Can we always find $669$ boxes, which altogether contain at least a third of all apples, at least a third of all bananas and at least a third of all pears?

Let $n$ be a integer and $n \ge 3$, and $T_1T_2...T_n$ is a regular n-gon. Distinct $3$ points $T_i , T_j , T_k$ are chosen randomly. Determine the probability of triangle $T_iT_jT_k$ being an acute triangle.

In conference there $n>2$ mathematicians. Every two mathematicians communicate in one of the $n$ offical languages of the conference. For any three different offical languages the exists three mathematicians who communicate with each other in these three languages. Find all $n$ such that this is possible.

2008 boys and 2008 girls sit on 4016 chairs around a round table. Each boy brings a garland and each girl brings a chocolate. In an "activity", each person gives his/her goods to the nearest person on the left. After some activities, it turns out that all boys get chocolates and all girls get garlands. Find the number of possible arrangements.

In a given community of people, each person has at least two friends within the community. Whenever some people from this community sit on a round table such that each adjacent pair of people are friends, it happens that no non-adjacent pair of people are friends. Prove that there exist two people in this community such that each has exactly two friends and they have at least one common friend.

$100$ Queens are placed on a $100 \times 100$ chessboard so that no two attack each other. Prove that each of four $50 \times 50$ corners of the board contains at least one Queen.

Let $n > 1$ be a positive integer. A 2-dimensional grid, infinite in all directions, is given. Each 1 by 1 square in a given $n$ by $n$ square has a counter on it. A [i]move[/i] consists of taking $n$ adjacent counters in a row or column and sliding them each by one space along that row or column. A [i]returning sequence[/i] is a finite sequence of moves such that all counters again fill the original $n$ by $n$ square at the end of the sequence. [list] [*] Assume that all counters are distinguishable except two, which are indistinguishable from each other. Prove that any distinguishable arrangement of counters in the $n$ by $n$ square can be reached by a returning sequence. [*] Assume all counters are distinguishable. Prove that there is no returning sequence that switches two counters and returns the rest to their original positions.[/list] [i]Mitchell Lee and Benjamin Gunby.[/i]

In a basketball tournament any two of the $n$ teams $S_1,S_2,...,S_n$ play one match (no draws). Denote by $v_i$ and $p_i$ the number of victories and defeats of team $S_i$ ($i = 1,2,...,n$), respectively. Prove that $v^2_1 +v^2_2 +...+v^2_n = p^2_1 +p^2_2 +...+p^2_n$

Eight men had participated in the chess tournament. (Each meets each, draws are allowed, giving $1/2$ of point, winner gets $1$.) Everyone has different number of points. The second one has got as many points as the four weakest participants together. What was the result of the play between the third prizer and the chess-player that have occupied the seventh place?

Every of $n$ guests invited to a dinner has got an invitation denoted by a number from $1$ to $n$. The guests will be sitting around a round table with $n$ seats. The waiter has decided to derve them according to the following rule. At first, he selects one guest and serves him/her at any place. Thereafter, he selects the guests one by one: having chosen a guest, he goes around the table for the number of seats equal to the preceeding guest's invitation number (starting from the seat of the preceeding guest), and serves the guest there. Find all $n$ for which he can select the guests in such an order to serve all the guests.

Consider the set $ M = \{1,2, \ldots ,2008\}$. Paint every number in the set $ M$ with one of the three colors blue, yellow, red such that each color is utilized to paint at least one number. Define two sets: $ S_1=\{(x,y,z)\in M^3\ \mid\ x,y,z\text{ have the same color and }2008 | (x + y + z)\}$; $ S_2=\{(x,y,z)\in M^3\ \mid\ x,y,z\text{ have three pairwisely different colors and }2008 | (x + y + z)\}$. Prove that $ 2|S_1| > |S_2|$ (where $ |X|$ denotes the number of elements in a set $ X$).

A flea is, initially, in the point, which the coordinate is $1$, in the real line. At each second, from the coordinate $a$, the flea can jump to the coordinate point $a+2$ or to the coordinate point $\frac{a}{2}$. Determine the quantity of distinct positions(including the initial position) which the flea can be in until $n$ seconds. For instance, if $n=1$, the flea can be in the coordinate points $1,3$ or $\frac{1}{2}$.

Let $ X$ be a set containing $ 2k$ elements, $ F$ is a set of subsets of $ X$ consisting of certain $ k$ elements such that any one subset of $ X$ consisting of $ k \minus{} 1$ elements is exactly contained in an element of $ F.$ Show that $ k \plus{} 1$ is a prime number.