Olympiad problems

1991 All Soviet Union Mathematical Olympiad, 537

Four lines in the plane intersect in six points. Each line is thus divided into two segments and two rays. Is it possible for the eight segments to have lengths $1, 2, 3, ... , 8$? Can the lengths of the eight segments be eight distinct integers?

2009 Chile National Olympiad, 1

Tags: geometry , combinatorial geometry , combinatorics

Consider $9$ points in the interior of a square of side $1$. Prove that there are three of them that form a triangle with an area less than or equal to $\frac18$ .

1977 Poland - Second Round, 6

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

What is the greatest number of parts into which the plane can be cut by the edges of $ n $ squares?

2007 Cuba MO, 2

Tags: combinatorics , combinatorial geometry , prism , 3d geometry , geometry

A prism is called [i]binary [/i] if it can be assigned to each of its vertices a number from the set $\{-1, 1\}$, such that the product of the numbers assigned to the vertices of each face is equal to $-1$. a) Prove that the number of vertices of the binary prisms is divisible for $8$. b) Prove that a prism with $2000$ vertices is binary.

1993 IMO Shortlist, 2

Tags: algebra , geometry , point set , distance , combinatorial geometry

Show that there exists a finite set $A \subset \mathbb{R}^2$ such that for every $X \in A$ there are points $Y_1, Y_2, \ldots, Y_{1993}$ in $A$ such that the distance between $X$ and $Y_i$ is equal to 1, for every $i.$

1995 Tournament Of Towns, (449) 5

Tags: geometry , combinatorial geometry , combinatorics

Four equal right-angled triangles are given. We are allowed to cut any triangle into two new ones along the altitude dropped on to the hypotenuse. This operation may be repeated with any of the triangles from the new set. Prove that after any number of such operations there will be congruent triangles among those obtained. (AV Shapovalov)

1970 IMO, 3

Tags: acute , triangle , point set , counting , combinatorial geometry

Given $100$ coplanar points, no three collinear, prove that at most $70\%$ of the triangles formed by the points have all angles acute.

1945 Moscow Mathematical Olympiad, 094

Tags: divide , geometry , impossible , congruent triangles , combinatorial geometry

Prove that it is impossible to divide a scalene triangle into two equal triangles.

2000 Estonia National Olympiad, 5

Tags: combinatorial geometry , combinatorics

$2000$ lines are set on the plane. Prove that among them there are two such that have the same number of different intersection points with the rest of the lines.

2016 Saudi Arabia Pre-TST, 2.2

Tags: combinatorics , combinatorial geometry , coloring

Ten vertices of a regular $20$-gon $A_1A_2....A_{20}$ are painted black and the other ten vertices are painted blue. Consider the set consisting of diagonal $A_1A_4$ and all other diagonals of the same length. 1. Prove that in this set, the number of diagonals with two black endpoints is equal to the number of diagonals with two blue endpoints. 2. Find all possible numbers of the diagonals with two black endpoints.

2018 Ukraine Team Selection Test, 3

Tags: combinatorics , lattice points , combinatorial geometry , collinear , game , game strategy

