Do there exist convex polyhedra with an arbitrary number of diagonals (a diagonal is a segment joining two vertices of a polyhedron and not lying on the surface of this polyhedron)? (A. Blinkov)

Find all nonconvex quadrilaterals in which the sum of the distances to the lines containing the sides is the same for any interior point. Try to generalize the result in the case of an arbitrary non-convex polygon, polyhedron.

The convex set $F$ does not cover a semi-circle of radius $R$. Is it possible that two sets, congruent to $F$, cover the circle of radius $R$ ? What if $F$ is not convex? ( N . B . Vasiliev , A. G . Samosvat)

Let $P_{1}P_{2}\dots P_{2n}$ be a convex polygon with an even number of corners. Prove that there exists a diagonal $P_{i}P_{j}$ which is not parallel to any side of the polygon.

A convex polygon $P$ is placed inside a unit square $Q$. Prove that the perimeter of $P$ does not exceed $4$.

Let $ABCDEF$ be a convex hexagon with $AB = BC, CD = DE$ and $EF = FA$. Prove that the lines through $C,E,A$ perpendicular to $BD,DF,FB$ are concurrent.

A convex polygon is divided into some triangles. Let $V$ and $E$ be respectively the set of vertices and the set of egdes of all triangles (each vertex in $V$ may be some vertex of the polygon or some point inside the polygon). The polygon is said to be [i]good [/i] if the following conditions hold: i. There are no $3$ vertices in $V$ which are collinear. ii. Each vertex in $V$ belongs to an even number of edges in $E$. Find all good polygon.

(a) The point $O$ lies inside the convex polygon $A_1A_2A_3...A_n$ . Consider all the angles $A_iOA_j$ where $i, j$ are distinct natural numbers from $1$ to $n$ . Prove that at least $n- 1$ of these angles are not acute . (b) Same problem for a convex polyhedron with $n$ vertices. (V. Boltyanskiy, Moscow)

a) Each of the side of the convex hexagon is longer than $1$. Does it necessary have a diagonal longer than $2$? b) Each of the main diagonals of the convex hexagon is longer than $2$. Does it necessary have a side longer than $1$?

Given a finite set $K_0$ of points (in the plane or space). The sequence of sets $K_1, K_2, ... , K_n, ...$ is constructed according to the rule: [i]we take all the points of $K_i$, add all the symmetric points with respect to all its points, and, thus obtain $K_{i+1}$.[/i] a) Let $K_0$ consist of two points $A$ and $B$ with the distance $1$ unit between them. For what $n$ the set $K_n$ contains the point that is $1000$ units far from $A$? b) Let $K_0$ consist of three points that are the vertices of the equilateral triangle with the unit square. Find the area of minimal convex polygon containing $K_n. K_0$ below is the set of the unit volume tetrahedron vertices. c) How many faces contain the minimal convex polyhedron containing $K_1$? d) What is the volume of the above mentioned polyhedron? e) What is the volume of the minimal convex polyhedron containing $K_n$?