Found problems: 200
What $n$ is the smallest such that “there is a $n$-gon that can be cut into a triangle, a quadrilateral, ..., a $2006$-gon''?
Prove that $n$ ($\ge 4$) points of the plane are vertices of a convex $n$-gon if and only if any $4$ of them are vertices of a convex quadrilateral.
If a polygon inscribed in a circle is equiangular and has an odd number of sides, prove that it is regular.
Find the largest possible number of intersection points of the diagonals of a convex $n$-gon.
Find all values of $n$ for which there exists a convex cyclic non-regular polygon with $n$ vertices such that the measures of all its internal angles are equal.
Given is a natural number $n\geqslant 3$. Find the smallest $k{}$ for which the following statement is true: for any $n{}$-gon and any two points inside it there is a broken line with $k{}$ segments connecting these points, lying entirely inside the $n{}$-gon.
[i]Proposed by L. Emelyanov[/i]
In the interior of a square $ABCD$ we construct the equilateral triangles $ABK, BCL, CDM, DAN.$ Prove that the midpoints of the four segments $KL, LM, MN, NK$ and the midpoints of the eight segments $AK, BK, BL, CL, CM, DM, DN, AN$ are the 12 vertices of a regular dodecagon.
There is a finite number of polygons in a plane and each two of them have a point in common. Prove that there exists a line which crosses every polygon.
A polygon is called [i]good [/i] if it satisfies the following conditions:
(i) All its angles are in $(0,\pi)$ or in $(\pi ,2\pi)$,
(ii) It is not self-intersecing,
(iii) For any three sides, two are parallel and equal.
Find all $n$ for which there exists a [i]good [/i] $n$-gon.
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$?
No matter how two copies of a convex polygon are placed inside a square, they always have a common point. Prove that no matter how three copies of the same polygon are placed inside this square, they also have a common point.
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}$.
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 $A,B$ be adjacent vertices of a regular $n$-gon ($n\ge5$) with center $O$. A triangle $XYZ$, which is congruent to and initially coincides with $OAB$, moves in the plane in such a way that $Y$ and $Z$ each trace out the whole boundary of the polygon, with $X$ remaining inside the polygon. Find the locus of $X$.
Let $n \geq 5$ be a given integer. Determine the greatest integer $k$ for which there exists a polygon with $n$ vertices (convex or not, with non-selfintersecting boundary) having $k$ internal right angles.
[i]Proposed by Juozas Juvencijus Macys, Lithuania[/i]
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.
Given a circle with radius $R$ and inscribed $n$-gon with area $S$. We mark one point on every side of the given polygon. Prove that the perimeter of the polygon with the vertices in the marked points is not less than $2S/R$.
Suppose we have two identical cardboard polygons. We placed one polygon upon the other one and aligned. Then we pierced polygons with a pin at a point. Then we turned one of the polygons around this pin by $25^o 30'$. It turned out that the polygons coincided (aligned again). What is the minimal possible number of sides of the polygons?
A hinged convex quadrilateral was made of four slats. Then, two points on its opposite sides were connected with another slat, but the structure remained non-rigid. Does it follow from this that this quadrilateral is a parallelogram?
[i]Proposed by A. Zaslavsky[/i]
[center][img width="40"]https://i.ibb.co/dgqSvLQ/Screenshot-2023-03-09-231327.png[/img][/center]
A convex polygon is divided into finitely many quadrilaterals. Prove that at least one of these quadrilaterals must also be convex.
For a natural number $n \ge 3$, we draw $n - 3$ internal diagonals in a non self-intersecting, but not necessarily convex, n-gon, cutting the $n$-gon into $n - 2$ triangles. It is known that the value (in degrees) of any angle in any of these triangles is a natural number and no two of these angle values are equal. What is the largest possible value of $n$?
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]
Find all possibilities: how many acute angles can there be in a convex polygon?
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.
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$.