Olympiad problems

2013 Tournament of Towns, 5

A $101$-gon is inscribed in a circle. From each vertex of this polygon a perpendicular is dropped to the opposite side or its extension. Prove that at least one perpendicular drops to the side.

1997 Tournament Of Towns, (561) 2

Tags: geometry , broken line , polygon , convex polygon

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

1969 IMO Shortlist, 46

Tags: geometry , perimeter , polygon , area , optimization

$(NET 1)$ The vertices of an $(n + 1)-$gon are placed on the edges of a regular $n-$gon so that the perimeter of the $n-$gon is divided into equal parts. How does one choose these $n + 1$ points in order to obtain the $(n + 1)-$gon with $(a)$ maximal area; $(b)$ minimal area?

1949 Moscow Mathematical Olympiad, 165

Tags: parallelogram , locus , polygon , perimeter , geometry

Consider two triangles, $ABC$ and $DEF$, and any point $O$. We take any point $X$ in $\vartriangle ABC$ and any point $Y$ in $\vartriangle DEF$ and draw a parallelogram $OXY Z$. Prove that the locus of all possible points $Z$ form a polygon. How many sides can it have? Prove that its perimeter is equal to the sum of perimeters of the original triangles.

1999 Nordic, 2

Tags: maximum , polygon , angle , geometry

Consider $7$-gons inscribed in a circle such that all sides of the $7$-gon are of different length. Determine the maximal number of $120^\circ$ angles in this kind of a $7$-gon.

2024 Middle European Mathematical Olympiad, 2

Tags: combinatorics , combinatorial geometry , polygon , question , guessing game

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.

2006 Sharygin Geometry Olympiad, 8.2

Tags: polygon , cut , minimum , combinatorial geometry , geometry

What $n$ is the smallest such that “there is a $n$-gon that can be cut into a triangle, a quadrilateral, ..., a $2006$-gon''?

2025 AIME, 12

Tags: polygon , geometry

Let $A_1A_2\dots A_{11}$ be a non-convex $11$-gon such that - The area of $A_iA_1A_{i+1}$ is $1$ for each $2 \le i \le 10$, - $\cos(\angle A_iA_1A_{i+1})=\frac{12}{13}$ for each $2 \le i \le 10$, - The perimeter of $A_1A_2\dots A_{11}$ is $20$. If $A_1A_2+A_1A_{11}$ can be expressed as $\frac{m\sqrt{n}-p}{q}$ for positive integers $m,n,p,q$ with $n$ squarefree and $\gcd(m,p,q)=1$, find $m+n+p+q$.

1985 Austrian-Polish Competition, 8

Tags: combinatorics , triangulation , polygon

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.

1977 Chisinau City MO, 146

Tags: convex , polygon , convex polygon , non-convex , geometry

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.

2002 Spain Mathematical Olympiad, Problem 6

Tags: geometry , polygon , coloring

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

Kyiv City MO 1984-93 - geometry, 1987.10.1

Tags: geometry , tangential , polygon

Is there a $1987$-gon with consecutive sides lengths $1, 2, 3,..., 1986, 1987$, in which you can fit a circle?

1977 IMO, 1

Tags: complex number , geometry , square , polygon

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.

1989 Bundeswettbewerb Mathematik, 3

Tags: polygon , geometry , convex quadrilateral , convex

A convex polygon is divided into finitely many quadrilaterals. Prove that at least one of these quadrilaterals must also be convex.

2023 Costa Rica - Final Round, 3.3

Tags: geometry , polygon , concurrency

Let $ABCD \dots KLMN$ be a regular polygon with $14$ sides. Show that the diagonals $AE$, $BG$, and $CK$ are concurrent.

1986 IMO Longlists, 47

Tags: geometry , rotation , polygon , locus , locus problems

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

2006 Germany Team Selection Test, 3

Tags: diagonal , combinatorics , extremal combinatorics , coloring , polygon

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]

1949 Moscow Mathematical Olympiad, 157

Tags: symmetry , polygon , 3d geometry , geometry

a) Prove that if a planar polygon has several axes of symmetry, then all of them intersect at one point. b) A finite solid body is symmetric about two distinct axes. Describe the position of the symmetry planes of the body.

Kvant 2022, M2728

Tags: geometry , polygon

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]

2010 Germany Team Selection Test, 2

Tags: geometry , parallelogram , geometric inequality , area , polygon

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]

2017 Bulgaria EGMO TST, 1

Tags: combinatorial geometry , triangulation , polygon , combinatorics

Prove that every convex polygon has at most one triangulation consisting entirely of acute triangles.

2019 Auckland Mathematical Olympiad, 3

Tags: polygon , geometry

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.

2015 Middle European Mathematical Olympiad, 2

Tags: diagonal , combinatorics , polygon , combinatorial geometry

Let $n\ge 3$ be an integer. An [i]inner diagonal[/i] of a [i]simple $n$-gon[/i] is a diagonal that is contained in the $n$-gon. Denote by $D(P)$ the number of all inner diagonals of a simple $n$-gon $P$ and by $D(n)$ the least possible value of $D(Q)$, where $Q$ is a simple $n$-gon. Prove that no two inner diagonals of $P$ intersect (except possibly at a common endpoint) if and only if $D(P)=D(n)$. [i]Remark:[/i] A simple $n$-gon is a non-self-intersecting polygon with $n$ vertices. A polygon is not necessarily convex.

2010 Germany Team Selection Test, 2

Tags: geometry , parallelogram , geometric inequality , area , polygon

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]

2018 May Olympiad, 3

Tags: geometry , computational , polygon

Let $ABCDEFGHIJ$ be a regular $10$-sided polygon that has all its vertices in one circle with center $O$ and radius $5$. The diagonals $AD$ and $BE$ intersect at $P$ and the diagonals $AH$ and $BI$ intersect at $Q$. Calculate the measure of the segment $PQ$.