Found problems: 200
The angles of a convex $n$-gon are $a,2a, ... ,na$. Find all possible values of $n$ and the corresponding values of $a$.
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.
Let $h_n$ be the apothem (distance from the center to one of the sides) of a regular $n$-gon ($n \geq 3$) inscribed in a circle of radius $r$. Prove the inequality
\[(n + 1)h_n+1 - nh_n > r.\]
Also prove that if $r$ on the right side is replaced with a greater number, the inequality will not remain true for all $n \geq 3.$
Show that any two points lying inside a regular $ n\minus{}$gon $ E$ can be joined by two circular arcs lying inside $ E$ and meeting at an angle of at least $ \left(1 \minus{} \frac{2}{n} \right) \cdot \pi.$
Let a regular $7$-gon $A_0A_1A_2A_3A_4A_5A_6$ be inscribed in a circle. Prove that for any two points $P, Q$ on the arc $A_0A_6$ the following equality holds:
\[\sum_{i=0}^6 (-1)^{i} PA_i = \sum_{i=0}^6 (-1)^{i} QA_i .\]
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]
Which regular polygon can be obtained (and how) by cutting a cube with a plane ?
Suppose that a closed oriented polygonal line $\mathcal{L}$ in the plane does not pass through a point $O$, and is symmetric with respect to $O$. Prove that the winding number of $\mathcal{L}$ around $O$ is odd.
The winding number of $\mathcal{L}$ around $O$ is defined to be the following sum of the oriented angles divided by $2\pi$: $$\deg_O\mathcal{L} := \dfrac{\angle A_1OA_2+\angle A_2OA_3+\dots+\angle A_{n-1}OA_n+\angle A_nOA_1}{2\pi}.$$
In each unit square of an infinite square grid a natural number is written. The polygons of area $n$ with sides going along the gridlines are called [i]admissible[/i], where $n > 2$ is a given natural number. The [i]value [/i] of an admissible polygon is defined as the sum of the numbers inside it. Prove that if the values of any two congruent admissible polygons are equal, then all the numbers written in the unit squares of the grid are equal. (We recall that a symmetric image of polygon $P$ is congruent to $P$.)
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]
The polygon $M{}$ is bicentric. The polygon $P{}$ has vertices at the points of contact of the sides of $M{}$ with the inscribed circle. The polygon $Q{}$ is formed by the external bisectors of the angles of $M{}.$ Prove that $P{}$ and $Q{}$ are homothetic.
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$.
A planar polygon $A_1A_2A_3 . . .A_{n-1}A_n$ ($n > 4$) is made of rigid rods that are connected by hinges. Is it possible to bend the polygon (at hinges only!) into a triangle?
Let $A_1A_2... A_{2n + 1}$ be a convex polygon, $a_1 = A_1A_2$, $a_2 = A_2A_3$, $...$, $a_{2n} = A_{2n}A_{2n + 1}$, $a_{2n + 1} = A_{2n + 1}A_1$. Denote by: $\alpha_i = \angle A_i$, $1 \le i \le 2n + 1$, $\alpha_{k + 2n + 1} = \alpha_k$, $k \ge 1$, $ \beta_i = \alpha_{i + 2} + \alpha_{i + 4} +... + \alpha_{i + 2n}$, $1 \le i \le 2n + 1$. Prove what if
$$\frac{\alpha_1}{\sin \beta_1}=\frac{\alpha_2}{\sin \beta_2}=...=\frac{\alpha_{2n+1}}{\sin \beta_{2n+1}}$$
then a circle can be circumscribed around this polygon.
Does the inverse statement hold a place?
Let $n$ be an integer greater than or equal to $3$, and let $P_n$ be the collection of all planar (simple) $n$-gons no two distinct sides of which are parallel or lie along some line. For each member $P$ of $P_n$, let $f_n(P)$ be the least cardinal a cover of $P$ by triangles formed by lines of support of sides of $P$ may have. Determine the largest value $f_n(P)$ may achieve, as $P$ runs through $P_n$.
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).
Given a pentagon $ABCDE$ with all its interior angles less than $180^\circ$. Prove that if $\angle ABC = \angle ADE$ and $\angle ADB = \angle AEC$, then $\angle BAC = \angle DAE$.
We call a diagonal of a polygon [i]nice[/i], if it is entirely inside the polygon or entirely outside the polygon. Let $P$ be an $n$–gon with no three of its vertices being on the same line. Prove that $P$ has at least $3(n-3)/2$ nice diagonals.
[i]Proposed by Bálint Hujter, Budapest and Gábor Szűcs, Szikszó[/i]
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.
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?
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.
Let $C$ consist of a regular polygon and its interior. Show that for each positive integer $n$, there exists a set of points $S(n)$ in the plane such that every $n$ points can be covered by $C$, but $S(n)$ cannot be covered by $C.$
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.
The vertices of a regular $n + 1$-gon are denoted by $P_0,P_1,...,P_n$ in some order ($n \ge 2$). Each side of the polygon is assigned a natural number as follows: if the endpoints of the side are $P_i$ and $P_j$, then the assigned number equals $|i - j |$. Let S be the sum of all $n + 1$ assigned numbers.
(a) Given $n$, what is the smallest possible value of $S$?
(b) If $P_0$ is fixed, how many different assignments are there for which $S$ attains the smallest value?
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