Find all natural numbers $n \ge 3$ for which in an arbitrary $n$-gon one can choose $3$ vertices dividing its boundary into three parts, the lengths of which can be the lengths of the sides of some triangle. (Fedir Yudin)

Given are $m\ge 3$ points in the plane. Prove that you can always choose three of these points $A,B,C$ such that $$\angle ABC \le \frac{180^o}{m}.$$

Let there be $2n+1$ distinct points on a circle. Consider the set of distances between any two out of the $2n+1$ points. What is the smallest size of this set? [i]Radu Bumbăcea[/i]

A circle is divided into $n$ sectors. Pawns stand on some of the sectors; the total number of pawns equals $n + 1$. This configuration is changed as follows. Any two of the pawns standing on the same sector move simultaneously to the neighbouring sectors in different directions. Prove that after several such transformations a configuration in which no less than half of the sectors are occupied by pawns, will inevitably appear. (D. Fomin, St Petersburg)

Six ducklings swim on the surface of a pond, which is in the shape of a circle with radius $5$ m. Show that at every moment, two of the ducklings swim on the distance of at most $5$ m from each other.

A convex$N-$gon with equal sides is located inside a circle. Each side is extended in both directions up to the intersection with the circle so that it contains two new segments outside the polygon. Prove that one can paint some of these new $2N$ segments in red and the rest in blue so that the sum of lengths of all the red segments would be the same as for the blue ones. [i]($8$ points)[/i]

Let $p\ge 17$ be a prime. Prove that $t=3$ is the largest positive integer which satisfies the following condition: For any integers $a,b,c,d$ such that $abc$ is not divisible by $p$ and $(a+b+c)$ is divisible by $p$, there exists integers $x,y,z$ belonging to the set $\{0,1,2,\ldots , \left\lfloor \frac{p}{t} \right\rfloor - 1\}$ such that $ax+by+cz+d$ is divisible by $p$.

Let $\mathcal{S}$ be a finite set of at least two points in the plane. Assume that no three points of $\mathcal S$ are collinear. A [i]windmill[/i] is a process that starts with a line $\ell$ going through a single point $P \in \mathcal S$. The line rotates clockwise about the [i]pivot[/i] $P$ until the first time that the line meets some other point belonging to $\mathcal S$. This point, $Q$, takes over as the new pivot, and the line now rotates clockwise about $Q$, until it next meets a point of $\mathcal S$. This process continues indefinitely. Show that we can choose a point $P$ in $\mathcal S$ and a line $\ell$ going through $P$ such that the resulting windmill uses each point of $\mathcal S$ as a pivot infinitely many times. [i]Proposed by Geoffrey Smith, United Kingdom[/i]

Six straight lines are drawn on the plane. It is known that for any three of them there is a fourth of the same set of lines, such that all four will touch some circle. Do all six lines necessarily touch the same circle? (I. Bogdanov)

A set of points in the plane is called [i]free [/i] if no three points of the set are the vertices of an equilateral triangle. Prove that any set of $n$ points in the plane has a free subset of at least $\sqrt{n}$ points

For a natural number $n \ge 3$, we draw $n - 3$ internal diagonals in a non self-intersecting, but not necessarily convex, n-gon, cutting the $n$-gon into $n - 2$ triangles. It is known that the value (in degrees) of any angle in any of these triangles is a natural number and no two of these angle values are equal. What is the largest possible value of $n$?

There is a board with $n$ rows and $4$ columns, and white, yellow and light blue chips. Player $A$ places four tokens on the first row of the board and covers them so Player $B$ doesn't know them. How should player $B$ do to fill the minimum number of rows with chips that will ensure that in any of the rows he will have at least three hits? Clarification: A hit by player $B$ occurs when he places a token of the same color and in the same column as $A$.

One tiles a floor of $a \times b$ dm$^2$ with square tiles, $a,b \in N$. Tiles do not overlap, and sides of floor and tiles are parallel. Using tiles of $2\times 2$ dm$^2$ leaves the same amount of floor uncovered as using tiles of $4\times 4$ dm$^2$. Using $3\times 3$ dm$^2$ tiles leaves $29$ dm$^2$ floor uncovered. Determine $a$ and $b$.

Three convex polygons are given on a plane. Prove that there is no line cutting all the polygons if and only if each of the polygons can be separated from the other two by a line.

$N$ lines are drawn on the plane that divide it into a certain number for finite and endless parts. For which number of straight lines $n$ can there be more finite than infinite among the resulting level parts?

Find all natural numbers $n$ for which there exists set $S$ consisting of $n$ points in the plane, satisfying the condition: For each point $A \in S$ there exist at least three points say $X, Y, Z$ from $S$ such that the segments $AX, AY$ and$ AZ$ have length $1$ (it means that $AX = AY = AZ = 1$).

Someone draws at least three lines on paper. Each cuts the other lines two by two. No three lines pass through one point. He chooses a line and counts the intersection points on either side of the line. The numbers of intersections turn out to be the same. He chooses another line. Now the intersections number on one side appears to be six times as large as that on the other side. What is the minimum number of lines where this is possible? [hide=original wording of second sentence]De lijnen snijden elkaar twee aan twee.[/hide]

Each point in the plane with integer coordinates is colored red or blue such that the following two properties hold. For any two red points, the line segment joining them does not contain any blue points. For any two blue points that are distance $2$ apart, the midpoint of the line segment joining them is blue. Prove that if three red points are the vertices of a triangle, then the interior of the triangle does not contain any blue points.

A regular $2017$-gon is partitioned into triangles by a set of non-intersecting diagonals. Prove that among those triangles only one is acute-angled.

Is it possible to use $2 \times 1$ dominoes to cover a $2k \times 2k$ checkerboard which has $2$ squares, one of each colour, removed ?

$16$ pieces of the shape $1\times 3$ are placed on a $7\times 7$ chessboard, each of which is exactly three fields. One field remains free. Find all possible positions of this field.

$3n$ points are given ($n\ge 1$) in the plane, each $3$ of them are not collinear. Prove that there are $n$ distinct triangles with the vertices those points.

Anton the ant takes a walk along the vertices of a cube. He starts at a vertex and stops when it reaches this point again. Between two vertices it moves over an edge, a side face diagonal or a space diagonal. During the rout it visits each of the other vertices exactly [i]once [/i] and nowhere intersects its road already traveled. (a) Show that Anton walks along at least one edge. (b) Show that Anton walks along at least two edges.

Prove that from any finite set of points on the plane, you can remove a point from the bottom in such a way that the remaining set can be split into two parts of smaller diameter. (Diameter is the maximum distance between points of the set.) [hide=original wording]Докажите, что из любого конечного множества точек на плоскости можно так удалитьо дну точку, что оставшееся множество можно разбить на две части меньшего диаметра. (Диаметр—это максимальное расстояние между точками множества.)[/hide]

$n$ red and $n$ blue points on a plane are given so that no three of the $2n$ points are collinear. Prove that it is always possible to split up the points into $n$ pairs, with one red and one blue point in each pair, so that no two of the $n$ line segments which connect the two members of a pair intersect.