Given regular $17$-gon $A_1 ... A_{17}$. Prove that two triangles formed by lines $A_1A_4, A_2A_{10}, A_{13}A_{14}$ and $A_2A_3, A_4A_6 A_{14}A_{15} $ are equal. (N.Beluhov)

Given the circle of radius $1$ and several its chords with the sum of lengths $1$. Prove that one can be inscribe a regular hexagon into that circle so that its sides don’t intersect those chords.

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.

Find all positive integer $n\ge 3$ such that it is possible to mark the vertices of a regular $n$- gon with the number from 1 to n so that for any three vertices $A, B$ and $C$ with $AB = AC$, the number in $A$ is greater or smaller than both numbers in $B, C$.

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)

Find all natural numbers $n$ for which there exists a convex polyhedron satisfying the following conditions: (i) Each face is a regular polygon. (ii) Among the faces, there are polygons with at most two different numbers of edges. (iii) There are two faces with common edge that are both $n$-gons.

Let $S$ be the set of vertices of a regular $24$-gon. Find the number of ways to draw $12$ segments of equal lengths so that each vertex in $S$ is an endpoint of exactly one of the $12$ segments.

Santiago, Daniel and Fátima practice for the Math Olympics. Santiago thinks of a regular polygon and Daniel of another, without telling Fatima what the polygons are. They just tell you that one of the polygons has $3$ more sides than the other and that an angle of one of the polygons measures $10$ degrees more than one angle of the other. From this, and knowing that each interior angle of a regular polygon of $n$ sides measures $\frac{180(n-2)}{n}$ degrees, Fatima identifies what the polygons are. How many sides do the polygons that James and Daniel chose, have?

In the complex plane consider the unit circle with the origin as its center. Furthermore, consider inscribed regular 17-gon with one of its vertices being $1+0i.$ How many of its vertices lie in the (open) unit disc centered in $\sqrt{3/2}(1+i)$?

Let $P$ be a regular polygon with $ 4k + 1 $ sides (where $ k $ is a natural) whose vertices are $ A_1, A_2, ..., A_ {4k + 1} $ (in that order ). Each vertex $ A_j $ of $P$ is assigned a natural of the set $ \{1,2, ..., 4k + 1 \} $ such that no two vertices are assigned the same number. On $P$ the following operation is performed: Let $ B_j $ be the midpoint of the side $ A_jA_ {j + 1} $ for $ j = 1,2, ..., 4k + 1 $ (where is consider $ A_ {4k + 2} = A_1 $). If $ a $, $ b $ are the numbers assigned to $ A_ {j} $ and $ A_ {j + 1} $, respectively, the midpoint $ B_j $ is written the number $ 7a-3b $. By doing this with each of the $ 4k + 1 $ sides, the $ 4k + 1 $ vertices initially arranged are erased. We will say that a natural $ m $ is [i]fatal [/i] if for all natural $ k $ , no matter how the vertices of $P$ are initially arranged, it is impossible to obtain $ 4k + 1 $ equal numbers through a finite amount of operations from $ m $. a) Determine if the $ 2010 $ is fatal or not. Justify. b) Prove that there are infinite fatal numbers. [color=#f00]PS. A help in translation of the 2nd paragraph is welcome[/color]. [hide=Original wording]Diremos que un natural $m$ es fatal si no importa cómo se disponen inicialmente los vértices de ${P}$, es imposible obtener mediante una cantidad finita de operaciones $4k+1$ números iguales a $m$.[/hide]

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) The vertices of a regular $10$-gon are painted in turn black and white. Two people play the following game . Each in turn draws a diagonal connecting two vertices of the same colour . These diagonals must not intersect . The winner is the player who is able to make the last move. Who will win if both players adopt the best strategy? (b) Answer the same question for the regular $12$-gon . (V.G. Ivanov)

Let there be a regular polygon of $n$ sides with center $O$. Determine the highest possible number of vertices $k$ $(k \geq 3)$, which can be coloured in green, such that $O$ is strictly outside of any triangle with $3$ vertices coloured green. Determine this $k$ for $a) n=2019$ ; $b) n=2020$.

Determine all integer $n > 3$ for which a regular $n$-gon can be divided into equal triangles by several (possibly intersecting) diagonals. (B.Frenkin)

Does there exist a convex $N$-gon such that all its sides are equal and all vertices belong to the parabola $y = x^2$ for a) $N = 2011$ b) $N = 2012$ ?

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.

Let $ABCDEFGHI$ be a regular polygon of $9$ sides. The segments $AE$ and $DF$ intersect at $P$. Prove that $PG$ and $AF$ are perpendicular.

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.

Consider a regular $2n + 1$-gon $P$ in the plane, where n is a positive integer. We say that a point $S$ on one of the sides of $P$ can be seen from a point $E$ that is external to $P$, if the line segment $SE$ contains no other points that lie on the sides of $P$ except $S$. We want to color the sides of $P$ in $3$ colors, such that every side is colored in exactly one color, and each color must be used at least once. Moreover, from every point in the plane external to $P$, at most $2$ different colors on $P$ can be seen (ignore the vertices of $P$, we consider them colorless). Find the largest positive integer for which such a coloring is possible.

Each side and diagonal of a regular $n$-gon ($n \ge 3$) for odd $n$ is colored red or blue. One may choose a vertex and change the color of all segments emanating from that vertex. Prove that, no matter how the edges were colored initially, one can achieve that the number of blue segments at each vertex is even. Prove also that the resulting coloring depends only on the initial coloring.

Let $A_1A_2\dots A_{2n}$ be a regular $2n$-gon inscribed in circle $\omega$. Let $P$ be any point on the circle $\omega$. Let $H_1,H_2,\dots, H_n$ be orthocenters of triangles $PA_1A_2, PA_3A_4,\dots, PA_{2n-1}A_{2n}$ respectively. Prove that $H_1H_2\dots H_n$ is a regular $n$-gon.

Points $A_1,A_2,A_3,...,A_{12}$ are the vertices of a regular polygon in that order. The 12 diagonals $A_1A_6,A_2A_7,A_3A_8,...,A_{11}A_4,A_{12}A_5$ are marked, as in the picture below. Let $X$ be some point in the plane. From $X$, we draw perpendicular lines to all 12 marked diagonals. Let $B_1,B_2,B_3,...,B_{12}$ be the feet of the perpendiculars, so that $B_1$ lies on $A_1A_6$, $B_2$ lies on $A_2A_7$ and so on. Evaluate the ratio $\frac{XA_1+XA_2+\dots+XA_{12}}{B_1B_6+B_2B_7+\dots+B_{12}B_5}$. [img]https://i.imgur.com/DUuwFth.png[/img]

For which natural number $n$ is it possible to draw $n$ line segments between vertices of a regular $2n$-gon so that every vertex is an endpoint for exactly one segment and these segments have pairwise different lengths?

(a) A regular $4k$-gon is cut into parallelograms. Prove that among these there are at least $k$ rectangles. (b) Find the total area of the rectangles in (a) if the lengths of the sides of the $4k$-gon equal $a$. (VV Proizvolov, Moscow)

A convex polygon $A_1A_2 . . .A_n$ of $n$ sides and inscribed in a circle, has its sides that satisfy the inequalities $$A_nA_1 > A_1A_2 > A_2A_3 >...> A_{n-1}A_n$$ Show that its interior angles satisfy the inequalities $$\angle A_1 < \angle A_2 < \angle A_3 < ... < \angle A_{n-1}, \angle A_{n-1} > \angle A_n> \angle A_1.$$