This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 200

1986 IMO Longlists, 47

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

1975 Bulgaria National Olympiad, Problem 2

Let $F$ be a polygon the boundary of which is a broken line with vertices in the knots (units) of a given in advance regular square network. If $k$ is the count of knots of the network situated over the boundary of $F$, and $\ell$ is the count of the knots of the network lying inside $F$, prove that if the surface of every square from the network is $1$, then the surface $S$ of $F$ is calculated with the formulae: $$S=\frac k2+\ell-1$$ [i]V. Chukanov[/i]

1999 Nordic, 2

Consider $7$-gons inscribed in a circle such that all sides of the $7$-gon are of different length. Determine the maximal number of $120^\circ$ angles in this kind of a $7$-gon.

Kvant 2020, M2629

Tags: geometry , polygon , area
The figure shows an arbitrary (green) triangle in the center. White squares were built on its sides to the outside. Some of their vertices were connected by segments, white squares were built on them again to the outside, and so on. In the spaces between the squares, triangles and quadrilaterals were formed, which were painted in different colors. Prove that [list=a] [*]all colored quadrilaterals are trapezoids; [*]the areas of all polygons of the same color are equal; [*]the ratios of the bases of one-color trapezoids are equal; [*]if $S_0=1$ is the area of the original triangle, and $S_i$ is the area of the colored polygons at the $i^{\text{th}}$ step, then $S_1=1$, $S_2=5$ and for $n\geqslant 3$ the equality $S_n=5S_{n-1}-S_{n-2}$ is satisfied. [/list] [i]Proposed by F. Nilov[/i] [center][img width="40"]https://i.ibb.co/n8gt0pV/Screenshot-2023-03-09-174624.png[/img][/center]

2015 FYROM JBMO Team Selection Test, 5

$A$ and $B$ are two identical convex polygons, each with an area of $2015$. The polygon $A$ is divided into polygons $A_1, A_2,...,A_{2015}$, while $B$ is divided into polygons $B_1, B_2,...,B_{2015}$. Each of these smaller polygons has a positive area. Furthermore, $A_1, A_2,...,A_{2015}$ and $B_1, B_2,...,B_{2015}$ are colored in $2015$ distinct colors, such that $A_i$ and $A_j$ are differently colored for every distinct $i$ and $j$ and $B_i$ and $B_j$ are also differently colored for every distinct $i$ and $j$. After $A$ and $B$ overlap, we calculate the sum of the areas with the same colors. Prove that we can color the polygons such that this sum is at least $1$.

1976 Bulgaria National Olympiad, Problem 1

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]

2005 Sharygin Geometry Olympiad, 2

Cut a cross made up of five identical squares into three polygons, equal in area and perimeter.

2020 Tournament Of Towns, 3

Is it possible to inscribe an $N$-gon in a circle so that all the lengths of its sides are different and all its angles (in degrees) are integer, where a) $N = 19$, b) $N = 20$ ? Mikhail Malkin

2011 Tournament of Towns, 4

There are $n$ red sticks and $n$ blue sticks. The sticks of each colour have the same total length, and can be used to construct an $n$-gon. We wish to repaint one stick of each colour in the other colour so that the sticks of each colour can still be used to construct an $n$-gon. Is this always possible if (a) $n = 3$, (b) $n > 3$ ?

Russian TST 2014, P2

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.

2006 Germany Team Selection Test, 3

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]

2016 Sharygin Geometry Olympiad, 4

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

1992 IMO Longlists, 59

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 .\]

Kvant 2020, M2608

Tags: geometry , polygon
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]

1982 IMO, 3

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

2019 Auckland Mathematical Olympiad, 3

Tags: polygon , geometry
There is a finite number of polygons in a plane and each two of them have a point in common. Prove that there exists a line which crosses every polygon.

2023 Romania Team Selection Test, P2

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]

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)

1999 German National Olympiad, 4

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

2019 BMT Spring, 11

A regular $17$-gon with vertices $V_1, V_2, . . . , V_{17}$ and sides of length $3$ has a point $ P$ on $V_1V_2$ such that $V_1P = 1$. A chord that stretches from $V_1$ to $V_2$ containing $ P$ is rotated within the interior of the heptadecagon around $V_2$ such that the chord now stretches from $V_2$ to $V_3$. The chord then hinges around $V_3$, then $V_4$, and so on, continuing until $ P$ is back at its original position. Find the total length traced by $ P$.

1949 Moscow Mathematical Olympiad, 157

a) Prove that if a planar polygon has several axes of symmetry, then all of them intersect at one point. b) A finite solid body is symmetric about two distinct axes. Describe the position of the symmetry planes of the body.

1967 Polish MO Finals, 5

Prove that if a cyclic polygon with an odd number of sides has all angles equal, then this polygon is regular.

2007 Sharygin Geometry Olympiad, 5

Tags: geometry , cut , polygon , area
A non-convex $n$-gon is cut into three parts by a straight line, and two parts are put together so that the resulting polygon is equal to the third part. Can $n$ be equal to: a) five? b) four?

2015 Bundeswettbewerb Mathematik Germany, 1

Tags: geometry , polygon
Twelve 1-Euro-coins are laid flat on a table, such that their midpoints form a regular $12$-gon. Adjacent coins are tangent to each other. Prove that it is possible to put another seven such coins into the interior of the ring of the twelve coins.

1970 IMO Longlists, 8

Consider a regular $2n$-gon and the $n$ diagonals of it that pass through its center. Let $P$ be a point of the inscribed circle and let $a_1, a_2, \ldots , a_n$ be the angles in which the diagonals mentioned are visible from the point $P$. Prove that \[\sum_{i=1}^n \tan^2 a_i = 2n \frac{\cos^2 \frac{\pi}{2n}}{\sin^4 \frac{\pi}{2n}}.\]