Is there a $1987$-gon with consecutive sides lengths $1, 2, 3,..., 1986, 1987$, in which you can fit a circle?

Which is the least positive integer $n$ for which it is possible to find a (non-degenerate) $n$-gon with sidelengths $1, 2,. . . , n$, and where all vertices have integer coordinates?

Each vertex of a right $n$-gon $(n\geq 3)$ is colored in yellow, blue or red. On each turn are chosen two adjacent vertices in different color and then are recolored in the third. For which $n$ can we get from an arbitrary coloring of the $n$-gon a monochromatic one (in one color)?

Let $P$ be a polygon that is convex and symmetric to some point $O$. Prove that for some parallelogram $R$ satisfying $P\subset R$ we have \[\frac{|R|}{|P|}\leq \sqrt 2\] where $|R|$ and $|P|$ denote the area of the sets $R$ and $P$, respectively. [i]Proposed by Witold Szczechla, Poland[/i]

Which of the following statements are true? (a) If a polygon can be divided into two congruent polygons by a broken line segment, it can be divided into two congruent polygons by a straight line segment. (b) If a convex polygon can be divided into two congruent polygons by a broken line segment, it can be so divided by a straight line segment. (c) If a convex polygon can be divided into two polygons by a broken line segment, one of which can be mapped onto the other by a combination of rotations and translations, it can be so divided by a straight line segment. (S Markelov,)

Given a positive integer $n$, does there exist a planar polygon and a point in its plane such that every line through that point meets the boundary of the polygon at exactly $2n$ points?

Twelve 1-Euro-coins are laid flat on a table, such that their midpoints form a regular $12$-gon. Adjacent coins are tangent to each other. Prove that it is possible to put another seven such coins into the interior of the ring of the twelve coins.

Let $S$ be a square with sides length $100$. Let $L$ be a path within $S$ which does not meet itself and which is composed of line segments $A_0A_1,A_1A_2,A_2A_3,\ldots,A_{n-1}A_n$ with $A_0=A_n$. Suppose that for every point $P$ on the boundary of $S$ there is a point of $L$ at a distance from $P$ no greater than $\frac {1} {2}$. Prove that there are two points $X$ and $Y$ of $L$ such that the distance between $X$ and $Y$ is not greater than $1$ and the length of the part of $L$ which lies between $X$ and $Y$ is not smaller than $198$.

Given a regular $n$-gon $A_{1}A_{2}...A_{n}$ (with $n\geq 3$) in a plane. How many triangles of the kind $A_{i}A_{j}A_{k}$ are obtuse ?

Show that in the plane there exists a convex polygon of 1992 sides satisfying the following conditions: [i](i)[/i] its side lengths are $ 1, 2, 3, \ldots, 1992$ in some order; [i](ii)[/i] the polygon is circumscribable about a circle. [i]Alternative formulation:[/i] Does there exist a 1992-gon with side lengths $ 1, 2, 3, \ldots, 1992$ circumscribed about a circle? Answer the same question for a 1990-gon.

We have two concentric circles. A polygon is circumscribed around the smaller circle and is contained entirely inside the greater circle. Perpendiculars from the common center of the circles to the sides of the polygon are extended till they intersect the greater circle. Each of the points obtained is connected with the endpoints of the corresponding side of the polygon . When is the resulting star-shaped polygon the unfolding of a pyramid?

Is there a planar polygon whose vertices have integer coordinates and whose area is $1/2$, such that this polygon is (a) a triangle with at least two sides longer than $1000$? (b) a triangle whose sides are all longer than $1000$? (c) a quadrangle?

