Olympiad problems

Estonia Open Junior - geometry, 2017.1.5

Find all possibilities: how many acute angles can there be in a convex polygon?

1977 IMO Longlists, 29

Tags: complex number , square , polygon , geometry

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.

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]

1997 Israel Grosman Mathematical Olympiad, 2

Tags: geometry , polygon , area , lattice

Is there a planar polygon whose vertices have integer coordinates and whose area is $1/2$, such that this polygon is (a) a triangle with at least two sides longer than $1000$? (b) a triangle whose sides are all longer than $1000$? (c) a quadrangle?

2011 Peru IMO TST, 2

Tags: circumcircle , inequality , polygon , geometry

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]

Russian TST 2014, P2

Tags: polygon , homothety , geometry

The polygon $M{}$ is bicentric. The polygon $P{}$ has vertices at the points of contact of the sides of $M{}$ with the inscribed circle. The polygon $Q{}$ is formed by the external bisectors of the angles of $M{}.$ Prove that $P{}$ and $Q{}$ are homothetic.

2020 Swedish Mathematical Competition, 4

Tags: combinatorial geometry , lattice , polygon , geometry

Which is the least positive integer $n$ for which it is possible to find a (non-degenerate) $n$-gon with sidelengths $1, 2,. . . , n$, and where all vertices have integer coordinates?

1978 Chisinau City MO, 168

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

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

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]

1989 Austrian-Polish Competition, 4

Tags: convex , polygon , geometry , combinatorial geometry , circles

Let $P$ be a convex polygon in the plane. Show that there exists a circle containing the entire polygon $P$ and having at least three adjacent vertices of $P$ on its boundary.

2009 Dutch IMO TST, 5

Tags: geometry , rational , polygon , equal segments , analytic geometry

Suppose that we are given an $n$-gon of which all sides have the same length, and of which all the vertices have rational coordinates. Prove that $n$ is even.

2007 IMO Shortlist, 8

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]

1979 IMO Longlists, 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).

1971 Bulgaria National Olympiad, Problem 5

Tags: geometry , trigonometry , polygon

Let $A_1,A_2,\ldots,A_{2n}$ are the vertices of a regular $2n$-gon and $P$ is a point from the incircle of the polygon. If $\alpha_i=\angle A_iPA_{i+n}$, $i=1,2,\ldots,n$. Prove the equality $$\sum_{i=1}^n\tan^2\alpha_i=2n\frac{\cos^2\frac\pi{2n}}{\sin^4\frac\pi{2n}}.$$

2004 IMO Shortlist, 6

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

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]

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

Each vertex of a right $n$-gon $(n\geq 3)$ is colored in yellow, blue or red. On each turn are chosen two adjacent vertices in different color and then are recolored in the third. For which $n$ can we get from an arbitrary coloring of the $n$-gon a monochromatic one (in one color)?

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

1971 IMO Shortlist, 14

Tags: combinatorics , length , point set , polygon

A broken line $A_1A_2 \ldots A_n$ is drawn in a $50 \times 50$ square, so that the distance from any point of the square to the broken line is less than $1$. Prove that its total length is greater than $1248.$

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

1998 Austrian-Polish Competition, 8

Tags: polygon , combinatorial geometry , 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$.)

2006 IMO, 2

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

2015 IMO Shortlist, G8

Tags: geometry , triangulation , polygon

A [i]triangulation[/i] of a convex polygon $\Pi$ is a partitioning of $\Pi$ into triangles by diagonals having no common points other than the vertices of the polygon. We say that a triangulation is a [i]Thaiangulation[/i] if all triangles in it have the same area. Prove that any two different Thaiangulations of a convex polygon $\Pi$ differ by exactly two triangles. (In other words, prove that it is possible to replace one pair of triangles in the first Thaiangulation with a different pair of triangles so as to obtain the second Thaiangulation.) [i]Proposed by Bulgaria[/i]

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.

2009 Dutch IMO TST, 5

Tags: geometry , rational , polygon , equal segments , analytic geometry

Suppose that we are given an $n$-gon of which all sides have the same length, and of which all the vertices have rational coordinates. Prove that $n$ is even.