Olympiad problems

1997 German National Olympiad, 6b

An approximate construction of a regular pentagon goes as follows. Inscribe an arbitrary convex pentagon $P_1P_2P_3P_4P_5$ in a circle. Now choose an arror bound $\epsilon > 0$ and apply the following procedure. (a) Denote $P_0 = P_5$ and $P_6 = P_1$ and construct the midpoint $Q_i$ of the circular arc $P_{i-1}P_{i+1}$ containing $P_i$. (b) Rename the vertices $Q_1,...,Q_5$ as $P_1,...,P_5$. (c) Repeat this procedure until the difference between the lengths of the longest and the shortest among the arcs $P_iP_{i+1}$ is less than $\epsilon$. Prove this procedure must end in a finite time for any choice of $\epsilon$ and the points $P_i$.

1969 IMO, 5

Tags: combinatorics , combinatorial geometry , counting , convex quadrilateral

Given $n>4$ points in the plane, no three collinear. Prove that there are at least $\frac{(n-3)(n-4)}{2}$ convex quadrilaterals with vertices amongst the $n$ points.

1968 Dutch Mathematical Olympiad, 5

Tags: geometry , rectangle , combinatorics , combinatorial geometry

A square of side $n$ ($n$ natural) is divided into $n^2$ squares of side $1$. Each pair of "horizontal" boundary lines and each pair of "vertical" boundary lines enclose a rectangle (a square is also considered a rectangle). A rectangle has a length and a width; the width is less than or equal to the length. (a) Prove that there are $8$ rectangles of width $n - 1$. (b) Determine the number of rectangles with width $n -k$ ($0\le k \le n -1,k$ integer). (c) Determine a formula for $1^3 + 2^3 +...+ n^3$.

1987 Polish MO Finals, 6

Tags: tiling , combinatorics , combinatorial geometry , hexagon

A plane is tiled with regular hexagons of side $1$. $A$ is a fixed hexagon vertex. Find the number of paths $P$ such that: (1) one endpoint of $P$ is $A$, (2) the other endpoint of $P$ is a hexagon vertex, (3) $P$ lies along hexagon edges, (4) $P$ has length $60$, and (5) there is no shorter path along hexagon edges from $A$ to the other endpoint of $P$.

1994 North Macedonia National Olympiad, 5

Tags: tiling , combinatorics , combinatorial geometry

A square with the dimension $ 1 \times1 $ has been removed from a square board $ 3 ^n \times 3 ^n $ ($ n \in \mathbb {N}, $ $ n> 1 $). a) Prove that any defective board with the dimension $ 3 ^ n \times3 ^ n $ can be covered with shaped figures of shape 1 (the 3 squares' one) and of shape 2 (the 5 squares' one). Figures covering the board must not overlap each other and must not cross the edge of the board. Also the squares removed from the board must not be covered. (b) How many small figures in shape 2 must be used to cover the board? [img]https://cdn.artofproblemsolving.com/attachments/4/7/e970fadd7acc7fd6f5897f1766a84787f37acc.png[/img]

1998 Israel National Olympiad, 3

Tags: combinatorics , combinatorial geometry

A configuration of several checkers at the centers of squares on a rectangular sheet of grid paper is called [i]boring [/i] if some four checkers occupy the vertices of a rectangle with sides parallel to those of the sheet. (a) Prove that any configuration of more than $3mn/4$ checkers on an $m\times n$ grid is boring. (b) Prove that any configuration of $26$ checkers on a $7\times 7$ grid is boring.

1992 Miklós Schweitzer, 9

Tags: combinatorial geometry , euclidean geometry , convex geometry

Let K be a bounded, d-dimensional convex polyhedron that is not simplex and P is a point on K. Show that if vertices $P_1 , ..., P_k$ are not all on the same face of K, then one of them can be omitted so that the convex hull of the remaining vertices of K still contains P. [hide=note]caratheodory's theorem might be useful. [/hide]

2020 Puerto Rico Team Selection Test, 4

Tags: rectangle , combinatorics , combinatorial geometry

Determine all integers $m$, for which it is possible to dissect the square $m\times m$ into five rectangles, with the side lengths being the integers $1, 2, … ,10$ in some order.

1997 Estonia National Olympiad, 4

Tags: combinatorics , line , combinatorial geometry

There are $19$ lines in the plane dividing the plane into exactly $97$ pieces. (a) Prove that among these pieces there is at least one triangle. (b) Show that it is indeed possible to place $19$ lines in the above way.

Russian TST 2016, P1

Tags: combinatorics , coloring , combinatorial geometry , point

$101$ blue and $101$ red points are selected on the plane, and no three lie on one straight line. The sum of the pairwise distances between the red points is $1$ (that is, the sum of the lengths of the segments with ends at red points), the sum of the pairwise distances between the blue ones is also $1$, and the sum of the lengths of the segments with the ends of different colors is $400$. Prove that you can draw a straight line separating everything red dots from all blue ones.

2018 Estonia Team Selection Test, 2

Tags: combinatorics , combinatorial geometry , square table , grid

Find the greatest number of depicted pieces composed of $4$ unit squares that can be placed without overlapping on an $n \times n$ grid (where n is a positive integer) in such a way that it is possible to move from some corner to the opposite corner via uncovered squares (moving between squares requires a common edge). The shapes can be rotated and reflected. [img]https://cdn.artofproblemsolving.com/attachments/b/d/f2978a24fdd737edfafa5927a8d2129eb586ee.png[/img]

2019 Czech-Polish-Slovak Junior Match, 5

