Let $n$ be a natural number greater than 2. $l$ is a line on a plane. There are $n$ distinct points $P_1$, $P_2$, …, $P_n$ on $l$. Let the product of distances between $P_i$ and the other $n-1$ points be $d_i$ ($i = 1, 2,$ …, $n$). There exists a point $Q$, which does not lie on $l$, on the plane. Let the distance from $Q$ to $P_i$ be $C_i$ ($i = 1, 2,$ …, $n$). Find $S_n = \sum_{i = 1}^{n} (-1)^{n-i} \frac{c_i^2}{d_i}$.

A side of an arbitrary triangle has a length greater than $1$. Prove that the given triangle it can be cut into at least $2$ triangles, so that each of them has a side of length equal to $1$.

The radius $OM$ of a circle rotates uniformly at a rate of $360/n$ degrees per second , where $n$ is a positive integer . The initial radius is $OM_0$. After $1$ second the radius is $OM_1$ , after two more seconds (i.e. after three seconds altogether) the radius is $OM_2$ , after $3$ more seconds (after $6$ seconds altogether) the radius is $OM_3$, ..., after $n - 1$ more seconds its position is $OM_{n-1}$. For which values of $n$ do the points $M_0, M_1 , ..., M_{n-1}$ divide the circle into $n$ equal arcs? (a) Is it true that the powers of $2$ are such values? (b) Does there exist such a value which is not a power of $2$? (V. V. Proizvolov , Moscow)

Given a convex pentagon $ABCDE$, prove that if an arbitrary point $M$ inside the pentagon is connected by lines with all the pentagon’s vertices, then either one or three or five of these lines cross the sides of the pentagon opposite the vertices they pass. Note: In reality, we need to exclude the points of the diagonals, because that in this case the drawn lines can pass not through the internal points of the sides, but through the vertices. But if the drawn diagonals are not considered or counted twice (because they are drawn from two vertices), then the statement remains true.

The plane is divided by three infinite sets of parallel lines into equilateral triangles of equal area. Let $M$ be the set of their vertices, and $A$ and $B$ be two vertices of such an equilateral triangle. One may rotate the plane through $120^o$ around any vertex of the set $M$. Is it possible to move the point $A$ to the point $B$ by a number of such rotations (N Vasiliev, Moscow)

Let $A$ be a set of $n$ points in the space. From the family of all segments with endpoints in $A$, $q$ segments have been selected and colored yellow. Suppose that all yellow segments are of different length. Prove that there exists a polygonal line composed of $m$ yellow segments, where $m \geq \frac{2q}{n}$, arranged in order of increasing length.

Anton has an isosceles right triangle, which he wants to cut into $9$ triangular parts in the way shown in the picture. What is the largest number of the resulting $9$ parts that can be equilateral triangles? A more formal description of partitioning. Let triangle $ABC$ be given. We choose two points on its sides so that they go in the order $AC_1C_2BA_1A_2CB_1B_2$, and no two coincide. In addition, the segments $C_1A_2$, $A_1B_2$ and $B_1C_2$ must intersect at one point. Then the partition is given by segments $C_1A_2$, $A_1B_2$, $B_1C_2$, $A_1C_2$, $B_1A_2$ and $C_1B_2$. [img]https://cdn.artofproblemsolving.com/attachments/0/5/5dd914b987983216342e23460954d46755d351.png[/img]

An equilateral triangle $ABC$ has sides of length $n$, a positive integer. Divide the triangle into equilateral triangles of length $ 1$, drawing parallel lines (at distance $ 1$) to all sides of the triangle. A path is a continuous path, starting at the triangle with vertex $A$ and always crossing from one small triangle to another on the side that both triangles share, in such a way that it never passes through a small triangle twice. Find the maximum number of triangles that can be visited.

In Cartesian space, let $\Omega = \{(a, b, c) : a, b, c$ are integers between $1$ and $30\}$. A point of $\Omega$ is said to be [i]visible [/i] from the origin if the segment that joins said point with the origin does not contain any other elements of $\Omega$. Find the number of points of $\Omega$ that are [i]visible [/i] from the origin.

We have finite white and finite black points that for each 4 oints there is a line that white points and black points are at different sides of this line.Prove there is a line that all white points and black points are at different side of this line.

Let $C$ be a unit circle and $n \ge 1$ be a fixed integer. For any set $A$ of $n$ points $P_1,..., P_n$ on $C$ define $D(A) = \underset{d}{max}\, \underset{i}{min}\delta (P_i, d)$, where $d$ goes over all diameters of $C$ and $\delta (P, \ell)$ denotes the distance from point $P$ to line $\ell$. Let $F_n$ be the family of all such sets $A$. Determine $D_n = \underset{A\in F_n}{min} D(A)$ and describe all sets $A$ with $D(A) = D_n$.

