Olympiad problems

2000 Czech And Slovak Olympiad IIIA, 3

In the plane are given $2000$ congruent triangles of area $1$, which are all images of one triangle under translations. Each of these triangles contains the centroid of every other triangle. Prove that the union of these triangles has area less than $22/9$.

1999 Tournament Of Towns, 5

Tags: combinatorial geometry , combinatorics , rectangle , tiling

Is it possible to divide a $8 \times 8$ chessboard into $32$ rectangles, each either $1 \times 2$ or $2 \times 1$, and to draw exactly one diagonal on each rectangle such that no two of these diagonals have a common endpoint? (A Shapovalov)

1988 Spain Mathematical Olympiad, 2

Tags: combinatorics , combinatorial geometry

We choose $n > 3$ points on a circle and number them $1$ to $ n$ in some order. We say that two non-adjacent points $A$ and $B$ are related if, in one of the arcs $AB$, all the points are marked with numbers less than those at $A,B$. Show that the number of pairs of related points is exactly $n-3$.

2002 Junior Balkan Team Selection Tests - Romania, 4

Tags: area , geometric inequalities , combinatorial geometry , geometry , combinatorics

Five points are given in the plane that each of $10$ triangles they define has area greater than $2$. Prove that there exists a triangle of area greater than $3$.

2003 Bosnia and Herzegovina Team Selection Test, 5

Tags: polygon , quadrilateral , combinatorial geometry , combinatorics

It is given regular polygon with $2n$ sides and center $S$. Consider every quadrilateral with vertices as vertices of polygon. Let $u$ be number of such quadrilaterals which contain point $S$ inside and $v$ number of remaining quadrilaterals. Find $u-v$

1984 Kurschak Competition, 2

Tags: geometry , combinatorics , combinatorial geometry

$A_1B_1A_2$, $B_1A_2B_2$, $A_2B_2A_3$,...,$B_{13}A_{14}B_{14}$, $A_{14}B_{14}A_1$ and $B_{14}A_1B_1$ are equilateral rigid plates that can be folded along the edges $A_1B_1$,$B_1A_2$, ..., $A_{14}B_{14}$ and $B_{14}A_1$ respectively. Can they be folded so that all $28$ plates lie in the same plane?

1997 Croatia National Olympiad, Problem 4

Tags: geometry , rectangle , combinatorics , combinatorial geometry

An infinite sheet of paper is divided into equal squares, some of which are colored red. In each $2\times3$ rectangle, there are exactly two red squares. Now consider an arbitrary $9\times11$ rectangle. How many red squares does it contain? (The sides of all considered rectangles go along the grid lines.)

2023 Romanian Master of Mathematics, 2

Tags: combinatorics , combinatorial geometry

Fix an integer $n \geq 3$. Let $\mathcal{S}$ be a set of $n$ points in the plane, no three of which are collinear. Given different points $A,B,C$ in $\mathcal{S}$, the triangle $ABC$ is [i]nice[/i] for $AB$ if $[ABC] \leq [ABX]$ for all $X$ in $\mathcal{S}$ different from $A$ and $B$. (Note that for a segment $AB$ there could be several nice triangles). A triangle is [i] beautiful [/i] if its vertices are all in $\mathcal{S}$ and is nice for at least two of its sides. Prove that there are at least $\frac{1}{2}(n-1)$ beautiful triangles.

1983 All Soviet Union Mathematical Olympiad, 369

Tags: segment , combinatorial geometry , geometry

The $M$ set consists of $k$ non-intersecting segments on the line. It is possible to put an arbitrary segment shorter than $1$ cm on the line in such a way, that his ends will belong to $M$. Prove that the total sum of the segment lengths is not less than $1/k$ cm.

2022 Malaysian IMO Team Selection Test, 2

Tags: combinatorial geometry , combinatorics

Let $\mathcal{S}$ be a set of $2023$ points in a plane, and it is known that the distances of any two different points in $S$ are all distinct. Ivan colors the points with $k$ colors such that for every point $P \in \mathcal{S}$, the closest and the furthest point from $P$ in $\mathcal{S}$ also have the same color as $P$. What is the maximum possible value of $k$? [i]Proposed by Ivan Chan Kai Chin[/i]

1971 IMO Shortlist, 16

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

Let $P_1$ be a convex polyhedron with vertices $A_1,A_2,\ldots,A_9$. Let $P_i$ be the polyhedron obtained from $P_1$ by a translation that moves $A_1$ to $A_i$. Prove that at least two of the polyhedra $P_1,P_2,\ldots,P_9$ have an interior point in common.

2015 Irish Math Olympiad, 2

Tags: coloring , regular polygon , combinatorics , combinatorial geometry

A regular polygon with $n \ge 3$ sides is given. Each vertex is coloured either red, green or blue, and no two adjacent vertices of the polygon are the same colour. There is at least one vertex of each colour. Prove that it is possible to draw certain diagonals of the polygon in such a way that they intersect only at the vertices of the polygon and they divide the polygon into triangles so that each such triangle has vertices of three different colours.

