Is it possible to dissect a regular decagon along some of its diagonals so that the resulting parts can form two regular polygons? by N.Beluhov

Let $P$ a convex regular polygon with $n$ sides, having the center $O$ and $\angle xOy$ an angle of measure $a$, $a \in (0,k)$. Let $S$ be the area of the common part of the interiors of the polygon and the angle. Find, as a function of $n$, the values of $a$ such that $S$ remains constant when $\angle xOy$ is rotating around $O$.

Find all positive integers $n$ for which it is possible to partition a regular $n$-gon into triangles with diagonals not intersecting inside the $n$-gon such that at every vertex of the $n$-gon an odd number of triangles meet.

What is the largest integer $n$ such that one can find $n$ points on the surface of a cube, not all lying on one face and being the vertices of a regular $n$-gon? (A Shapovalov)

A circle centered at point $O$ is separated by points $A_1,A_2,...,A_n$ on $n$ equal parts (points are listed sequentially clockwise) and the rays $OA_1,OA_2,...,OA_n$ are constructed. The angle $A_2OA_3$ is divided by rays into two equal angles at vertex $O$, the angle $A_3OA_4$ is divided into three equal angles, and so on, finally, the angle $A_nOA_1$ divided into $n$ equal angles at vertex $O$. A point belonging to the ray other than $OA_1$, is connected by a segment with its orthogonal projection $B_0$ on the neighboring (clockwise) arrow) with ray $OA_1$, point$ B_1$ is connected by a segment with its orthogonal projection on the next (clockwise) ray, etc. As a result of such process it turns out the broken line $B_0B_1B_2B_3...$ infinitely "twists". Consider the question of giving the thus obtained broken numerical value of "length" $L (n)$ and explore the value of $L(n)$ depending on $n$.

To each side of the regular $p$-gon of side length $1$ there is attached a $1 \times k$ rectangle, partitioned into $k$ unit cells, where $k$ and $p$ are given positive integers and p an odd prime. Let $P$ be the resulting nonconvex star-like polygonal figure consisting of $kp + 1$ regions ($kp$ unit cells and the $p$-gon). Each region is to be colored in one of three colors, adjacent regions having different colors. Furthermore, it is required that the colored figure should not have a symmetry axis. In how many ways can this be done?

$k$ vertices of a regular $n$-gon $P$ are coloured. A colouring is called almost uniform if for every positive integer $m$ the following condition is satisfied: If $M_1$ is a set of m consecutive vertices of $P$ and $M_2$ is another such set then the number of coloured vertices of $M_1$ differs from the number of coloured vertices of $M_2$ at most by $1$. Prove that for all positive integers $k$ and $n$ ($k \le n$) an almost uniform colouring exists and that it is unique within a rotation. (M Kontsevich, Moscow)

We consider the $n$ vertices of a regular polygon with $n$ sides. There is a set of triangles with vertices at these $n$ points with the property that for each triangle in the set, the sides of at least one are not the side of any other triangle in the set. What is the largest amount of triangles that can have the set? [hide=original wording]Consideramos los n vértices de un polígono regular de n lados. Se tiene un conjunto de triángulos con vértices en estos n puntos con la propiedad que para cada triángulo del conjunto, al menos uno de sus lados no es lado de ningún otro triángulo del conjunto. ¿Cuál es la mayor cantidad de triángulos que puede tener el conjunto?[/hide]

A regular polygon with $n \ge 3$ sides is given. Each vertex is coloured either red, green or blue, and no two adjacent vertices of the polygon are the same colour. There is at least one vertex of each colour. Prove that it is possible to draw certain diagonals of the polygon in such a way that they intersect only at the vertices of the polygon and they divide the polygon into triangles so that each such triangle has vertices of three different colours.

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

A convex polygon is circumscribed around a circle. Points of contact of its sides with the circle form a polygon with the same set of angles (the order of angles may differ). Is it true that the polygon is regular?

A point is chosen inside a regular $k$-gon in such a way that its orthogonal projections on to the sides all meet the respective sides at interior points. These points divide the sides into $2k$ segments. Let these segments be enumerated consecutively by the numbers $1,2, 3, ... ,2k$. Prove that the sum of the lengths of the segments having even numbers equals the sum of the segments having odd numbers. (A Andjans, Riga)

Let $ABCDEFGHIJ$ be a regular $10$-gon. Let $T$ be a point inside the $10$-gon, such that the $DTE$ is isosceles: $DT = ET$ , and its angle at the apex is $72^\circ$. Prove that there exists a point $S$ such that $FTS$ and $HIS$ are both isosceles, and for both of them the angle at the apex is $72^\circ$.

Given is a regular polygon. Volodya wants to mark $k$ points on its perimeter so that any another regular polygon (maybe having a different number of sides) doesn’t contain all marked points on its perimeter. Find the minimal $k$ sufficient for any given polygon.

Inside the regular $n$ -gon $M$ with side $a$ there are $n$ equal circles so that each touches two adjacent sides of the polygon $M$ and two other circles. Inside the formed "star", which is bounded by arcs, these $n$ equal circles are reconstructed so that each touches the two adjacent circles built in the previous step, and two more newly built circles. This process will take $k$ steps. Find the area $S_n (k)$ of the "star", which is formed in the center of the polygon $M$. Consider the spatial analogue of this problem.