Olympiad problems

2023 Costa Rica - Final Round, 3.3

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

1986 IMO Longlists, 33

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

2017 Korea National Olympiad, problem 1

Tags: combinatorics , polygon , counting , diagonal

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

2009 Postal Coaching, 2

Tags: max , area , polygon , cyclic , perpendicular , diagonal , geometry

Let $n \ge 4$ be an integer. Find the maximum value of the area of a $n$-gon which is inscribed in the circle of radius $1$ and has two perpendicular diagonals.

2005 IMO Shortlist, 8

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

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]

1987 China Team Selection Test, 2

Tags: analytic geometry , induction , coordinates , geometry , polygon

A closed recticular polygon with 100 sides (may be concave) is given such that it's vertices have integer coordinates, it's sides are parallel to the axis and all it's sides have odd length. Prove that it's area is odd.

2022 Malaysia IMONST 2, 4

Tags: geometry , angle chasing , polygon

Given a pentagon $ABCDE$ with all its interior angles less than $180^\circ$. Prove that if $\angle ABC = \angle ADE$ and $\angle ADB = \angle AEC$, then $\angle BAC = \angle DAE$.

1969 IMO Longlists, 20

Tags: geometry , polygon , lattice points , area

$(FRA 3)$ A polygon (not necessarily convex) with vertices in the lattice points of a rectangular grid is given. The area of the polygon is $S.$ If $I$ is the number of lattice points that are strictly in the interior of the polygon and B the number of lattice points on the border of the polygon, find the number $T = 2S- B -2I + 2.$

1949 Moscow Mathematical Olympiad, 165

Tags: geometry , parallelogram , locus , polygon , perimeter

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.

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.

2013 IFYM, Sozopol, 8

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]

1979 IMO Shortlist, 1

Tags: geometry , polygon , dissection , rhombus

Prove that in the Euclidean plane every regular polygon having an even number of sides can be dissected into lozenges. (A lozenge is a quadrilateral whose four sides are all of equal length).

2009 IMO Shortlist, 5

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

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]

1996 North Macedonia National Olympiad, 4

Tags: geometry , combinatorial geometry , polygon , parallel

A polygon is called [i]good [/i] if it satisfies the following conditions: (i) All its angles are in $(0,\pi)$ or in $(\pi ,2\pi)$, (ii) It is not self-intersecing, (iii) For any three sides, two are parallel and equal. Find all $n$ for which there exists a [i]good [/i] $n$-gon.

2017 IMAR Test, 4

Tags: combinatorial geometry , combinatorics , geometry , polygon

Let $n$ be an integer greater than or equal to $3$, and let $P_n$ be the collection of all planar (simple) $n$-gons no two distinct sides of which are parallel or lie along some line. For each member $P$ of $P_n$, let $f_n(P)$ be the least cardinal a cover of $P$ by triangles formed by lines of support of sides of $P$ may have. Determine the largest value $f_n(P)$ may achieve, as $P$ runs through $P_n$.

1986 IMO Shortlist, 1

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

1967 IMO Shortlist, 3

Tags: geometry , 3d geometry , polygon , cube , intersection

Which regular polygon can be obtained (and how) by cutting a cube with a plane ?

2021 Malaysia IMONST 2, 4

Tags: geometry , polygon

Given an octagon such that all its interior angles are equal, and all its sides have integer lengths. Prove that any pair of opposite sides have equal lengths.

1970 Bulgaria National Olympiad, Problem 5

Tags: inequalities , geometric inequalities , geometry , polygon

Prove that for $n\ge5$ the side of regular inscribable $n$-gon is bigger than the side of regular $n+1$-gon circumscribed around the same circle and if $n\le4$ the opposite statement is true.

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]

Ukrainian TYM Qualifying - geometry, VI.9

Tags: geometry , chord , polygon , area

Consider an arbitrary (optional convex) polygon. It's [i]chord [/i] is a segment whose ends lie on the boundary of the polygon, and itself belongs entirely to the polygon. Will there always be a chord of a polygon that divides it into two equal parts? Is it true that any polygon can be divided by some chord into parts, the area of each of which is not less than $\frac13$ the area of the polygon?

2005 Estonia National Olympiad, 2

Tags: equal angles , polygon , convex , geometry

Consider a convex $n$-gon in the plane with $n$ being odd. Prove that if one may find a point in the plane from which all the sides of the $n$-gon are viewed at equal angles, then this point is unique. (We say that segment $AB$ is viewed at angle $\gamma$ from point $O$ iff $\angle AOB =\gamma$ .)

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

2008 Germany Team Selection Test, 3

Tags: combinatorics , combinatorial geometry , polygon , extremal combinatorics

Given is a convex polygon $ P$ with $ n$ vertices. Triangle whose vertices lie on vertices of $ P$ is called [i]good [/i] if all its sides are unit length. Prove that there are at most $ \frac {2n}{3}$ [i]good[/i] triangles. [i]Author: Vyacheslav Yasinskiy, Ukraine[/i]

1976 Czech and Slovak Olympiad III A, 5

Tags: geometry , perimeter , geometric inequalities , convex , polygon , inequalities

Let $\mathbf{P}_1,\mathbf{P}_2$ be convex polygons with perimeters $o_1,o_2,$ respectively. Show that if $\mathbf P_1\subseteq\mathbf P_2,$ then $o_1\le o_2.$