Školjka

%V0 $(BUL 5)$ Let $Z$ be a set of points in the plane. Suppose that there exists a pair of points that cannot be joined by a polygonal line not passing through any point of $Z.$ Let us call such a pair of points unjoinable. Prove that for each real $r > 0$ there exists an unjoinable pair of points separated by distance $r.$

%V0 $(FRA 3)$ A polygon (not necessarily convex) with vertices in the lattice points of a rectangular grid is given. The area of the polygon is $S.$ If $I$ is the number of lattice points that are strictly in the interior of the polygon and B the number of lattice points on the border of the polygon, find the number $T = 2S- B -2I + 2.$

%V0 Prove that a regular polygon with an odd number of edges cannot be partitioned into four pieces with equal areas by two lines that pass through the center of polygon.

%V0 Prove that in the Euclidean plane every regular polygon having an even number of sides can be dissected into lozenges. (A lozenge is a quadrilateral whose four sides are all of equal length).

%V0 Prove that a convex pentagon (a five-sided polygon) $ABCDE$ with equal sides and for which the interior angles satisfy the condition $\angle A \geq \angle B \geq \angle C \geq \angle D \geq \angle E$ is a regular pentagon.

%V0 Let $A$ be a set of $n$ points in 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.