Consider the set of all integer points in $Z^3$. Sasha and Masha play such a game. At first, Masha marks an arbitrary point. After that, Sasha marks all the points on some a plane perpendicular to one of the coordinate axes and at no point, which Masha noted. Next, they continue to take turns (Masha can't to select previously marked points, Sasha cannot choose the planes on which there are points said Masha). Masha wants to mark $n$ consecutive points on some line that parallel to one of the coordinate axes, and Sasha seeks to interfere with it. Find all $n$, in which Masha can achieve the desired result.

2009 Singapore Team Selection Test, 3

Tags: rectangle , combinatorics , combinatorial geometry , extremal combinatorics , geometry

In the plane we consider rectangles whose sides are parallel to the coordinate axes and have positive length. Such a rectangle will be called a [i]box[/i]. Two boxes [i]intersect[/i] if they have a common point in their interior or on their boundary. Find the largest $ n$ for which there exist $ n$ boxes $ B_1$, $ \ldots$, $ B_n$ such that $ B_i$ and $ B_j$ intersect if and only if $ i\not\equiv j\pm 1\pmod n$. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

1996 Tournament Of Towns, (500) 2

Tags: combinatorics , combinatorial geometry

The square $0\le x\le 1$, $0\le y\le 1$ is drawn in the plane $Oxy$. A grasshopper sitting at a point $M$ with noninteger coordinates outside this square jumps to a new point which is symmetrical to $M$ with respect to the leftmost (from the grasshopper’s point of view) vertex of the square. Prove that no matter how many times the grasshopper jumps, it will never reach the distance more than $10 d$ from the center $C$ of the square, where $d$ is the distance between the initial position $M$ and the center $C$. (A Kanel)

1985 All Soviet Union Mathematical Olympiad, 406

Tags: line , combinatorial geometry , maximum

$n$ straight lines are drawn in a plane. They divide the plane onto several parts. Some of the parts are painted. Not a pair of painted parts has non-zero length common bound. Prove that the number of painted parts is not more than $\frac{n^2 + n}{3}$.

1969 IMO Shortlist, 68

Tags: point set , convex quadrilateral , combinatorial geometry , geometry

$(USS 5)$ Given $5$ points in the plane, no three of which are collinear, prove that we can choose $4$ points among them that form a convex quadrilateral.

1991 China Team Selection Test, 3

Tags: invariant , induction , combinatorial geometry , combinatorics

$5$ points are given in the plane, any three non-collinear and any four non-concyclic. If three points determine a circle that has one of the remaining points inside it and the other one outside it, then the circle is said to be [i]good[/i]. Let the number of good circles be $n$; find all possible values of $n$.

1994 Argentina National Olympiad, 6

Tags: geometry , rectangle , combinatorics , combinatorial geometry

A $9\times 9$ board has a number written on each square: all squares in the first row have $1$, all squares in the second row have $2$, $\ldots$, all squares in the ninth row have $9$. We will call [i]special [/i] rectangle any rectangle of $2\times 3$ or $3\times 2$ or $4\times 5$ or $5\times 4$ on the board. The permitted operations are: $\bullet$ Simultaneously add $1$ to all the numbers located in a special rectangle. $\bullet$ Simultaneously subtract $1$ from all numbers located in a special rectangle. Demonstrate that it is possible to achieve, through a succession of permitted operations, that $80$ squares to have $0$ (zero). What number is left in the remaining box?

2021 Irish Math Olympiad, 4

Tags: domino , combinatorial geometry , combinatorics

You have a $3 \times 2021$ chessboard from which one corner square has been removed. You also have a set of $3031$ identical dominoes, each of which can cover two adjacent chessboard squares. Let $m$ be the number of ways in which the chessboard can be covered with the dominoes, without gaps or overlaps. What is the remainder when $m$ is divided by $19$?

2016 Moldova Team Selection Test, 12

Tags: combinatorics , combinatorial geometry , extremal principle

There are $2015$ distinct circles in a plane, with radius $1$. Prove that you can select $27$ circles, which form a set $C$, which satisfy the following. For two arbitrary circles in $C$, they intersect with each other or For two arbitrary circles in $C$, they don't intersect with each other.

2007 Junior Balkan Team Selection Tests - Moldova, 7

Tags: combinatorial geometry , combinatorics

Show that there is a square with side length $14$ whose floor may be covered (exact coverage of the square area) by $21$ squares so that between them there is exactly $6$ squares with side length $1$, $5$ squares with side length $2$, $4$ squares with side length $3$, $3$ squares with side length $4$, $2$ squares with side length $5$ and a square with side length $6$ .

1998 Belarusian National Olympiad, 7

Tags: point , combinatorial geometry , combinatorics

On the plane $n+1$ points are marked, no three of which lie on one straight line. For what natural $k$ can they be connected by segments so that for any $n$ marked points there are exactly $k$ segments with ends at these points?

2021/2022 Tournament of Towns, P7

Tags: combinatorics , combinatorial geometry

A checkered square of size $2\times2$ is covered by two triangles. Is it necessarily true that: [list=a] [*]at least one of its four cells is fully covered by one of the triangles; [*]some square of size $1\times1$ can be placed into one of these triangles? [/list] [i]Alexandr Shapovalov[/i]

1977 All Soviet Union Mathematical Olympiad, 236

Tags: combinatorics , combinatorial geometry , algebra

Given several points, not all lying on one straight line. Some number is assigned to every point. It is known, that if a straight line contains two or more points, than the sum of the assigned to those points equals zero. Prove that all the numbers equal to zero.

2018 Portugal MO, 3

Tags: coloring , combinatorics , combinatorial geometry

How many ways are there to paint an $m \times n$ board, so that each square is painted blue, white, brown or gold, and in each $2 \times 2$ square there is one square of each color?

2018 Serbia National Math Olympiad, 3

Tags: combinatorics , inequalities , combinatorial geometry , discrete geometry

Let $n$ be a positive integer. There are given $n$ lines such that no two are parallel and no three meet at a single point. a) Prove that there exists a line such that the number of intersection points of these $n$ lines on both of its sides is at least $$\left \lfloor \frac{(n-1)(n-2)}{10} \right \rfloor.$$ Notice that the points on the line are not counted. b) Find all $n$ for which there exists a configurations where the equality is achieved.