For which integers $n \ge 5$ is it possible to color the vertices of a regular$ n$-gon using at most $6$ colors in such a way that any $5$ consecutive vertices have different colors?

A regular $2017$-gon is partitioned into triangles by a set of non-intersecting diagonals. Prove that among those triangles only one is acute-angled.

Point $X$ is taken inside a regular $n$-gon of side length $a$. Let $h_1,h_2,...,h_n$ be the distances from $X$ to the lines defined by the sides of the $n$-gon. Prove that $\frac{1}{h_1}+\frac{1}{h_2}+...+\frac{1}{h_n}>\frac{2\pi}{a}$

From the vertices of a regular 27-gon, seven are chosen arbitrarily. Prove that among these seven points there are three points that form an isosceles triangle or four points that form an isosceles trapezoid.

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$.

In a circle with radius 1 a regular n-gon $A_1 A_2...A_n$ is inscribed. Calculate the product: $A_1 A_2.A_1 A_3 \dots A_1 A_{n-1} .A_1 A_n$.

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.

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 $n$-gon has $135$ diagonals. What is the measure of its exterior angle, in degrees? (An exterior angle is the supplement of an interior angle.)

A regular pentagon is constructed externally on each side of a regular pentagon of side $1$. The figure is then folded and the two edges of the external pentagons meeting at each vertex of the original pentagon are glued together. Find the volume of water that can be poured into the obtained container.

Gabriel plays to draw triangles using the vertices of a regular polygon with $2019$ sides, following these rules: (i) The vertices used by each triangle must not have been previously used. (ii) The sides of the triangle to be drawn must not intersect with the sides of the triangles previously drawn. If Gabriel continues to draw triangles until it is no longer possible, determine the minimum number of triangles that he drew.

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)

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.

$Abdulqodir$ cut out $2024$ congruent regular $n-$gons from a sheet of paper and placed these $n-$gons on the table such that some parts of each of these $n-$gons may be covered by others. We say that a vertex of one of the afore-mentioned $n-$gons is $visible$ if it is not in the interior of another $n-$gon that is placed on top of it. For any $n>2$ determine the minimum possible number of visible vertices. \\ Proposed by David Hrushka, Slovakia

A regular heptagon $A_1A_2... A_7$ is inscribed in circle $C$. Point $P$ is taken on the shorter arc $A_7A_1$. Prove that $PA_1+PA_3+PA_5+PA_7 = PA_2+PA_4+PA_6$.

a) Prove that for $n = 2,3,4,...$ holds: $$\sin a + \sin 2a + ...+ \sin (n-1)a=\frac{\cos a \left(\frac{a}{2}\right) - \cos \left(n-\frac{1}{2}\right) a}{2 \sin \left(\frac{a}{2}\right)}$$ b) A point on the circumference of a wheel, which, remaining in a vertical plane, rolls along a horizontal path, describes, at one revolution of the wheel, a curve having a length equal to four times the diameter of the wheel. Prove this by first considering tilting a regular $n$-gon. [hide=original wording for part b]Een punt van de omtrek van een wiel dat, in een verticaal vlak blijvend, rolt over een horizontaal gedachte weg, beschrijft bij één omwenteling van het wiel een kromme die een lengte heeft die gelijk is aan viermaal de middellijn van het wiel. Bewijs dit door eerst een rondkantelende regelmatige n-hoek te beschouwen.[/hide]

Given a regular polygon with apothem $ A $ and circumradius $ R $. Find for a regular polygon of equal perimeter and with double number of sides, the apothem $ a $ and the circumcircle $ r $ in terms of $A,R$

The vertices of a regular $2n$-gon ($n \ge 3$) are labelled with the numbers $1,2,...,2n$ so that the sum of the numbers at any two adjacent vertices equals the sum of the numbers at the vertices diametrically opposite to them. Show that this is only possible if $n$ is odd.

$A, B, C, D$ are consecutive vertices of a regular $7$-gon. $AL$ and $AM$ are tangents to the circle center $C$ radius $CB$. $N$ is the intersection point of $AC$ and $BD$. Show that $L, M, N$ are collinear.

Let $n$ be a positive integer. Prove that in a regular $6n$-gon, we can draw $3n$ diagonals with pairwise distinct ends and partition the drawn diagonals into $n$ triplets so that: [list] [*] the diagonals in each triplet intersect in one interior point of the polygon and [*] all these $n$ intersection points are distinct. [/list]

Given is a regular $n$-gon with circumradius $1$. $L$ is the set of (different) lengths of all connecting segments of its endpoints. What is the sum of the squares of the elements of $L$?

$A, B, C$ are adjacent vertices of a regular $2n$-gon and $D$ is the vertex opposite to $B$ (so that $BD$ passes through the center of the $2n$-gon). $X$ is a point on the side $AB$ and $Y$ is a point on the side $BC$ so that $XDY = \frac{\pi}{2n}$. Show that $DY$ bisects $\angle XYC$.

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$.

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

The sides of a convex regular polygon of $L + M + N$ sides are to be given draw in three colors: $L$ of them with a red stroke, $M$ with a yellow stroke, and $N$ with a blue. Express, through inequalities, the necessary and sufficient conditions so that there is a solution (several, in general) to the problem of doing it without leaving two adjacent sides drawn with the same color.