Found problems: 200
Into how many parts can a convex $n$-gon be divided by its diagonals if no three diagonals meet at one point?
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$.
For a convex $n$-gon $P_n$, we say that a convex quadrangle $Q$ is a [i]diagonal-quadrangle[/i] of $P_n$, if its vertices are vertices of $P_n$ and its sides are diagonals of $P_n$. Let $d_n$ be the number of diagonal-quadrangles of a convex $n$-gon. Determine $d_n$ for all $n\geq 8$.
Given a natural number $n> 3$. On the plane are considered convex $n$ - gons $F_1$ and $F_2$ such that on each side of $F_1$ lies one vertex of $F_2$ and no two vertices $F_1$ and $F_2$ coincide.
For each $n$, determine the limits of the ratio of the areas of the polygons $F_1$ and $F_2$.
For each $n$, determine the range of the areas of the polygons $F_1$ and $F_2$, if $F_1$ is a regular $n$-gon.
Determine the set of values of this value for other partial cases of the polygon $F_1$.
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?
There is a rectangular sheet of paper on an infinite blackboard. Marvin secretly chooses a convex $2024$-gon $P$ that lies fully on the piece of paper. Tigerin wants to find the vertices of $P$. In each step, Tigerin can draw a line $g$ on the blackboard that is fully outside the piece of paper, then Marvin replies with the line $h$ parallel to $g$ that is the closest to $g$ which passes through at least one vertex of $P$. Prove that there exists a positive integer $n$, independent of the choice of the polygon, such that Tigerin can always determine the vertices of $P$ in at most $n$ steps.
Let $A_1A_2 \ldots A_n$ be a convex polygon. Point $P$ inside this polygon is chosen so that its projections $P_1, \ldots , P_n$ onto lines $A_1A_2, \ldots , A_nA_1$ respectively lie on the sides of the polygon. Prove that for arbitrary points $X_1, \ldots , X_n$ on sides $A_1A_2, \ldots , A_nA_1$ respectively,
\[\max \left\{ \frac{X_1X_2}{P_1P_2}, \ldots, \frac{X_nX_1}{P_nP_1} \right\} \geq 1.\]
[i]Proposed by Nairi Sedrakyan, Armenia[/i]
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]
Convex $n$-gon $P$, where $n> 3$, is cut into equal triangles by diagonals that do not intersect inside it. What are the possible values of $n$ if the $n$-gon is cyclic?
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)?
Suppose we have a $n$-gon. Some $n-3$ diagonals are coloured black and some other $n-3$ diagonals are coloured red (a side is not a diagonal), so that no two diagonals of the same colour can intersect strictly inside the polygon, although they can share a vertex. Find the maximum number of intersection points between diagonals coloured differently strictly inside the polygon, in terms of $n$.
[i]Proposed by Alexander Ivanov, Bulgaria[/i]
Let $ A_1A_2 \ldots A_n$ be a convex polygon, $ n \geq 4.$ Prove that $ A_1A_2 \ldots A_n$ is cyclic if and only if to each vertex $ A_j$ one can assign a pair $ (b_j, c_j)$ of real numbers, $ j = 1, 2, \ldots, n,$ so that $ A_iA_j = b_jc_i - b_ic_j$ for all $ i, j$ with $ 1 \leq i < j \leq n.$
Prove that if a cyclic polygon with an odd number of sides has all angles equal, then this polygon is regular.
The floor plan of a contemporary art museum is a (not necessarily convex) polygon and its walls are solid. The security guard guarding the museum has two favourite spots (points $A$ and $B$) because one can see the whole area of the museum standing at either point. Is it true that from any point of the $AB$ section one can see the whole museum?
A convex $n$-gon has exactly three obtuse interior angles. Find all possible values of $n$.
Let $A_1,A_2,\ldots,A_{2n}$ are the vertices of a regular $2n$-gon and $P$ is a point from the incircle of the polygon. If $\alpha_i=\angle A_iPA_{i+n}$, $i=1,2,\ldots,n$. Prove the equality
$$\sum_{i=1}^n\tan^2\alpha_i=2n\frac{\cos^2\frac\pi{2n}}{\sin^4\frac\pi{2n}}.$$
Seven polygons of area $1$ lie in the interior of a square with side length $2$. Show that there are two of these polygons whose intersection has an area of at least $1\slash 7.$
A [i]diagonal line[/i] of a (not necessarily convex) polygon with at least four sides is any line through two non-adjacent vertices of that polygon. Determine all polygons with at least four sides satisfying the following condition: The reflexion of each vertex in each diagonal line lies inside or on the boundary of the polygon.
[i]The Problem Selection Committee[/i]
In how many ways can a pair of parallel diagonals of a regular polygon of $10$ sides be selected?
Denote $U$ as the set of $20$ diagonals of the regular polygon $P_1P_2P_3P_4P_5P_6P_7P_8$.
Find the number of sets $S$ which satisfies the following conditions.
1. $S$ is a subset of $U$.
2. If $P_iP_j \in S$ and $P_j P_k \in S$, and $i \neq k$, $P_iP_k \in S$.
Which regular polygon can be obtained (and how) by cutting a cube with a plane ?
Prove that among any $51$ vertices of the $101$-regular polygon there are three that are the vertices of an isosceles triangle.
In a regular polygon $H$ of $6n+1$ sides ($n$ is a positive integer), we paint $r$ vertices red, and the rest blue. Demonstrate that the number of isosceles triangles that have three of their vertices of the same color does not depend on the way we distribute the colors on the vertices of $H$.
Cut a cross made up of five identical squares into three polygons, equal in area and perimeter.
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.