1972 Dutch Mathematical Olympiad, 1

Tags: equilateral , geometry , combinatorics , combinatorial geometry

Prove that for every $n \in N$, $n > 6$, every equilateral triangle can be divided into $n$ pieces, which are also equilateral triangles.

2023 Olympic Revenge, 4

Tags: geometry , 3d geometry , sphere , combinatorial geometry , combinatorics , lattice points

Let $S=\{(x,y,z)\in \mathbb{Z}^3\}$ the set of points with integer coordinates in the space. Gugu has infinitely many solid spheres. All with radii $\ge (\frac{\pi}2)^3$. Is it possible for Gugu to cover all points of $S$ with his spheres?

2009 Argentina National Olympiad, 1

Tags: coloring , combinatorial geometry , combinatorics

$2009$ points have been marked on a circle. Lucía colors them with $7$ different colors of her choice. Then Ivan can join three points of the same color, thus forming monochrome triangles. Triangles cannot have points in common; not even vertices in common. Ivan's goal is to draw as many monochrome triangles as possible. Lucía's objective is to prevent Iván's task as much as possible through a good choice of colouring. How many monochrome triangles will Ivan get if they both do their homework to the best of their ability?

1989 Tournament Of Towns, (231) 5

Tags: combinatorics , combinatorial geometry , tiling

A rectangular $M \times N$ board is divided into $1 \times $ cells. There are also many domino pieces of size $1 \times 2$. These pieces are placed on a board so that each piece occupies two cells. The board is not entirely covered, but it is impossible to move the domino pieces (the board has a frame, so that the pieces cannot stick out of it). Prove that the number of uncovered cells is (a) less than $\frac14 MN$, (b) less than $\frac15 MN$.

2009 Canada National Olympiad, 5

Tags: geometry , circumcircle , combinatorial geometry

A set of points is marked on the plane, with the property that any three marked points can be covered with a disk of radius $1$. Prove that the set of all marked points can be covered with a disk of radius $1$.

1995 All-Russian Olympiad Regional Round, 10.4

Tags: geometry , rectangle , combinatorics , combinatorial geometry

There are several equal (possibly overlapping) square-shaped napkins on a rectangular table, with sides parallel to the sides of the table. Prove that it is possible to nail some of them to the table in such a way that every napkin is nailed exactly once.

2017 QEDMO 15th, 2

Tags: coloring , chessboard , combinatorics , combinatorial geometry

Markers in the colors violet, cyan, octarine and gamma were placed on all fields of a $41\times 5$ chessboard. Show that there are four squares of the same color that form the vertices of a rectangle whose edges are parallel to those of the board.

2001 Chile National Olympiad, 1

Tags: geometry , perimeter , combinatorial geometry , combinatorics

$\bullet$ In how many ways can triangles be formed whose sides are integers greater than $50$ and less than $100$? $\bullet$ In how many of these triangles is the perimeter divisible by $3$?

2016 IMAR Test, 2

Tags: combinatorial geometry , combinatorics , point , intersection , line , polygon

Given a positive integer $n$, does there exist a planar polygon and a point in its plane such that every line through that point meets the boundary of the polygon at exactly $2n$ points?

1996 All-Russian Olympiad Regional Round, 10.8

Tags: geometry , combinatorics , combinatorial geometry , coloring

There are $1996$ points marked on a straight line at regular intervals. Petya colors half of them red and the rest blue. Then Vasya divides them into pairs ''red'' - ''blue'' so that the sum distances between points in pairs was maximum. Prove that this maximum does not depend on what coloring Petya made.

2013 Portugal MO, 6

Tags: combinatorics , regular , equal angles , combinatorial geometry , geometry

In each side of a regular polygon with $n$ sides, we choose a point different from the vertices and we obtain a new polygon of $n$ sides. For which values of $n$ can we obtain a polygon such that the internal angles are all equal but the polygon isn't regular?

2009 Romanian Masters In Mathematics, 2

Tags: analytic geometry , modular arithmetic , combinatorics , number theory , combinatorial geometry

A set $ S$ of points in space satisfies the property that all pairwise distances between points in $ S$ are distinct. Given that all points in $ S$ have integer coordinates $ (x,y,z)$ where $ 1 \leq x,y, z \leq n,$ show that the number of points in $ S$ is less than $ \min \Big((n \plus{} 2)\sqrt {\frac {n}{3}}, n \sqrt {6}\Big).$ [i]Dan Schwarz, Romania[/i]

2021 Irish Math Olympiad, 10

Tags: combinatorics , combinatorial geometry , centroid , geometry

Let $P_{1}, P_{2}, \ldots, P_{2021}$ be 2021 points in the quarter plane $\{(x, y): x \geq 0, y \geq 0\}$. The centroid of these 2021 points lies at the point $(1,1)$. Show that there are two distinct points $P_{i}, P_{j}$ such that the distance from $P_{i}$ to $P_{j}$ is no more than $\sqrt{2} / 20$.