Olympiad problems

2017 Peru IMO TST, 2

Let $n\geq3$ an integer. Mario draws $20$ lines in the plane, such that there are not two parallel lines. For each [b]equilateral triangle[/b] formed by three of these lines, Mario receives three coins. For each [b]isosceles[/b] and [b]non-equilateral[/b] triangle ([u]at the same time[/u]) formed by three of these lines, Mario receives a coin. How is the maximum number of coins that can Mario receive?

2023/2024 Tournament of Towns, 2

Tags: combinatorial geometry

2. A unit square paper has a triangle-shaped hole (vertices of the hole are not on the border of the paper). Prove that a triangle with area of $1 / 6$ can be cut from the remaining paper. Alexandr Yuran

2015 Caucasus Mathematical Olympiad, 3

Tags: combinatorics , combinatorial geometry , tiles , tiling

The workers laid a floor of size $n\times n$ ($10 <n <20$) with two types of tiles: $2 \times 2$ and $5\times 1$. It turned out that they were able to completely lay the floor so that the same number of tiles of each type was used. For which $n$ could this happen? (You can’t cut tiles and also put them on top of each other.)

2023 SG Originals, Q1

Tags: combinatorial geometry

Two straight lines divide a square of side length $1$ into four regions. Show that at least one of the regions has a perimeter greater than or equal to $2$. [i]Proposed by Dylan Toh[/i]

1940 Moscow Mathematical Olympiad, 064

Tags: combinatorics , combinatorial geometry , tiling

How does one tile a plane, without gaps or overlappings, with the tiles equal to a given irregular quadrilateral?

1976 Poland - Second Round, 6

Tags: geometry , combinatorics , combinatorial geometry

Six points are placed on the plane such that each three of them are the vertices of a triangle with sides of different lengths. Prove that the shortest side of one of these triangles is also the longest side of another of them.

Kvant 2021, M2667

Tags: algebra , combinatorics , combinatorial geometry

Does there exist a set $S$ of $100$ points in a plane such that the center of mass of any $10$ points in $S$ is also a point in $S$?

1999 Estonia National Olympiad, 3

Tags: combinatorics , combinatorial geometry

For which values of $n$ it is possible to cover the side wall of staircase of n steps (for $n = 6$ in the figure) with plates of shown shape? The width and height of each step is $1$ dm, the dimensions of plate are $2 \times 2$ dm and from the corner there is cut out a piece with dimensions $1\times 1$ dm. [img]https://cdn.artofproblemsolving.com/attachments/e/e/ac7a52f3dd40480f82024794708c5a449e0c2b.png[/img]

2007 IMO Shortlist, 8

Tags: combinatorics , combinatorial geometry , polygon , extremal combinatorics

Given is a convex polygon $ P$ with $ n$ vertices. Triangle whose vertices lie on vertices of $ P$ is called [i]good [/i] if all its sides are unit length. Prove that there are at most $ \frac {2n}{3}$ [i]good[/i] triangles. [i]Author: Vyacheslav Yasinskiy, Ukraine[/i]

2022 Saudi Arabia BMO + EGMO TST, 1.4

Tags: combinatorics , combinatorial geometry , tiles , tiling

The sword is a figure consisting of $6$ unit squares presented in the picture below (and any other figure obtained from it by rotation). [img]https://cdn.artofproblemsolving.com/attachments/4/3/08494627d043ea575703564e9e6b5ba63dc2ef.png[/img] Determine the largest number of swords that can be cut from a $6\times 11$ piece of paper divided into unit squares (each sword should consist of six such squares).

2012 May Olympiad, 4

Tags: combinatorial geometry , combinatorics , triangle inequality

Six points are given so that there are not three on the same line and that the lengths of the segments determined by these points are all different. We consider all the triangles that they have their vertices at these points. Show that there is a segment that is both the shortest side of one of those triangles and the longest side of another.

2007 Sharygin Geometry Olympiad, 6

Tags: circles , geometry , combinatorial geometry

Given are two concentric circles $\Omega$ and $\omega$. Each of the circles $b_1$ and $b_2$ is externally tangent to $\omega$ and internally tangent to $\Omega$, and $\omega$ each of the circles $c_1$ and $c_2$ is internally tangent to both $\Omega$ and $\omega$. Mark each point where one of the circles $b_1, b_2$ intersects one of the circles $c_1$ and $c_2$. Prove that there exist two circles distinct from $b_1, b_2, c_1, c_2$ which contain all $8$ marked points. (Some of these new circles may appear to be lines.)

1983 Austrian-Polish Competition, 7

Tags: combinatorial geometry , geometry , hexagon

Let $P_1,P_2,P_3,P_4$ be four distinct points in the plane. Suppose $\ell_1,\ell_2, … , \ell_6$ are closed segments in that plane with the following property: Every straight line passing through at least one of the points $P_i$ meets the union $\ell_1 \cup \ell_2\cup … \cup\ell_6$ in exactly two points. Prove or disprove that the segments $\ell_i$ necessarily form a hexagon.

1974 IMO Longlists, 23

