On the plane are given unit vectors $\overrightarrow{a_1},\overrightarrow{a_2},\overrightarrow{a_3}$. Show that one can choose numbers $c_1,c_2,c_3 \in \{-1,1\}$ such that the length of the vector $c_1\overrightarrow{a_1}+c_2\overrightarrow{a_2}+c_3\overrightarrow{a_3}$ is at least $2$.

Let $k$ be a positive integer. Find all positive integers $n$, such that it is possible to mark $n$ points on the sides of a triangle (different from its vertices) and connect some of them with a line in such a way that the following conditions are satisfied: 1) there is at least $1$ marked point on each side, 2) for each pair of points $X$ and $Y$ marked on different sides, on the third side there exist exactly $k$ marked points which are connected to both $X$ and $Y$ and exactly k points which are connected to neither $X$ nor $Y$

In a plane a set of $n\geq 3$ points is given. Each pair of points is connected by a segment. Let $d$ be the length of the longest of these segments. We define a diameter of the set to be any connecting segment of length $d$. Prove that the number of diameters of the given set is at most $n$.

Five points are selected on the plane so that no three of them lie on one straight line. Prove that some four of these five points are the vertices of a convex quadrilateral.

For what values of $n$ is it possible to paint the edges of a prism whose base is an $n$-gon so that there are edges of all three colours at each vertex and all the faces (including the upper and lower bases) have edges of all three colours? (AV Shapovelov)

We will say that a set $ A $ of points is [i]disastrous [/i] if it meets the following conditions: $\bullet$ There are no $ 3 $ collinear points $\bullet$ There is not a trio of mutually equal distances between points. If $ P $ and $ Q $ are points in $ A $, then there are $ M $, $ N $, $ R $ and $ T $ in $ A $ such that: $$ d (P, Q) = \frac {d (M, N) + d (R, T)} {2} $$ Show that all disastrous sets are infinite. [hide=original wording of second condition]No existe ni un trío de distancias entre puntos mutuamente iguales. [/hide]

A cube of edge length $3$ consists of $27$ unit cubes. Find the number of lines passing through exactly three centers of these $27$ cubes, as well as the number of those passing through exactly two such centers.

Cut off a square carton by a straight line into two pieces, then cut one of two pieces into two small pieces by a straight line, ect. By cutting $2017$ times we obtain $2018$ pieces. We write number $2$ in every triangle, number 1 in every quadrilateral, and $0$ in the polygons. Is the sum of all inserted numbers always greater than $2017$?

Let $n\geq3$ be a positive integer. Let $C_1,C_2,C_3,\ldots,C_n$ be unit circles in the plane, with centres $O_1,O_2,O_3,\ldots,O_n$ respectively. If no line meets more than two of the circles, prove that \[ \sum\limits^{}_{1\leq i<j\leq n}{1\over O_iO_j}\leq{(n-1)\pi\over 4}. \]

Find all possible numbers of lines in a plane which intersect in exactly $37$ points.

A square is divided into $25$ small squares. We draw diagonals of some of the small squares so that no two diagonals share a common point (not even a common endpoint). What is the largest possible number of diagonals that we can draw? (I Rubanov)

How many diagonals does $11$-sided convex polygon have?

Let $ D$ be a convex subset of the $ n$-dimensional space, and suppose that $ D'$ is obtained from $ D$ by applying a positive central dilatation and then a translation. Suppose also that the sum of the volumes of $ D$ and $ D'$ is $ 1$, and $ D \cap D'\not\equal{} \emptyset .$ Determine the supremum of the volume of the convex hull of $ D \cup D'$ taken for all such pairs of sets $ D,D'$. [i]L. Fejes-Toth, E. Makai[/i]

There is a board with $2010$ rows and $2001$ columns, on it there is a token located in the upper left box that can perform one of the following operations: (A) Walk 3 steps horizontally or vertically. (B) Walk 2 steps to the right and 3 steps down. (C) Walk 2 steps to the left and 2 steps up. With the condition that immediately after carrying out an operation on (B) or (C) it is mandatory to take a step to the right before perform the following operation. It is possible to exit the board, so count the number of steps necessary, entering through the other end of the row or column from which it exits, as if the board outside circular (example: from the beginning you can walk to the square located in row $1$ and column $1999$). Will it be possible that after $2011$ operations allowed the checker to land exactly on the bottom square right?

Suppose that every point in the plane is coloured either black or white. Must there be an equilateral triangle such that all of its vertices are the same colour?

In a game, the first player paints a point on the plane red; the second player paints 10 uncoloured points on the plane green; then the first player paints an uncoloured point on the plane red; the second player paints 10 uncoloured points on the plane green; and so on. The first player wins if there are three red points which form an equilateral triangle. Can the second player prevent the first player from winning? (A Kanel)

Let $M$ be a set of 999 points in the plane with the property: For any 3 distinct points in $M$ we can choose two of them, such that the distance between them is less than $1$. a)Prove that there exists a disc of radius not greater than 1 that covers at least 500 points in $M$. b)Is it true that there always exists a disc of radius not greater than 1 that covers at least 501 points in $M$?

At what $n$ can a regular $n$-gon be cut by disjoint diagonals into $n- 2$ isosceles (including equilateral) triangles?

Given a square with side $10$. Cut it into $100$ congruent quadrilaterals such that each of them is inscribed into a circle with diameter $\sqrt{3}$. [i](5 points)[/i] [i]Ilya Bogdanov[/i]

A set of identical square tiles with side length $1$ is placed on a (very large) floor. Every tile after the first shares an entire edge with at least one tile that has already been placed. - What is the largest possible perimeter for a figure made of $10$ tiles? - What is the smallest possible perimeter for a figure made of $10$ tiles? - What is the largest possible perimeter for a figure made of $2011$ tiles? - What is the smallest possible perimeter for a figure made of $2011$ tiles? Prove that your answers are correct.

On the plane are chosen six points. Prove that the ratio of the longest distance between two points to the shortest is at least $\sqrt3$.

It is known that a regular dodecahedron is a regular polyhedron with $12$ faces of equal pentagons and concurring $3$ edges in each vertex. It is requested to calculate, reasonably, a) the number of vertices, b) the number of edges, c) the number of diagonals of all faces, d) the number of line segments determined for every two vertices, d) the number of diagonals of the dodecahedron.

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.

A finite collection of digits $0$ and $1$ is written around a circle. An [i]arc[/i] of length $L\ge 0$ consists of $L$ consecutive digits around the circle. For each arc $w,$ let $Z(w)$ and $N(w)$ denote the number of $0$'s in $w$ and the number of $1$'s in $w,$ respectively. Assume that $|Z(w)-Z(w')|\le 1$ for any two arcs $w,w'$ of the same length. Suppose that some arcs $w_1,\dots,w_k$ have the property that \[Z=\frac1k\sum_{j=1}^kZ(w_j)\text{ and }N=\frac1k\sum_{j=1}^k N(w_j)\] are both integers. Prove that there exists an arc $w$ with $Z(w)=Z$ and $N(w)=N.$

There are $n$ rectangles drawn on the rectangular sheet of paper with the sides of the rectangles parallel to the sheet sides. The rectangles do not have pairwise common interior points. Prove that after cutting out the rectangles the sheet will split into not more than $n+1$ part.