Can $77$ blocks each $3 \times 3 \times1$ be assembled to form a $7 \times 9 \times 11$ block?

A circle of perimeter $1$ has been dissected into four equal arcs $B_1, B_2, B_3, B_4$. A closed smooth non-selfintersecting curve $C$ has been composed of translates of these arcs (each $B_j$ possibly occurring several times). Prove that the length of $C$ is an integer.

A regular hexagon is cut up into $N$ parallelograms of equal area. Prove that $N$ is divisible by three. (V. Prasolov, I. Sharygin, Moscow)

Fix a positive integer $n.{}$ Consider an $n{}$-point set $S{}$ in the plane. An [i]eligible[/i] set is a non-empty set of the form $S\cap D,{}$ where $D$ is a closed disk in the plane. In terms of $n,$ determine the smallest possible number of eligible subsets $S{}$ may contain. [i]Proposed by Cristi Săvescu[/i]

Anna and Brian play a game where they put the domino tiles (of size $2 \times 1$) in a boards composed of $n \times 1$ boxes. Tiles must be placed so that they cover exactly two boxes. Players take turnslaying each tile and the one laying last tile wins. They play once for each $n$, where $n = 2, 3,\dots,2007$. Show that Anna wins at least $1505$ of the games if she always starts first and they both always play optimally, ie if they do their best to win in every move.

A finite set $M$ of unit squares on the plane is considered. The sides of the squares are parallel to the coordinate axes and the squares are allowed to intersect. It is known that the distance between the centres of any pair of squares is no greater than $2$. Prove that there exists a unit square (not necessarily belonging to $M$) with sides parallel to the coordinate axes and which has at least one common point with each of the squares in $M$. (A Andjans, Riga)

A square is subdivided into $K^2$ equal smaller squares. We are given a broken line which passes through the centres of all the smaller squares (such a broken line may intersect itself). Find the minimum number of links in this broken line. (A Andjans, Riga)

Consider an equilateral triangle with every side divided by $n$ points into $n+1$ equal parts. We put a marker on every of the $3n$ division points. We draw lines parallel to the sides of the triangle through the division points, and this way divide the triangle into $(n+1)^2$ smaller ones. Consider the following game: if there is a small triangle with exactly one vertex unoccupied, we put a marker on it and simultaneously take markers from the two its occupied vertices. We repeat this operation as long as it is possible. (a) If $n\equiv1\pmod3$, show that we cannot manage that only one marker remains. (b) If $n\equiv0$ or $n\equiv2\pmod3$, prove that we can finish the game leaving exactly one marker on the triangle.

Call a convex polyhedron a [i]footballoid [/i] if it has the following properties. (1) Any face is either a regular pentagon or a regular hexagon. (2) All neighbours of a pentagonal face are hexagonal (a [i]neighbour [/i] of a face is a face that has a common edge with it). Find all possibilities for the number of pentagonal and hexagonal faces of a footballoid.

Given $100$ coplanar points, no three collinear, prove that at most $70\%$ of the triangles formed by the points have all angles acute.

Is it possible to divide a $6 \times 6$ chessboard into $18$ rectangles, each either $1 \times 2$ or $2 \times 1$, and to draw exactly one diagonal on each rectangle such that no two of these diagonals have a common endpoint? (A Shapovalov)

The points of space are painted in two colors. Prove that there is a tetrahedron such that all its vertices and its centroid are of the same color.

Finitely many points are given on the surface of a sphere, such that every four of them lie on the surface of open hemisphere. Prove that all points lie on the surface of an open hemisphere.

Determine all natural numbers $n$ for which it is possible to construct a rectangle of sides $15$ and $n$, with pieces congruent to: [asy] unitsize(0.6 cm); draw((0,0)--(3,0)); draw((0,1)--(3,1)); draw((0,2)--(1,2)); draw((2,2)--(3,2)); draw((0,0)--(0,2)); draw((1,0)--(1,2)); draw((2,0)--(2,2)); draw((3,0)--(3,2)); draw((5,-0.5)--(6,-0.5)); draw((4,0.5)--(7,0.5)); draw((4,1.5)--(7,1.5)); draw((5,2.5)--(6,2.5)); draw((4,0.5)--(4,1.5)); draw((5,-0.5)--(5,2.5)); draw((6,-0.5)--(6,2.5)); draw((7,0.5)--(7,1.5)); [/asy] The squares of the pieces have side $1$ and the pieces cannot overlap or leave free spaces