Olympiad problems

1963 IMO, 3

In an $n$-gon $A_{1}A_{2}\ldots A_{n}$, all of whose interior angles are equal, the lengths of consecutive sides satisfy the relation \[a_{1}\geq a_{2}\geq \dots \geq a_{n}. \] Prove that $a_{1}=a_{2}= \ldots= a_{n}$.

2017 IMAR Test, 4

Tags: combinatorics , polygon , geometry , combinatorial geometry

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

2023 Costa Rica - Final Round, 3.3

Tags: polygon , geometry , concurrency

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

2019 India PRMO, 15

Tags: parallel , polygon

In how many ways can a pair of parallel diagonals of a regular polygon of $10$ sides be selected?

1978 Chisinau City MO, 168

Tags: combinatorial geometry , geometry , convex polygon , convex , polygon , diagonal , combinatorics

Find the largest possible number of intersection points of the diagonals of a convex $n$-gon.

Kvant 2020, M2608

Tags: polygon , geometry

A hinged convex quadrilateral was made of four slats. Then, two points on its opposite sides were connected with another slat, but the structure remained non-rigid. Does it follow from this that this quadrilateral is a parallelogram? [i]Proposed by A. Zaslavsky[/i] [center][img width="40"]https://i.ibb.co/dgqSvLQ/Screenshot-2023-03-09-231327.png[/img][/center]

1994 Austrian-Polish Competition, 4

Tags: combinatorics , polygon

The vertices of a regular $n + 1$-gon are denoted by $P_0,P_1,...,P_n$ in some order ($n \ge 2$). Each side of the polygon is assigned a natural number as follows: if the endpoints of the side are $P_i$ and $P_j$, then the assigned number equals $|i - j |$. Let S be the sum of all $n + 1$ assigned numbers. (a) Given $n$, what is the smallest possible value of $S$? (b) If $P_0$ is fixed, how many different assignments are there for which $S$ attains the smallest value?

2010 IFYM, Sozopol, 5

Tags: combinatorics , polygon

Let $A_1 A_2...A_n$ be a convex $n$-gon. What’s the number of $m$-gons with vertices from $A_1,A_2,...,A_n$ such that between each two adjacent vertices of the $m$-gon there are at least $k$ vertices from the $n$-gon?

2017 Bundeswettbewerb Mathematik, 2

Tags: combinatorics , polygon , coloring , isosceles

In a convex regular $35$-gon $15$ vertices are colored in red. Are there always three red vertices that make an isosceles triangle?

1999 German National Olympiad, 4

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

A convex polygon $P$ is placed inside a unit square $Q$. Prove that the perimeter of $P$ does not exceed $4$.

1996 North Macedonia National Olympiad, 2

Tags: function , polygon , rectangle

Let $P$ be the set of all polygons in the plane and let $M : P \to R$ be a mapping that satisfies: (i) $M(P) \ge 0$ for each polygon $P$, (ii) $M(P) = x^2$ if $P$ is an equilateral triangle of side $x$, (iii) If a polygon $P$ is partitioned into polygons $S$ and $T$, then $M(P) = M(S)+ M(T)$, (iv) If polygons $P$ and $T$ are congruent, then $M(P) = M(T )$. Determine $M(P)$ if $P$ is a rectangle with edges $x$ and $y$.

2007 Sharygin Geometry Olympiad, 6

Tags: symmetry , geometry , axes , polygon , polyhedron

a) What can be the number of symmetry axes of a checked polygon, that is, of a polygon whose sides lie on lines of a list of checked paper? (Indicate all possible values.) b) What can be the number of symmetry axes of a checked polyhedron, that is, of a polyhedron consisting of equal cubes which border one to another by plane facets?

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

May Olympiad L1 - geometry, 2018.3

Tags: geometry , polygon , computational

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

2000 Chile National Olympiad, 2

Tags: geometry , polygon

In the plane, we have any polygon that does not intersect itself and is closed. Given a point that is not on the edge of the polygon. How can we determine whether it is inside or outside the polygon? (the polygon has a finite number of sides) [hide=original wording]En el plano se tiene un poligono cualquiera que no se corta a si mismo y que es cerrado. Dado un punto que no esta sobre el borde del poligono, Como determinara se esta dentro o fuera del poligono? (el poligono tiene un numero nito de lados)[/hide]

1978 Austrian-Polish Competition, 9

Tags: polygon , combinatorial geometry , diagonal , combinatorics

In a convex polygon $P$ some diagonals have been drawn, without intersections inside $P$. Show that there exist at least two vertices of $P$, neither one of them being an endpoint of any one of those diagonals.

2022 Baltic Way, 8

Tags: combinatorial geometry , combinatorics , diagonal , polygon

For a natural number $n \ge 3$, we draw $n - 3$ internal diagonals in a non self-intersecting, but not necessarily convex, n-gon, cutting the $n$-gon into $n - 2$ triangles. It is known that the value (in degrees) of any angle in any of these triangles is a natural number and no two of these angle values are equal. What is the largest possible value of $n$?

2007 IMAC Arhimede, 6

Tags: convex , convex polygon , polygon , geometry

Let $A_1A_2...A_n$ ba a polygon. Prove that there is a convex polygon $B_1B_2...B_n$ such that $B_iB_{i + 1} = A_iA_{i + 1}$ for $i \in \{1, 2,...,n-1\}$ and $B_nB_1 = A_nA_1$ (some of the successive vertices of the polygon $B_1B_2...B_n$ can be colinear).

1997 Akdeniz University MO, 4

Tags: polygon , combinatorics

A polygon with $1997$ vertices is given. Write a positive real number each vertex such that, each number equal to its right and left numbers' arithmetic or geometric mean. Prove that all numbers are equal.

1992 IMO Longlists, 59

Tags: geometric inequality , circumcircle , polygon , geometry

Let a regular $7$-gon $A_0A_1A_2A_3A_4A_5A_6$ be inscribed in a circle. Prove that for any two points $P, Q$ on the arc $A_0A_6$ the following equality holds: \[\sum_{i=0}^6 (-1)^{i} PA_i = \sum_{i=0}^6 (-1)^{i} QA_i .\]

2018 Iranian Geometry Olympiad, 3

Tags: perpendicular , geometry , diagonal , polygon

Find all possible values of integer $n > 3$ such that there is a convex $n$-gon in which, each diagonal is the perpendicular bisector of at least one other diagonal. Proposed by Mahdi Etesamifard

2010 IMO Shortlist, 3

Tags: polygon , circumcircle , geometry , inequality

Let $A_1A_2 \ldots A_n$ be a convex polygon. Point $P$ inside this polygon is chosen so that its projections $P_1, \ldots , P_n$ onto lines $A_1A_2, \ldots , A_nA_1$ respectively lie on the sides of the polygon. Prove that for arbitrary points $X_1, \ldots , X_n$ on sides $A_1A_2, \ldots , A_nA_1$ respectively, \[\max \left\{ \frac{X_1X_2}{P_1P_2}, \ldots, \frac{X_nX_1}{P_nP_1} \right\} \geq 1.\] [i]Proposed by Nairi Sedrakyan, Armenia[/i]

1969 IMO Longlists, 46

Tags: polygon , area , perimeter , optimization , geometry

$(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?

1979 IMO Longlists, 1

Tags: rhombus , polygon , dissection , geometry

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

1969 IMO Shortlist, 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.$