$30$ segments of lengths$$1,\quad \sqrt{3},\quad \sqrt{5},\quad \sqrt{7},\quad \sqrt{9},\quad \ldots ,\quad \sqrt{59} $$ have been drawn on a blackboard. In each step, two of the segments are deleted and a new segment of length equal to the hypotenuse of the right triangle with legs equal to the two deleted segments is drawn. After $29$ steps only one segment remains. Find the possible values of its length.

Given a convex polyhedron and a sphere intersecting each its edge at two points so that each edge is trisected (divided into three equal parts). Is it necessarily true that all faces of the polyhedron are (a) congruent polygons? (b) regular polygons?

Given $n$ points in the three dimensional space such, that the arbitrary triangle with the vertices in three of those points contains an angle greater than $120$ degrees. Prove that you can rearrange them to make a polyline (unclosed) with all the angles between the sequent links greater than $120$ degrees.

a) There are $2n$ rays marked in a plane, with $n$ being a natural number. Given that no two marked rays have the same direction and no two marked rays have a common initial point, prove that there exists a line that passes through none of the initial points of the marked rays and intersects with exactly $n$ marked rays. (b) Would the claim still hold if the assumption that no two marked rays have a common initial point was dropped?

Each point of the plane is colored by one of the two colors. Show that there exists an equilateral triangle with monochromatic vertices.

Consider five segments $AB_1, AB_2, AB_3, AB_4, AB_5$. From each point $B_i$ there can exit either $5$ segments or no segments at all, so that the endpoints of any two segments of the resulting graph (system of segments) do not coincide. Can the number of free endpoints of the segments thus constructed be equal to $1001$? (A free endpoint is an endpoint from which no segment begins.)

Determine the polygons with $n$ sides $(n \ge 4)$, not necessarily convex, which satisfy the property that the reflection of every vertex of polygon with respect to every diagonal of the polygon does not fall outside the polygon. [b]Note:[/b] Each segment joining two non-neighboring vertices of the polygon is a diagonal. The reflection is considered with respect to the support line of the diagonal.

An $8\times 8$ chessboard is made of unit squares. We put a rectangular piece of paper with sides of length 1 and 2. We say that the paper and a single square overlap if they share an inner point. Determine the maximum number of black squares that can overlap the paper.

Thirty rays with the origin at the same point are constructed on a plane. Consider all angles between any two of these rays. Let $N$ be the number of acute angles among these angles. Find the smallest possible value of $N$. (E. Barabanov)

A checkered square of size $2\times2$ is covered by two triangles. Is it necessarily true that: [list=a] [*]at least one of its four cells is fully covered by one of the triangles; [*]some square of size $1\times1$ can be placed into one of these triangles? [/list] [i]Alexandr Shapovalov[/i]

Into how many regions do $n$ circles divide the plane, if each pair of circles intersects in two points and no point lies on three circles?

How many colorings of an $n$-gon in $p \ge 2$ colors are there such that no two neighboring vertices have the same color?

Given is a convex polygon $ P$ with $ n$ vertices. Triangle whose vertices lie on vertices of $ P$ is called [i]good [/i] if all its sides are unit length. Prove that there are at most $ \frac {2n}{3}$ [i]good[/i] triangles. [i]Author: Vyacheslav Yasinskiy, Ukraine[/i]

