Found problems: 96
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$.
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}$
Given a convex $ n $-gon ($ n \geq 5 $). Prove that the number of triangles of area $1$ with vertices at the vertices of the $ n $-gon does not exceed $ \frac{1}{3} n (2n-5) $.
Find the largest positive integer $n$ ($n \ge 3$), so that there is a convex $n$-gon, the tangent of each interior angle is an integer.
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]
From an arbitrary point $O$ inside a convex $n$-gon, perpendiculars are drawn on (extensions of the) sides of the $n$-gon. Along each perpendicular a vector is constructed, starting from $O$, directed towards the side onto which the perpendicular is drawn, and of length equal to half the length of the corresponding side. Find the sum of these vectors.
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 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]
Prove that you can always pose a circle of radius $S/P$ inside a convex polygon with the perimeter $P$ and area $S$.
Prove that there exists a convex 1990-gon with the following two properties :
[b]a.)[/b] All angles are equal.
[b]b.)[/b] The lengths of the 1990 sides are the numbers $ 1^2$, $ 2^2$, $ 3^2$, $ \cdots$, $ 1990^2$ in some order.
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.
A square is divided into several (greater than one) convex polygons with mutually different numbers of sides. Prove that one of these polygons is a triangle.
(A.Zaslavsky)
Is there a convex polygon with each side equal to some diagonal, and each diagonal equal to some side?
We are given $100$ points. $N$ of these are vertices of a convex $N$-gon and the other $100 - N$ of these are inside this $N$-gon. The labels of these points make it impossible to tell whether or not they are vertices of the $N$-gon. It is known that no three points are collinear and that no $4$ points belong to two parallel lines. It has been decided to ask questions of the following type: What is the area of the triangle $XYZ$, where $X, Y$ and $Z$ are labels representing three of the $100$ given points? Prove that $300$ such questions are sufficient in order to clarify which points are vertices and to determine the area of the $N$-gon.
(D. Fomin, Leningrad)
A convex polygon is circumscribed around a circle. Points of contact of its sides with the circle form a polygon with the same set of angles (the order of angles may differ). Is it true that the polygon is regular?
A point $O$ inside a convex $n$-gon $A_1A_2 . . .A_n$ is connected with segments to its vertices. The sides of this $n$-gon are numbered $1$ to $n$ (distinct sides have distinct numbers). The segments $OA_1,OA_2, . . . ,OA_n$ are similarly numbered.
a) For $n = 9$ find a numeration such that the sum of the sides’ numbers is the same for all triangles $A_1OA_2, A_2OA_3, . . . , A_nOA_1$.
b) Prove that for $n = 10$ there is no such numeration.
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$.
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$.
Given a convex polygon. You can put no triangle with area $1$ inside it. Prove that you can put the polygon inside a triangle with the area $4$.
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.$
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.
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.$
Let $ d$ be the sum of the lengths of all the diagonals of a plane convex polygon with $ n$ vertices (where $ n>3$). Let $ p$ be its perimeter. Prove that:
\[ n\minus{}3<{2d\over p}<\Bigl[{n\over2}\Bigr]\cdot\Bigl[{n\plus{}1\over 2}\Bigr]\minus{}2,\]
where $ [x]$ denotes the greatest integer not exceeding $ x$.
At what smallest $n$ is there a convex $n$-gon for which the sines of all angles are equal and the lengths of all sides are different?
Denote $X,Y$ two convex polygons, such that $X$ is contained inside $Y$. Denote $S (X)$, $P (X)$, $S (Y)$, $P (Y)$ the area and perimeter of the first and second polygons, respectively. Prove that $$ \frac{S(X)}{P(X)}<2 \frac{S(Y)}{P(Y)}.$$