A convex polygon has the property that its vertices are coloured by three colors, each colour occurring at least once and any two adjacent vertices having different colours. Prove that the polygon can be divided into triangles by diagonals, no two of which intersect in the [b]interior[/b] of the polygon, in such a way that all the resulting triangles have vertices of all three colours.

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.

A polygon is decomposed into triangles by drawing some non-intersecting interior diagonals in such a way that for every pair of triangles of the triangulation sharing a common side, the sum of the angles opposite to this common side is greater than $180^o$. a) Prove that this polygon is convex. b) Prove that the circumcircle of every triangle used in the decomposition contains the entire polygon. [i]Proposed by Morteza Saghafian - Iran[/i]

Let $ABCDEF$ be a convex hexagon such that $AB = BC, CD = DE, EF = FA$. Prove that $\frac{BC}{BE} +\frac{DE}{DA} +\frac{FA}{FC} \ge \frac{3}{2}$ . When does equality occur?

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) 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 has the property that its vertices are coloured by three colors, each colour occurring at least once and any two adjacent vertices having different colours. Prove that the polygon can be divided into triangles by diagonals, no two of which intersect in the [b]interior[/b] of the polygon, in such a way that all the resulting triangles have vertices of all three colours.

Is it true that in every convex polygon $3$ adjacent vertices can be selected such that their circumcirscribed circle can cover the entire polygon?

A convex $n$-gon is called [i]nice[/i] if its sides are not all the same length, and the sum of the distances of any interior point to the side lines is $1$. Find all integers $n \ge 4$ such that a nice $n$-gon exists .

Determine all positive integers $n$ such that the following statement holds: If a convex polygon with with $2n$ sides $A_1 A_2 \ldots A_{2n}$ is inscribed in a circle and $n-1$ of its $n$ pairs of opposite sides are parallel, which means if the pairs of opposite sides \[(A_1 A_2, A_{n+1} A_{n+2}), (A_2 A_3, A_{n+2} A_{n+3}), \ldots , (A_{n-1} A_n, A_{2n-1} A_{2n})\] are parallel, then the sides \[ A_n A_{n+1}, A_{2n} A_1\] are parallel as well.

a) Prove that a convex $n$-gon cannot have more than $3$ interior angles acute. b) Prove that a convex $n$-gon that has $3$ interior angles equal to $60^0,$ is equilateral.

Does there exist a convex polygon such that all its sidelengths are equal and all triangle formed by its vertices are obtuse-angled?

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\).

Let $K$ be a convex polygon in the plane and suppose that $K$ is positioned in the coordinate system in such a way that \[\text{area } (K \cap Q_i) =\frac 14 \text{area } K \ (i = 1, 2, 3, 4, ),\] where the $Q_i$ denote the quadrants of the plane. Prove that if $K$ contains no nonzero lattice point, then the area of $K$ is less than $4.$

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.

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_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.

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$.

Let $ n > 2$. Show that there is a set of $ 2^{n-1}$ points in the plane, no three collinear such that no $ 2n$ form a convex $ 2n$-gon.

Let $P$ be a convex polygon. Prove that there exists a convex hexagon that is contained in $P$ and whose area is at least $\frac34$ of the area of the polygon $P$. [i]Alternative version.[/i] Let $P$ be a convex polygon with $n\geq 6$ vertices. Prove that there exists a convex hexagon with [b]a)[/b] vertices on the sides of the polygon (or) [b]b)[/b] vertices among the vertices of the polygon such that the area of the hexagon is at least $\frac{3}{4}$ of the area of the polygon. [i]Proposed by Ben Green and Edward Crane, United Kingdom[/i]

The convex polygon $A_1A_2...A_n$ is given in the plane. Denote by $T_k$ $(k \le n)$ the convex $k$-gon of the largest area, with vertices at the points $A_1, A_2, ..., A_n$ and by $T_k(A+1)$ the convex k-gon of the largest area with vertices at the points $A_1, A_2, ..., A_n$ in which one of the vertices is in $A_1$. Set the relationship between the order of arrangement in the sequence $A_1, A_2, ..., A_n$ vertices: 1) $T_3$ and $T_3 (A_2)$ 2) $T_k$ and $T_k (A_1) $ 3) $T_k$ and $T_{k+1}$

The angle of a rotation $\rho$ is $\alpha <180^\circ$ and $\rho$ maps the convex polygon $M$ in itself. Prove that there exist two circles $c_1$ and $c_2$ with radius $r$ and $2r$, so that $c_1$ is inner for $M$ and $M$ is inner for $c_2$.

In a convex $2009$-gon, all diagonals are drawn. A line intersects the $2009$-gon but does not pass through any of its vertices. Prove that the line intersects an even number of diagonals.

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

In a convex $2008$-gon some of the diagonals are coloured red and the rest blue, so that every vertex is an endpoint of a red diagonal and no three red diagonals concur at a point. It's known that every blue diagonal is intersected by a red diagonal in an interior point. Find the minimal number of intersections of red diagonals.