Olympiad problems

2022 Sharygin Geometry Olympiad, 8.7

Ten points on a plane a such that any four of them lie on the boundary of some square. Is obligatory true that all ten points lie on the boundary of some square?

2020 DMO Stage 1, 2.

Tags: combinatorics , combinatorial geometry

[b]Q.[/b] Consider in the plane $n>3$ different points. These have the properties, that all $3$ points can be included in a triangle with maximum area $1$. Prove that all the $n>3$ points can be included in a triangle with maximum area $4$. [i]Proposed by TuZo[/i]

2000 IMO Shortlist, 3

Tags: geometry , combinatorics , counting , combinatorial geometry

Let $ n \geq 4$ be a fixed positive integer. Given a set $ S \equal{} \{P_1, P_2, \ldots, P_n\}$ of $ n$ points in the plane such that no three are collinear and no four concyclic, let $ a_t,$ $ 1 \leq t \leq n,$ be the number of circles $ P_iP_jP_k$ that contain $ P_t$ in their interior, and let \[m(S)=a_1+a_2+\cdots + a_n.\] Prove that there exists a positive integer $ f(n),$ depending only on $ n,$ such that the points of $ S$ are the vertices of a convex polygon if and only if $ m(S) = f(n).$

1992 Romania Team Selection Test, 1

Tags: geometry , rectangle , combinatorics , collinear , combinatorial geometry

Let $S > 1$ be a real number. The Cartesian plane is partitioned into rectangles whose sides are parallel to the axes of the coordinate system. and whose vertices have integer coordinates. Prove that if the area of each triangle if at most $S$, then for any positive integer $k$ there exist $k$ vertices of these rectangles which lie on a line.

2019 Baltic Way, 10

Tags: combinatorial geometry , combinatorics

There are $2019$ points given in the plane. A child wants to draw $k$ (closed) discs in such a manner, that for any two distinct points there exists a disc that contains exactly one of these two points. What is the minimal $k$, such that for any initial configuration of points it is possible to draw $k$ discs with the above property?

1984 Polish MO Finals, 5

Tags: hexagon , circles , disks , combinatorial geometry , geometry

A regular hexagon of side $1$ is covered by six unit disks. Prove that none of the vertices of the hexagon is covered by two (or more) discs.

2003 Federal Math Competition of S&M, Problem 2

Tags: geometry , combinatorial geometry , combinatorics

Given a segment $AB$ of length $2003$ in a coordinate plane, determine the maximal number of unit squares with vertices in the lattice points whose intersection with the given segment is non-empty.

2022 Saudi Arabia BMO + EGMO TST, 2.3

Tags: geometry , combinatorial geometry , combinatorics

A rectangle $R$ is partitioned into smaller rectangles whose sides are parallel with the sides of $R$. Let $B$ be the set of all boundary points of all the rectangles in the partition, including the boundary of $R$. Let S be the set of all (closed) segments whose points belong to $B$. Let a maximal segment be a segment in $S$ which is not a proper subset of any other segment in $S$. Let an intersection point be a point in which $4$ rectangles of the partition meet. Let $m$ be the number of maximal segments, $i$ the number of intersection points and $r$ the number of rectangles. Prove that $m + i = r + 3$.

2024 Bangladesh Mathematical Olympiad, P8

Tags: combinatorics , combinatorial geometry

A set consisting of $n$ points of a plane is called a [i]bosonti $n$-point[/i] if any three of its points are located in vertices of an isosceles triangle. Find all positive integers $n$ for which there exists a bosonti $n$-point.

1989 Czech And Slovak Olympiad IIIA, 5

Tags: combinatorics , combinatorial geometry , coloring

Consider a rectangular table $2 \times n.$ Let every cell be dyed either by black or white color in a way that no $2\times 2$ square is completely black. Denote $P_n$ the number of such colorings. Prove that the number $P_{1989}$ is divisible by three and find the greatest power of three that divides them.

2000 Austrian-Polish Competition, 8

Tags: combinatorics , combinatorial geometry , area , triangle area

In the plane are given $27$ points, no three of which are collinear. Four of this points are vertices of a unit square, while the others lie inside the square. Prove that there are three points in this set forming a triangle with area not exceeding $1/48$.

2006 Cuba MO, 3

Tags: combinatorics , combinatorial geometry , coloring

$k$ squares of a $m\times n$ gridded board are painted in such a way that the following property holds: [i]If the centers of four squares are the vertices of a quadrilateral of sides parallel to the edges of the board, then at most two of these boxes must be painted..[/i] Find the largest possible value of $k$.

1988 Austrian-Polish Competition, 9

Tags: rectangle , integer sidelengths , covering , combinatorial geometry , combinatorics