The figure shows an arbitrary (green) triangle in the center. White squares were built on its sides to the outside. Some of their vertices were connected by segments, white squares were built on them again to the outside, and so on. In the spaces between the squares, triangles and quadrilaterals were formed, which were painted in different colors. Prove that [list=a] [*]all colored quadrilaterals are trapezoids; [*]the areas of all polygons of the same color are equal; [*]the ratios of the bases of one-color trapezoids are equal; [*]if $S_0=1$ is the area of the original triangle, and $S_i$ is the area of the colored polygons at the $i^{\text{th}}$ step, then $S_1=1$, $S_2=5$ and for $n\geqslant 3$ the equality $S_n=5S_{n-1}-S_{n-2}$ is satisfied. [/list] [i]Proposed by F. Nilov[/i] [center][img width="40"]https://i.ibb.co/n8gt0pV/Screenshot-2023-03-09-174624.png[/img][/center]

A closed recticular polygon with 100 sides (may be concave) is given such that it's vertices have integer coordinates, it's sides are parallel to the axis and all it's sides have odd length. Prove that it's area is odd.

The lengths of the sides of a convex decagon are no greater than 1. Prove that for each inner point $M$ of the decagon there is at least one vertex $A$, for which $MA\leq \frac{\sqrt{5}+1}{2}$.

Let $\Omega$ be an $n$-gon inscribed in the unit circle, with vertices $P_1, P_2, ..., P_n$. (a) Show that there exists a point $P$ on the unit circle such that $PP_1 \cdot PP_2\cdot ... \cdot PP_n \ge 2$. (b) Suppose for each $P$ on the unit circle, the inequality $PP_1 \cdot PP_2\cdot ... \cdot PP_n \le 2$ holds. Prove that $\Omega$ is regular.

Let $n$ and $c$ be coprime positive integers. For any integer $i$, denote by $i' $ the remainder of division of product $ci$ by $n$. Let $A_o.A_1,A_2,...,A_{n-1}$ be a regular $n$-gon. Prove that a) if $A_iA_j \parallel A_kA_i$ then $A_{i'}A_{j'} \parallel A_{k'}A_{i'}$ b) if $A_iA_j \perp A_kA_l$ then $A_{i'}A_{j'} \perp A_{k'}A_{l'}$

The circle contains a closed $100$-part broken line, such that no three segments pass through one point. All its corners are obtuse, and their sum in degrees is divided by $720$. Prove that this broken line has an odd number of self-intersection points.

Suppose that we are given an $n$-gon of which all sides have the same length, and of which all the vertices have rational coordinates. Prove that $n$ is even.

Given a regular polygon with $n$ sides. It is known that there are $1200$ ways to choose three of the vertices of the polygon such that they form the vertices of a [b]right triangle[/b]. What is the value of $n$?

Which regular polygon can be obtained (and how) by cutting a cube with a plane ?

A convex $n$-gon $A_0A_1\dots A_{n-1}$ has been partitioned into $n-2$ triangles by certain diagonals not intersecting inside the $n$-gon. Prove that these triangles can be labeled $\triangle_1,\triangle_2,\dots,\triangle_{n-2}$ in such a way that $A_i$ is a vertex of $\triangle_i$, for $i=1,2,\dots,n-2$. Find the number of all such labellings.

A non-convex $n$-gon is cut into three parts by a straight line, and two parts are put together so that the resulting polygon is equal to the third part. Can $n$ be equal to: a) five? b) four?

Let $P$ be a regular $2006$-gon. A diagonal is called [i]good[/i] if its endpoints divide the boundary of $P$ into two parts, each composed of an odd number of sides of $P$. The sides of $P$ are also called [i]good[/i]. Suppose $P$ has been dissected into triangles by $2003$ diagonals, no two of which have a common point in the interior of $P$. Find the maximum number of isosceles triangles having two good sides that could appear in such a configuration.

Given is a convex polygon $ P$ with $ n$ vertices. Triangle whose vertices lie on vertices of $ P$ is called [i]good [/i] if all its sides are unit length. Prove that there are at most $ \frac {2n}{3}$ [i]good[/i] triangles. [i]Author: Vyacheslav Yasinskiy, Ukraine[/i]