Olympiad problems

2014 Iranian Geometry Olympiad (junior), P3

Each of Mahdi and Morteza has drawn an inscribed $93$-gon. Denote the first one by $A_1A_2…A_{93}$ and the second by $B_1B_2…B_{93}$. It is known that $A_iA_{i+1} // B_iB_{i+1}$ for $1 \le i \le 93$ ($A_{93} = A_1, B_{93} = B_1$). Show that $\frac{A_iA_{i+1} }{ B_iB_{i+1}}$ is a constant number independent of $i$. by Morteza Saghafian

1966 IMO Shortlist, 41

Tags: geometry , polygon , counting , obtuse triangle

Given a regular $n$-gon $A_{1}A_{2}...A_{n}$ (with $n\geq 3$) in a plane. How many triangles of the kind $A_{i}A_{j}A_{k}$ are obtuse ?

2006 IMO Shortlist, 2

Tags: polygon , combinatorics , extremal combinatorics

Let $P$ be a regular $2006$-gon. A diagonal is called [i]good[/i] if its endpoints divide the boundary of $P$ into two parts, each composed of an odd number of sides of $P$. The sides of $P$ are also called [i]good[/i]. Suppose $P$ has been dissected into triangles by $2003$ diagonals, no two of which have a common point in the interior of $P$. Find the maximum number of isosceles triangles having two good sides that could appear in such a configuration.

Kvant 2022, M2728

Tags: polygon , geometry

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: area , parallelogram , geometry , geometric inequality , 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]

2015 Middle European Mathematical Olympiad, 2

Tags: polygon , diagonal , combinatorics , 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.

2004 IMO Shortlist, 6

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

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]

1985 Austrian-Polish Competition, 9

Tags: combinatorial geometry , geometry , extremal principle , polygon

We are given a convex polygon. Show that one can find a point $Q$ inside the polygon and three vertices $A_1,A_2,A_3$ (not necessarily consecutive) such that each ray $A_iQ$ ($i=1,2,3$) makes acute angles with the two sides emanating from $A_i$.

1977 IMO Shortlist, 12

Tags: polygon , square , geometry , complex number

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.

2005 Estonia National Olympiad, 2

Tags: polygon , convex , equal angles , 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$ .)

2022 Malaysia IMONST 2, 4

Tags: angle chasing , polygon , geometry

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

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

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]

1976 Bulgaria National Olympiad, Problem 1

Tags: polygon , hexagon , geometry

In a circle with a radius of $1$ is an inscribed hexagon (convex). Prove that if the multiple of all diagonals that connects vertices of neighboring sides is equal to $27$ then all angles of hexagon are equals. [i]V. Petkov, I. Tonov[/i]

1985 All Soviet Union Mathematical Olympiad, 398

Tags: coloring , polygon

You should paint all the sides and diagonals of the regular $n$-gon so, that every pair of segments, having the common point, would be painted with different colours. How many colours will you require?

2010 Sharygin Geometry Olympiad, 8

Tags: combinatorics , point , polygon , regular polygon , minimum , perimeter , geometry

Given is a regular polygon. Volodya wants to mark $k$ points on its perimeter so that any another regular polygon (maybe having a different number of sides) doesn’t contain all marked points on its perimeter. Find the minimal $k$ sufficient for any given polygon.

2018 Regional Olympiad of Mexico Southeast, 1

Tags: winning strategy , polygon , combinatorics

Lalo and Sergio play in a regular polygon of $n\geq 4$ sides. In his turn, Lalo paints a diagonal or side of pink, and in his turn Sergio paint a diagonal or side of orange. Wins the game who achieve paint the three sides of a triangle with his color, if none of the players can win, they game tie. Lalo starts playing. Determines all natural numbers $n$ such that one of the players have winning strategy.

1998 Austrian-Polish Competition, 8

Tags: combinatorial geometry , polygon , combinatorics , grid , area

In each unit square of an infinite square grid a natural number is written. The polygons of area $n$ with sides going along the gridlines are called [i]admissible[/i], where $n > 2$ is a given natural number. The [i]value [/i] of an admissible polygon is defined as the sum of the numbers inside it. Prove that if the values of any two congruent admissible polygons are equal, then all the numbers written in the unit squares of the grid are equal. (We recall that a symmetric image of polygon $P$ is congruent to $P$.)

2009 IMO Shortlist, 5

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