A kingdom consists of $12$ cities located on a one-way circular road. A magician comes on the $13$th of every month to cast spells. He starts at the city which was the 5th down the road from the one that he started at during the last month (for example, if the cities are numbered $1–12$ clockwise, and the direction of travel is clockwise, and he started at city #$9$ last month, he will start at city #$2$ this month). At each city that he visits, the magician casts a spell if the city is not already under the spell, and then moves on to the next city. If he arrives at a city which is already under the spell, then he removes the spell from this city, and leaves the kingdom until the next month. Last Thanksgiving the capital city was free of the spell. Prove that it will be free of the spell this Thanksgiving as well.

We have “bricks” made in the following way: we take a unit cube and glue to three of its faces which have a common vertex three more cubes in such a way that the faces glued together coincide. Is it possible to construct from these bricks an $11 \times 12 \times 13$ box? (A Andjans, Riga )

A point in the cartesian plane with integer coordinates is called a lattice point. Consider the following one player game. A finite set of selected lattice points and finite set of selected segments is called a position in this game if the following hold: (i) The endpoints of each selected segment are lattice points; (ii) Each selected segment is parallel to a coordinate axis or to one of the lines $y = \pm x$, (iii) Each selected segment contains exactly five lattice points, all of which are selected, (iv) Every two selected segments have at most one common point. A move in this game consists of selecting a lattice point and a segment such that the new set of selected lattice points and segments is a position. Prove or disprove that there exists an initial position such that the game can have infinitely many moves.

Consider the set $G$ of $2011^2$ points $(x, y)$ in the plane where $x$ and $y$ are both integers between $ 1$ and $2011$ inclusive. Let $A$ be any subset of $G$ containing at least $4\times 2011\times \sqrt{2011}$ points. Show that there are at least $2011^2$ parallelograms whose vertices lie in $A$ and all of whose diagonals meet at a single point.

Consider partitions of an $n \times n$ square (composed of $n^2$ unit squares) into rectangles with one integer side and the other side equal to $1$. What is the largest possible number of such partitions among which no two have an identical rectangle at the same place?

For an integer $n \geq 5,$ two players play the following game on a regular $n$-gon. Initially, three consecutive vertices are chosen, and one counter is placed on each. A move consists of one player sliding one counter along any number of edges to another vertex of the $n$-gon without jumping over another counter. A move is legal if the area of the triangle formed by the counters is strictly greater after the move than before. The players take turns to make legal moves, and if a player cannot make a legal move, that player loses. For which values of $n$ does the player making the first move have a winning strategy?

Each vertex of a regular $17$-gon is colored red, blue, or green in such a way that no two adjacent vertices have the same color. Call a triangle “multicolored” if its vertices are colored red, blue, and green, in some order. Prove that the $17$-gon can be cut along nonintersecting diagonals to form at least two multicolored triangles. (A diagonal of a polygon is a a line segment connecting two nonadjacent vertices. Diagonals are called nonintersecting if each pair of them either intersect in a vertex or do not intersect at all.)

Let $ABC$ be an equilateral triangle of side $1$. There are three grasshoppers sitting in $A$, $B$, $C$. At any point of time for any two grasshoppers separated by a distance $d$ one of them can jump over other one so that distance between them becomes $2kd$, $k,d$ are nonfixed positive integers. Let $M$, $N$ be points on rays $AB$, $AC$ such that $AM=AN=l$, $l$ is fixed positive integer. In a finite number of jumps all of grasshoppers end up sitting inside the triangle $AMN$. Find, in terms of $l$, the number of final positions of the grasshoppers. (Grasshoppers can leave the triangle $AMN$ during their jumps.)

Some of the vertices of a convex $n$-gon are connected by segments, such that any two of them have no common interior point. Prove that, for any $n$ points in general position, there exists a one-to-one correspondence between the points and the vertices of the $n$ gon, such that any two segments between the points, corresponding to the respective segments from the $n$ gon, have no common interior point.

Is it possible to cut a square of side $1$ into two parts and rearrange them so that one can cover a circle having diameter greater than $1$? (Note: any circle with diameter greater than $1$ suffices) [i](A. Shapovalov)[/i] (Translated from [url=http://sasja.shap.homedns.org/Turniry/TG/index.html]here.[/url])

There are 5 points on plane. Prove that you can chose some of them and shift them such that distances between shifted points won't change and as a result there will be symetric by some line set of 5 points.

Find the greatest $n$ such that $(z+1)^n = z^n + 1$ has all its non-zero roots in the unitary circumference, e.g. $(\alpha+1)^n = \alpha^n + 1, \alpha \neq 0$ implies $|\alpha| = 1.$