Tags: combinatorics , packing , combinatorial geometry , square

Prove that the squares with sides $\frac{1}{1}, \frac{1}{2}, \frac{1}{3},\ldots$ may be put into the square with side $\frac{3}{2} $ in such a way that no two of them have any interior point in common.

1994 Czech And Slovak Olympiad IIIA, 3

Tags: diagonal , combinatorial geometry , combinatorics

A convex $1994$-gon $M$ is given in the plane. A closed polygonal line consists of $997$ of its diagonals. Every vertex is adjacent to exactly one diagonal. Each diagonal divides $M$ into two sides, and the smaller of the numbers of edges on the two sides of $M$ is defined to be the length of the diagonal. Is it posible to have (a) $991$ diagonals of length $3$ and $6$ of length $2$? (b) $985$ diagonals of length $6, 4$ of length $8$, and $8$ of length $3$?

2012 Danube Mathematical Competition, 1

Tags: lattice points , square , covering , combinatorial geometry , combinatorics

Given a positive integer $n$, determine the maximum number of lattice points in the plane a square of side length $n +\frac{1}{2n+1}$ may cover.

2017 Caucasus Mathematical Olympiad, 8

Tags: combinatorial geometry , geometry

$100$ points are marked in the plane so that no three of marked points are collinear. One of marked points is red, and the others are blue. A triangle with vertices at blue points is called [i]good[/i] if the red point lies inside it. Determine if it is possible that the number of good triangles is not less than the half of the total number of traingles with vertices at blue points.

2023 Grosman Mathematical Olympiad, 7

Tags: coloring , equilateral triangle , combinatorics , geometry , combinatorial geometry

The plane is colored with two colors so that the following property holds: for each real $a>0$ there is an equilateral triangle of side length $a$ whose $3$ vertices are of the same color. Prove that for any three numbers $a,b,c>0$ for which the sum of any two is greater than the third there is a triangle with sides $a$, $b$, and $c$ whose $3$ vertices are of the same color.

1975 Polish MO Finals, 2

Tags: geometry , 3d geometry , tetrahedron , combinatorial geometry

On the surface of a regular tetrahedron of edge length $1$ are given finitely many segments such that every two vertices of the tetrahedron can be joined by a polygonal line consisting of given segments. Can the sum of the lengths of the given segments be less than $1+\sqrt3 $?

1973 Kurschak Competition, 3

Tags: combinatorics , combinatorial geometry

$n > 4$ planes are in general position (so every $3$ planes have just one common point, and no point belongs to more than $3$ planes). Show that there are at least $\frac{2n-3}{ 4}$ tetrahedra among the regions formed by the planes.

1990 Tournament Of Towns, (278) 3

Tags: combinatorics , geometry , combinatorial geometry

A finite set $M$ of unit squares on the plane is considered. The sides of the squares are parallel to the coordinate axes and the squares are allowed to intersect. It is known that the distance between the centres of any pair of squares is no greater than $2$. Prove that there exists a unit square (not necessarily belonging to $M$) with sides parallel to the coordinate axes and which has at least one common point with each of the squares in $M$. (A Andjans, Riga)

1994 All-Russian Olympiad, 8

Tags: combinatorics , combinatorial geometry , grid

A plane is divided into unit squares by two collections of parallel lines. For any $n\times n$ square with sides on the division lines, we define its frame as the set of those unit squares which internally touch the boundary of the $n\times n$ square. Prove that there exists only one way of covering a given $100\times 100$ square whose sides are on the division lines with frames of $50$ squares (not necessarily contained in the $100\times 100$ square). (A. Perlin)

1987 Austrian-Polish Competition, 8

Tags: arc , curve , integer sidelengths , geometry , combinatorial geometry , circles

A circle of perimeter $1$ has been dissected into four equal arcs $B_1, B_2, B_3, B_4$. A closed smooth non-selfintersecting curve $C$ has been composed of translates of these arcs (each $B_j$ possibly occurring several times). Prove that the length of $C$ is an integer.

II Soros Olympiad 1995 - 96 (Russia), 9.4

Tags: combinatorics , combinatorial geometry , coloring

All possible vertical lines $x = k$ and horizontal lines $y = m$ are drawn on the coordinate plane, where $k$ and $m$ are integers. Let's imagine that all these straight lines are black. A red straight line is also drawn, the equation of which is $19x+96y= c$. Let us denote by $M$ the number of segments of different lengths formed on the red line when intersecting with the black ones.(The ends of each segment are the intersection points of the red and black lines. There are no such intersection points inside the segment.) What values can $M$ take when $c$ changes?

1985 IMO Longlists, 84

Tags: combinatorics , combinatorial geometry , graph theory , extremal combinatorics , extremal graph theory

Let $A$ be a set of $n$ points in the space. From the family of all segments with endpoints in $A$, $q$ segments have been selected and colored yellow. Suppose that all yellow segments are of different length. Prove that there exists a polygonal line composed of $m$ yellow segments, where $m \geq \frac{2q}{n}$, arranged in order of increasing length.