Tags: geometry , geometric transformation , rotation , combinatorial geometry , combinatorics

Let $A_1A_2 ...A_{360}$ be a regular $360$-gon with centre $S$. For each of the triangles $A_1A_{50}A_{68}$ and $A_1A_{50}A_{69}$ determine, whether its images under some $120$ rotations with centre $S$ can have (as triangles) all the $360$ points $A_1, A_2, ..., A_{360}$ as vertices.

1983 Tournament Of Towns, (042) O5

Tags: combinatorial geometry , combinatorics , projection , regular polygon

A point is chosen inside a regular $k$-gon in such a way that its orthogonal projections on to the sides all meet the respective sides at interior points. These points divide the sides into $2k$ segments. Let these segments be enumerated consecutively by the numbers $1,2, 3, ... ,2k$. Prove that the sum of the lengths of the segments having even numbers equals the sum of the segments having odd numbers. (A Andjans, Riga)

2016 Tournament Of Towns, 3

Tags: combinatorics , combinatorial geometry

Given a square with side $10$. Cut it into $100$ congruent quadrilaterals such that each of them is inscribed into a circle with diameter $\sqrt{3}$. [i](5 points)[/i] [i]Ilya Bogdanov[/i]

2010 Saudi Arabia IMO TST, 1

Tags: combinatorial geometry , geometry , combinatorics , obtuse triangle

Let $A_1A_2...A_{2010}$ be a regular $2010$-gon. Find the number of obtuse triangles whose vertices are among $A_1$, $A_2$,$ ...$, $A_{2010}$.

1999 May Olympiad, 4

Tags: combinatorial geometry , combinatorics

Ten square cardboards of $3$ centimeters on a side are cut by a line, as indicated in the figure. After the cuts, there are $20$ pieces: $10$ triangles and $10$ trapezoids. Assemble a square that uses all $20$ pieces without overlaps or gaps. [img]https://cdn.artofproblemsolving.com/attachments/7/9/ec2242cca617305b02eef7a5409e6a6b482d66.gif[/img]

2004 May Olympiad, 5

Tags: combinatorics , combinatorial geometry

On a $ 9\times 9$ board, divided into $1\times 1$ squares, pieces of the form Each piece covers exactly $3$ squares. (a) Starting from the empty board, what is the maximum number of pieces that can be placed? (b) Starting from the board with $3$ pieces already placed as shown in the diagram below, what is the maximum number of pieces that can be placed? [img]https://cdn.artofproblemsolving.com/attachments/d/4/3bd010828accb2d1811d49eb17fa69662ff60d.gif[/img]

2021 Durer Math Competition (First Round), 5

Tags: combinatorial geometry , line , 3d geometry , geometry , plane , combinatorics

There are $n$ distinct lines in three-dimensional space such that no two lines are parallel and no three lines meet at one point. What is the maximal possible number of planes determined by these $n$ lines? We say that a plane is determined if it contains at least two of the lines.

1963 All Russian Mathematical Olympiad, 039

Tags: combinatorics , combinatorial geometry

On the ends of the diameter two "$1$"s are written. Each of the semicircles is divided onto two parts and the sum of the numbers of its ends (i.e. "$2$") is written at the midpoint. Then every of the four arcs is halved and in its midpoint the sum of the numbers on its ends is written. Find the total sum of the numbers on the circumference after $n$ steps.

1984 Swedish Mathematical Competition, 1

Tags: geometry , combinatorial geometry , interior , circles

Let $A$ and $B$ be two points inside a circle $C$. Show that there exists a circle that contains $A$ and $B$ and lies completely inside $C$.

2006 Junior Tuymaada Olympiad, 3

Tags: geometry , convex polygon , area of a triangle , combinatorial geometry

Given a convex $ n $-gon ($ n \geq 5 $). Prove that the number of triangles of area $1$ with vertices at the vertices of the $ n $-gon does not exceed $ \frac{1}{3} n (2n-5) $.

2014 Ukraine Team Selection Test, 1

Tags: combinatorics , combinatorial geometry

Given an integer $n \ge 2$ and a regular $2n$-polygon at each vertex of which sitting on an ant. At some points in time, each ant creeps into one of two adjacent peaks (some peaks may have several ants at a time). Through $k$ such operations, it turned out to be an arbitrary line connecting two different ones the vertices of a polygon with ants do not pass through its center. For given $n$ find the lowest possible value of $k$.

1990 Tournament Of Towns, (261) 5

Tags: combinatorial geometry , geometry , 3d geometry , polyhedron

Does there exist a convex polyhedron which has a triangular section (by a plane not passing through the vertices) and each vertex of the polyhedron belonging to (a) no less than $ 5$ faces? (b) exactly $5$ faces? (G. Galperin)

2015 Swedish Mathematical Competition, 6

Tags: combinatorial geometry , game , game strategy , winning strategy

Axel and Berta play the following games: On a board are a number of positive integers. One move consists of a player exchanging a number $x$ on the board for two positive integers y and $z$ (not necessarily different), such that $y + z = x$. The game ends when the numbers on the board are relatively coprime in pairs. The player who made the last move has then lost the game. At the beginning of the game, only the number $2015$ is on the board. The two players make do their moves in turn and Berta begins. One of the players has a winning strategy. Who, and why?

2016 239 Open Mathematical Olympiad, 8

Tags: combinatorial geometry , combinatorics

There are $n$ triangles inscribed in a circle and all $3n$ of their vertices are different. Prove that it is possible to put a boy in one of the vertices in each triangle, and a girl in the other, so that boys and girls alternate on a circle.