Olympiad problems

1987 China Team Selection Test, 2

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.

Ukrainian TYM Qualifying - geometry, 2015.22

Tags: cyclic , polygon , geometry

Let $A_1A_2... A_{2n + 1}$ be a convex polygon, $a_1 = A_1A_2$, $a_2 = A_2A_3$, $...$, $a_{2n} = A_{2n}A_{2n + 1}$, $a_{2n + 1} = A_{2n + 1}A_1$. Denote by: $\alpha_i = \angle A_i$, $1 \le i \le 2n + 1$, $\alpha_{k + 2n + 1} = \alpha_k$, $k \ge 1$, $ \beta_i = \alpha_{i + 2} + \alpha_{i + 4} +... + \alpha_{i + 2n}$, $1 \le i \le 2n + 1$. Prove what if $$\frac{\alpha_1}{\sin \beta_1}=\frac{\alpha_2}{\sin \beta_2}=...=\frac{\alpha_{2n+1}}{\sin \beta_{2n+1}}$$ then a circle can be circumscribed around this polygon. Does the inverse statement hold a place?

2023 Novosibirsk Oral Olympiad in Geometry, 5

Tags: geometry , polygon

A circle of length $10$ is inscribed in a convex polygon with perimeter $15$. What part of the area of this polygon is occupied by the resulting circle?

1982 IMO, 3

Tags: combinatorial geometry , combinatorics , length , polygon , geometry

Let $S$ be a square with sides length $100$. Let $L$ be a path within $S$ which does not meet itself and which is composed of line segments $A_0A_1,A_1A_2,A_2A_3,\ldots,A_{n-1}A_n$ with $A_0=A_n$. Suppose that for every point $P$ on the boundary of $S$ there is a point of $L$ at a distance from $P$ no greater than $\frac {1} {2}$. Prove that there are two points $X$ and $Y$ of $L$ such that the distance between $X$ and $Y$ is not greater than $1$ and the length of the part of $L$ which lies between $X$ and $Y$ is not smaller than $198$.

2016 IFYM, Sozopol, 6

Tags: geometry , polygon

On the sides of a convex, non-regular $m$-gon are built externally regular heptagons. It is known that their centers are vertices of a regular $m$-gon. What’s the least possible value of $m$?

2002 Spain Mathematical Olympiad, Problem 5

Tags: geometry , polygon , plane geometry , vector geometry

Consider $2002$ segments on a plane, such that their lengths are the same. Prove that there exists such a straight line $r$ such that the sum of the lengths of the projections of the $2002$ segments about $r$ is less than $\frac{2}{3}$.

2021 Durer Math Competition (First Round), 3

Tags: geometry , polygon

The floor plan of a contemporary art museum is a (not necessarily convex) polygon and its walls are solid. The security guard guarding the museum has two favourite spots (points $A$ and $B$) because one can see the whole area of the museum standing at either point. Is it true that from any point of the $AB$ section one can see the whole museum?

2008 Brazil Team Selection Test, 4

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]

1998 Israel National Olympiad, 7

Tags: polygon , parallel , combinatorial geometry , combinatorics , geometry

A polygonal line of the length $1001$ is given in a unit square. Prove that there exists a line parallel to one of the sides of the square that meets the polygonal line in at least $500$ points.

1969 IMO Longlists, 52

Tags: geometry , polygon , dissection

Prove that a regular polygon with an odd number of edges cannot be partitioned into four pieces with equal areas by two lines that pass through the center of polygon.

2009 Sharygin Geometry Olympiad, 6

Tags: geometry , polygon

Can four equal polygons be placed on the plane in such a way that any two of them don't have common interior points, but have a common boundary segment? (S.Markelov)

1969 IMO Longlists, 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?

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

1982 IMO Longlists, 55

Tags: geometry , combinatorial geometry , combinatorics , length , polygon

Let $S$ be a square with sides length $100$. Let $L$ be a path within $S$ which does not meet itself and which is composed of line segments $A_0A_1,A_1A_2,A_2A_3,\ldots,A_{n-1}A_n$ with $A_0=A_n$. Suppose that for every point $P$ on the boundary of $S$ there is a point of $L$ at a distance from $P$ no greater than $\frac {1} {2}$. Prove that there are two points $X$ and $Y$ of $L$ such that the distance between $X$ and $Y$ is not greater than $1$ and the length of the part of $L$ which lies between $X$ and $Y$ is not smaller than $198$.

1991 Romania Team Selection Test, 3

Tags: inequalities , coloring , combinatorics , polygon

Let $C$ be a coloring of all edges and diagonals of a convex $n$−gon in red and blue (in Romanian, rosu and albastru). Denote by $q_r(C)$ (resp. $q_a(C)$) the number of quadrilaterals having all its edges and diagonals red (resp. blue). Prove: $ \underset{C}{min} (q_r(C)+q_a(C)) \le \frac{1}{32} {n \choose 4}$

2010 IFYM, Sozopol, 7

Tags: geometry , polygon

Let $M$ be a convex polygon. Externally, on its sides are built squares. It is known that the vertices of these squares, that don’t lie on $M$, lie on a circle $k$. Determine $M$ (its type).

2009 Postal Coaching, 2

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

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.

2007 Sharygin Geometry Olympiad, 6

Tags: geometry , symmetry , 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?

1992 IMO Longlists, 59

Tags: polygon , circumcircle , geometric inequality , 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 .\]

2016 Sharygin Geometry Olympiad, 4

Tags: polygon , cut , regular polygon , geometry

Is it possible to dissect a regular decagon along some of its diagonals so that the resulting parts can form two regular polygons? by N.Beluhov

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 Romania Team Selection Test, P2

Tags: geometry , reflection , polygon

A [i]diagonal line[/i] of a (not necessarily convex) polygon with at least four sides is any line through two non-adjacent vertices of that polygon. Determine all polygons with at least four sides satisfying the following condition: The reflexion of each vertex in each diagonal line lies inside or on the boundary of the polygon. [i]The Problem Selection Committee[/i]

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?

2005 Austrian-Polish Competition, 1

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

1947 Putnam, A3

Tags: geometry , polygon , line

Given a triangle $ABC$ with an interior point $P$ and points $Q_1 , Q_2$ not lying on any of the segments $AB , AC ,BC,$ $AP ,BP ,CP,$ show that there does not exist a polygonal line $K$ joining $Q_1$ and $Q_2$ such that i) $K$ crosses each segment exactly once, ii) $K$ does not intersect itself iii) $K$ does not pass through $A, B , C$ or $P.$