Olympiad problems

2010 Sharygin Geometry Olympiad, 8

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

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.

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

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.

1951 Moscow Mathematical Olympiad, 195

Tags: pyramid , concentric circles , tangential , geometry , 3d geometry , polygon

We have two concentric circles. A polygon is circumscribed around the smaller circle and is contained entirely inside the greater circle. Perpendiculars from the common center of the circles to the sides of the polygon are extended till they intersect the greater circle. Each of the points obtained is connected with the endpoints of the corresponding side of the polygon . When is the resulting star-shaped polygon the unfolding of a pyramid?

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?

2009 Kyiv Mathematical Festival, 3

Tags: combinatorics , polygon

Let $AB$ be a segment of a plane. Is it possible to paint the plane in $2009$ colors in such a way that both of the following conditions are satisfied? 1) Every two points of the same color can be connected by a polygonal line. 2) For any point $C$ of $AB$, every $n \in N$ and every $k\in \{1,2,3,...,2009\}$ , there exists a point $D$, painted in $k$-th color such that the length of $CD$ is less than $0,0...01$, where all the zeros after the decimal point are exactly $n$.

2010 IFYM, Sozopol, 5

Tags: polygon , combinatorics

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?

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.

2016 Saint Petersburg Mathematical Olympiad, 6

Tags: combinatorics , combinatorial geometry , odd , polygon , clo

The circle contains a closed $100$-part broken line, such that no three segments pass through one point. All its corners are obtuse, and their sum in degrees is divided by $720$. Prove that this broken line has an odd number of self-intersection points.

2005 Austrian-Polish Competition, 1

Tags: enumeration , polygon , combinatorics

For a convex $n$-gon $P_n$, we say that a convex quadrangle $Q$ is a [i]diagonal-quadrangle[/i] of $P_n$, if its vertices are vertices of $P_n$ and its sides are diagonals of $P_n$. Let $d_n$ be the number of diagonal-quadrangles of a convex $n$-gon. Determine $d_n$ for all $n\geq 8$.

2000 IMO Shortlist, 4

Tags: trigonometry , geometry , cyclic , polygon

Let $ A_1A_2 \ldots A_n$ be a convex polygon, $ n \geq 4.$ Prove that $ A_1A_2 \ldots A_n$ is cyclic if and only if to each vertex $ A_j$ one can assign a pair $ (b_j, c_j)$ of real numbers, $ j = 1, 2, \ldots, n,$ so that $ A_iA_j = b_jc_i - b_ic_j$ for all $ i, j$ with $ 1 \leq i < j \leq n.$

1971 IMO Longlists, 45

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

2007 IMAC Arhimede, 6

Tags: geometry , convex , convex polygon , polygon

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

1995 Romania Team Selection Test, 1

Tags: coloring , polygon , combinatorics , combinatorial geometry

How many colorings of an $n$-gon in $p \ge 2$ colors are there such that no two neighboring vertices have the same color?

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]

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

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

1963 IMO, 3

Tags: inequalities , geometry , polygon , geometric inequality , angle

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

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.

1989 Tournament Of Towns, (241) 5

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

We are given $100$ points. $N$ of these are vertices of a convex $N$-gon and the other $100 - N$ of these are inside this $N$-gon. The labels of these points make it impossible to tell whether or not they are vertices of the $N$-gon. It is known that no three points are collinear and that no $4$ points belong to two parallel lines. It has been decided to ask questions of the following type: What is the area of the triangle $XYZ$, where $X, Y$ and $Z$ are labels representing three of the $100$ given points? Prove that $300$ such questions are sufficient in order to clarify which points are vertices and to determine the area of the $N$-gon. (D. Fomin, Leningrad)

2006 Germany Team Selection Test, 3

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

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]

1957 Moscow Mathematical Olympiad, 356

Tags: combinatorial geometry , combinatorics , geometry , polygon

A planar polygon $A_1A_2A_3 . . .A_{n-1}A_n$ ($n > 4$) is made of rigid rods that are connected by hinges. Is it possible to bend the polygon (at hinges only!) into a triangle?

2023 Sharygin Geometry Olympiad, 14

Tags: geometry , polygon , winding number

Suppose that a closed oriented polygonal line $\mathcal{L}$ in the plane does not pass through a point $O$, and is symmetric with respect to $O$. Prove that the winding number of $\mathcal{L}$ around $O$ is odd. The winding number of $\mathcal{L}$ around $O$ is defined to be the following sum of the oriented angles divided by $2\pi$: $$\deg_O\mathcal{L} := \dfrac{\angle A_1OA_2+\angle A_2OA_3+\dots+\angle A_{n-1}OA_n+\angle A_nOA_1}{2\pi}.$$

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.