One side of a convex polygon is equal to $a$, the sum of exterior angles at the vertices not adjacent to this side are equal to $120^o$. Among such polygons, find the polygon of the largest area.

In the convex pentagon $ ABCDE,$ the sides $ BC, CD, DE$ are equal. Moreover each diagonal of the pentagon is parallel to a side ($ AC$ is parallel to $ DE$, $ BD$ is parallel to $ AE$ etc.). Prove that $ ABCDE$ is a regular pentagon.

All sides of a convex polygon were decreased in such a way that they formed a new convex polygon. Is it possible that all diagonals were increased?

Let $A_1A_2...A_n$ ba a polygon. Prove that there is a convex polygon $B_1B_2...B_n$ such that $B_iB_{i + 1} = A_iA_{i + 1}$ for $i \in \{1, 2,...,n-1\}$ and $B_nB_1 = A_nA_1$ (some of the successive vertices of the polygon $B_1B_2...B_n$ can be colinear).

Given a convex polygon $ A_1A_2 \ldots A_n$ with area $ S$ and a point $ M$ in the same plane, determine the area of polygon $ M_1M_2 \ldots M_n,$ where $ M_i$ is the image of $ M$ under rotation $ R^{\alpha}_{A_i}$ around $ A_i$ by $ \alpha_i, i \equal{} 1, 2, \ldots, n.$

A convex polygon is such that any segment dividing the polygon into two parts of equal area which has at least one end at a vertex has length $< 1$. Show that the area of the polygon is $< \pi /4$.

Do there exist a convex quadrilateral and a point $P$ inside it such that the sum of distances from $P$ to the vertices of the quadrilateral is greater than its perimeter? (A.Akopyan)

Let $P_{1}P_{2}\dots P_{2n}$ be a convex polygon with an even number of corners. Prove that there exists a diagonal $P_{i}P_{j}$ which is not parallel to any side of the polygon.

A pupil has tried to make a copy of a convex polygon, drawn inside the unit circle. He draw one side, from its end -- another, and so on. Having finished, he has noticed that the first and the last vertices do not coincide, but are situated $d$ units of length far from each other. The pupil draw angles precisely, but made relative error less than $p$ in the lengths of sides. Prove that $d < 4p$.

Each vertex of a convex polygon has integer coordinates, and no side of this polygon is horizontal or vertical. Prove that the sum of the lengths of the segments of lines of the form $x = m$, $m$ an integer, that lie within the polygon is equal to the sum of the lengths of the segments of lines of the form $y = n$, $n$ an integer, that lie within the polygon. (G Galperin)

It is known that diagonals of a square, as well as a regular pentagon, are all equal. Find the bigeest natural $n$ such that a convex $n$-gon has all it's diagonals equal.

Let \(n \geq 5\) be integer. The convex polygon \(P = A_{1} A_{2} \ldots A_{n}\) is bicentric, that is, it has an inscribed and circumscribed circle. Set \(A_{i+n}=A_{i}\) to every integer \(i\) (that is, all indices are taken modulo \(n\)). Suppose that for all \(i, 1 \leq i \leq n\), the rays \(A_{i-1} A_{i}\) and \(A_{i+2} A_{i+1}\) meet at the point \(B_{i}\). Let \(\omega_{i}\) be the circumcircle of \(B_{i} A_{i} A_{i+1}\). Prove that there is a circle tangent to all \(n\) circles \(\omega_{i}\), \(1 \leq i \leq n\).

a) Given a triangle $A_1A_2A_3$ and the points $B_1$ and $D_2$ on the side $[A_1A_2]$, $B_2$ and $D_3$ on the side $[A_2A3]$, $B_3$ and $D_1$ on the side $[A_3A_1]$. If you construct parallelograms $A_1B_1C_1D_1$, $A_2B_2C_2D_2$ and $A_3B_3C_3D_3$, the lines $(A_1C_1)$, $(A_2C_2)$ and $(A_3C_3)$, will cross in one point $O$. Prove that if $$|A_1B_1| = |A_2D_2| \,\,\, and \,\,\, |A_2B_2| = |A_3D_3|$$ then $$|A_3B_3| = |A_1D_1|$$ b) Given a convex polygon $A_1A_2 ... A_n$ and the points $B_1$ and $D_2$ on the side $[A_1A_2]$, $B_2$ and $D_3$ on the side $[A_2A_3]$, ... $B_n$ and $D_1$ on the side $[A_nA_1]$. If you construct parallelograms $A_1B_1C_1D_1$, $A_2B_2C_2D_2$, $... $, $A_nB_nC_nD_n$, the lines $(A_1C_1)$, $(A_2C_2)$, $...$, $(A_nC_n)$, will cross in one point $O$. Prove that $$|A_1B_1| \cdot |A_2B_2|\cdot ... \cdot |A_nB_n| = |A_1D_1|\cdot |A_2D_2|\cdot ...\cdot |A_nD_n|$$

A convex polygon $G$ is placed inside a convex polygon $ F$ so that their boundaries have no common points. A segment $s$ joining two points on the boundary of $F$ is called a support chord for $G$ if s contains a side or only a vertex of $G$. Prove that (a) there exists a support chord for $G$ such that its midpoint lies on the boundary of $G$, (b) there exist at least two such chords. (P Pushkar)

A regular star-shaped hexagon is split into $4$ parts. Construct from them a convex polygon. Note: A regular six-pointed star is a figure that is obtained by combining a regular triangle and a triangle symmetrical to it relative to its center

Let $P_0,P_1,P_2,\ldots$ be a sequence of convex polygons such that, for each $k\ge0$, the vertices of $P_{k+1}$ are the midpoints of all sides of $P_k$. Prove that there exists a unique point lying inside all these polygons.

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,)

Two convex polygons can be placed into a square with the side $1$ without intersection. Prove that at least one polygon has the perimeter that is less than or equal to $3,5$ .

How many sides of the convex polygon can equal its longest diagonal?

Let $ABCDE$ be a convex pentagon inscribed in a circle $\Gamma$, such that $AB = BC = CD$. Let $F$ and $G$ be the intersections of $BE$ with $AC$ and of $CE$ with $BD$, respectively. Show that: a) $[ABC] = [FBCG]$ b) $\frac{[EFG]}{[EAD]} = \frac{BC}{AD}$ [b]Note: [/b] $[X]$ denotes the area of polygon $X$.

We divide a convex $2009$-gon in triangles using non-intersecting diagonals. One of these diagonals is colored green. It is allowed the following operation: for two triangles $ABC$ and $BCD$ from the dividing/separating with a common side $BC$ if the replaced diagonal was green it loses its color and the replacing diagonal becomes green colored. Prove that if we choose any diagonal in advance it can be colored in green after applying the operation described finite number of times.

Find the smallest real $\alpha$, such that for any convex polygon $P$ with area $1$, there exist a point $M$ in the plane, such that the area of convex hull of $P\cup Q$ is at most $\alpha$, where $Q$ denotes the image of $P$ under central symmetry with respect to $M$.

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.

Each vertex of a convex polygon is projected to all nonadjacent sidelines. Can it happen that each of these projections lies outside the corresponding side?

A convex polygon on a plane contains at least $m^2+1$ points with integer coordinates. Prove that it contains $m+1$ points with integer coordinates that lie on the same line.