Olympiad problems

1947 Putnam, A3

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

2014 Czech-Polish-Slovak Junior Match, 5

Tags: combinatorics , angle , combinatorial geometry , polygon , sum , square

A square is given. Lines divide it into $n$ polygons. What is he the largest possible sum of the internal angles of all polygons?

Russian TST 2014, P2

Tags: polygon , geometry , homothety

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.

1949 Moscow Mathematical Olympiad, 165

Tags: polygon , parallelogram , locus , perimeter , geometry

Consider two triangles, $ABC$ and $DEF$, and any point $O$. We take any point $X$ in $\vartriangle ABC$ and any point $Y$ in $\vartriangle DEF$ and draw a parallelogram $OXY Z$. Prove that the locus of all possible points $Z$ form a polygon. How many sides can it have? Prove that its perimeter is equal to the sum of perimeters of the original triangles.

1974 Bundeswettbewerb Mathematik, 4

Tags: combinatorics , cycle , polygon

All diagonals of a convex polygon are drawn. Prove that its sides and diagonals can be assigned arrows in such a way that no round trip along sides and diagonals is possible.

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

1970 Bulgaria National Olympiad, Problem 5

Tags: inequalities , geometry , geometric inequalities , polygon

Prove that for $n\ge5$ the side of regular inscribable $n$-gon is bigger than the side of regular $n+1$-gon circumscribed around the same circle and if $n\le4$ the opposite statement is true.

2021 Lotfi Zadeh Olympiad, 4

Tags: angle , polygon

Find the number of sequences of $0, 1$ with length $n$ satisfying both of the following properties: [list] [*] There exists a simple polygon such that its $i$-th angle is less than $180$ degrees if and only if the $i$-th element of the sequence is $1$. [*] There exists a convex polygon such that its $i$-th angle is less than $90$ degrees if and only if the $i$-th element of the sequence is $1$. [/list]

Estonia Open Junior - geometry, 2017.1.5

Tags: polygon , geometry , convex , acute

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

1976 All Soviet Union Mathematical Olympiad, 233

Tags: polygon , impossible , combinatorics

Given right $n$-gon wit the point $O$ -- its centre. All the vertices are marked either with $+1$ or $-1$. We may change all the signs in the vertices of regular $k$-gon ($2 \le k \le n$) with the same centre $O$. (By $2$-gon we understand a segment, being halved by $O$.) Prove that in a), b) and c) cases there exists such a set of $(+1)$s and $(-1)$s, that we can never obtain a set of $(+1)$s only. a) $n = 15$, b) $n = 30$, c) $n > 2$, d) Let us denote $K(n)$ the maximal number of $(+1)$ and $(-1)$ sets such, that it is impossible to obtain one set from another. Prove, for example, that $K(200) = 2^{80}$

1977 IMO Longlists, 29

Tags: geometry , complex number , square , polygon

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.

1998 Israel National Olympiad, 7

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

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.

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?

1957 Putnam, B7

Tags: combinatorial geometry , polygon , geometry

Let $C$ consist of a regular polygon and its interior. Show that for each positive integer $n$, there exists a set of points $S(n)$ in the plane such that every $n$ points can be covered by $C$, but $S(n)$ cannot be covered by $C.$

KoMaL A Problems 2019/2020, A. 764

Tags: combinatorics , polygon

We call a diagonal of a polygon [i]nice[/i], if it is entirely inside the polygon or entirely outside the polygon. Let $P$ be an $n$–gon with no three of its vertices being on the same line. Prove that $P$ has at least $3(n-3)/2$ nice diagonals. [i]Proposed by Bálint Hujter, Budapest and Gábor Szűcs, Szikszó[/i]

1971 IMO Longlists, 45

Tags: combinatorics , polygon , length , point set

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

1967 German National Olympiad, 4

Tags: geometry , polygon , counting , obtuse triangle

Given a regular $n$-gon $A_{1}A_{2}...A_{n}$ (with $n\geq 3$) in a plane. How many triangles of the kind $A_{i}A_{j}A_{k}$ are obtuse ?

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

2016 Turkey Team Selection Test, 8

Tags: circumcircle , geometry , polygon

All angles of the convex $n$-gon $A_1A_2\dots A_n$ are obtuse, where $n\ge5$. For all $1\le i\le n$, $O_i$ is the circumcenter of triangle $A_{i-1}A_iA_{i+1}$ (where $A_0=A_n$ and $A_{n+1}=A_1$). Prove that the closed path $O_1O_2\dots O_n$ doesn't form a convex $n$-gon.

1986 All Soviet Union Mathematical Olympiad, 434

Tags: geometry , vector , polygon

Given a regular $n$-gon $A_1A_2...A_n$. Prove that if a) $n$ is even number, than for the arbitrary point $M$ in the plane, it is possible to choose signs in an expression $$\pm \overrightarrow{MA_1} \pm \overrightarrow{MA_2} \pm ... \pm \overrightarrow{MA_n}$$to make it equal to the zero vector . b) $n$ is odd, than the abovementioned expression equals to the zero vector for the finite set of $M$ points only.

Ukrainian TYM Qualifying - geometry, I.7

Tags: geometry , ratio , area , polygon , inscribed

Given a natural number $n> 3$. On the plane are considered convex $n$ - gons $F_1$ and $F_2$ such that on each side of $F_1$ lies one vertex of $F_2$ and no two vertices $F_1$ and $F_2$ coincide. For each $n$, determine the limits of the ratio of the areas of the polygons $F_1$ and $F_2$. For each $n$, determine the range of the areas of the polygons $F_1$ and $F_2$, if $F_1$ is a regular $n$-gon. Determine the set of values of this value for other partial cases of the polygon $F_1$.

1949 Moscow Mathematical Olympiad, 170

Tags: polygon , geometry , symmetry , inscribed

What is a centrally symmetric polygon of greatest area one can inscribe in a given triangle?

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

2018 May Olympiad, 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$.

2004 Germany Team Selection Test, 2

Tags: geometry , angle , combinatorial geometry , polygon , extremal combinatorics , right angle

Let $n \geq 5$ be a given integer. Determine the greatest integer $k$ for which there exists a polygon with $n$ vertices (convex or not, with non-selfintersecting boundary) having $k$ internal right angles. [i]Proposed by Juozas Juvencijus Macys, Lithuania[/i]