For a rectangle $R$ with integral side lengths, denote by $D(a, b)$ the number of ways of covering $R$ by congruent rectangles with integral side lengths formed by a family of cuts parallel to one side of $R$. Determine the perimeter $P$ of the rectangle $R$ for which $\frac{D(a,b)}{a+b}$ is maximal.

1977 Dutch Mathematical Olympiad, 4

Tags: combinatorics , combinatorial geometry , geometry

There are an even number of points in a plane. No three of them lie on one straight line. Half of the points are red, the other half are blue. Prove that there exists a connecting line of a red and a blue point such that in each of the half-planes bounded by that line the number of red points is equal to the number of blue points.

2000 May Olympiad, 4

Tags: geometry , combinatorial geometry , equilateral

There are pieces in the shape of an equilateral triangle with sides $1, 2, 3, 4, 5$ and $6$ ($50$ pieces of each size). You want to build an equilateral triangle of side $7$ using some of these pieces, without gaps or overlaps. What is the least number of pieces needed?

2018 Bosnia And Herzegovina - Regional Olympiad, 5

Tags: plane , combinatorial geometry , covering , combinatorics

It is given $2018$ points in plane. Prove that it is possible to cover them with circles such that: $i)$ sum of lengths of all diameters of all circles is not greater than $2018$ $ii)$ distance between any two circles is greater than $1$

1986 Polish MO Finals, 1

Tags: geometry , rectangle , perimeter , combinatorial geometry , combinatorics , inequalities

A square of side $1$ is covered with $m^2$ rectangles. Show that there is a rectangle with perimeter at least $\frac{4}{m}$.

2010 Federal Competition For Advanced Students, P2, 6

Tags: circumcircle , hexagon , combinatorial geometry , geometry

A diagonal of a convex hexagon is called [i]long[/i] if it decomposes the hexagon into two quadrangles. Each pair of [i]long[/i] diagonals decomposes the hexagon into two triangles and two quadrangles. Given is a hexagon with the property, that for each decomposition by two [i]long[/i] diagonals the resulting triangles are both isosceles with the side of the hexagon as base. Show that the hexagon has a circumcircle.

2014 Belarus Team Selection Test, 3

Tags: combinatorial geometry , combinatorics , coloring

$n$ points are marked on a plane. Each pair of these points is connected with a segment. Each segment is painted one of four different colors. Find the largest possible value of $n$ such that one can paint the segments so that for any four points there are four segments (connecting these four points) of four different colors. (E. Barabanov)

2009 Germany Team Selection Test, 2

Tags: geometry , point set , combinatorial geometry , line

Let $ k$ and $ n$ be integers with $ 0\le k\le n \minus{} 2$. Consider a set $ L$ of $ n$ lines in the plane such that no two of them are parallel and no three have a common point. Denote by $ I$ the set of intersections of lines in $ L$. Let $ O$ be a point in the plane not lying on any line of $ L$. A point $ X\in I$ is colored red if the open line segment $ OX$ intersects at most $ k$ lines in $ L$. Prove that $ I$ contains at least $ \dfrac{1}{2}(k \plus{} 1)(k \plus{} 2)$ red points. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

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

2015 India PRMO, 4

Tags: combinatorial geometry , geometry , 3d geometry

$4.$ How many line segments have both their endpoints located at the vertices of a given cube $?$

2002 IMO, 6

Tags: geometry , combinatorial geometry , geometric inequality , convex hull

Let $n\geq3$ be a positive integer. Let $C_1,C_2,C_3,\ldots,C_n$ be unit circles in the plane, with centres $O_1,O_2,O_3,\ldots,O_n$ respectively. If no line meets more than two of the circles, prove that \[ \sum\limits^{}_{1\leq i<j\leq n}{1\over O_iO_j}\leq{(n-1)\pi\over 4}. \]

1993 Romania Team Selection Test, 3

Tags: combinatorics , combinatorial geometry

Find all integers $n > 1$ for which there is a set $B$ of $n$ points in the plane such that for any $A \in B$ there are three points $X,Y,Z \in B$ with $AX = AY = AZ = 1$.

1982 All Soviet Union Mathematical Olympiad, 336

Tags: broken line , combinatorial geometry , combinatorics

The closed broken line $M$ has odd number of vertices -- $A_1,A_2,..., A_{2n+1}$ in sequence. Let us denote with $S(M)$ a new closed broken line with vertices $B_1,B_2,...,B_{2n+1}$ -- the midpoints of the first line links: $B_1$ is the midpoint of $[A_1A_2], ... , B_{2n+1}$ -- of $[A_{2n+1}A_1]$. Prove that in a sequence $M_1=S(M), ... , M_k = S(M_{k-1}), ...$ there is a broken line, homothetic to the $M$.