Olympiad problems

2019 Thailand TST, 2

Tags: combinatorics

In a classroom of at least four students, when any four of them take seats around a round table, there is always someone who either knows both of his neighbors, or does not know either of his neighbors. Prove that it is possible to divide the students into two groups so that in one of them, all students knows one another, and in the other, none of the students know each other. [i]Note: If $A$ knows $B$, then $B$ knows $A$ as well.[/i]

1990 Tournament Of Towns, (274) 2

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

The plane is divided by three infinite sets of parallel lines into equilateral triangles of equal area. Let $M$ be the set of their vertices, and $A$ and $B$ be two vertices of such an equilateral triangle. One may rotate the plane through $120^o$ around any vertex of the set $M$. Is it possible to move the point $A$ to the point $B$ by a number of such rotations (N Vasiliev, Moscow)

2010 Indonesia TST, 4

Tags: combinatorics

Prove that the number $ (\underbrace{9999 \dots 99}_{2005}) ^{2009}$ can be obtained by erasing some digits of $ (\underbrace{9999 \dots 99}_{2008}) ^{2009}$ (both in decimal representation). [i]Yudi Satria, Jakarta[/i]

2013 Swedish Mathematical Competition, 5

Tags: combinatorics , inequalities

Let $n \geq 2$ be a positive integer. Show that there are exactly $2^{n-3}n(n-1)$ $n$-tuples of integers $(a_1,a_2,\dots,a_n)$, which satisfy the conditions: (i) $a_1=0$; (ii) for each $m$, $2 \leq m \leq n$, there is an index in $m$, $1 \leq i_m <m$, such that $\left|a_{i_m}-a_m\right|\leq 1$; (iii) the $n$-tuple $(a_1,a_2,\dots,a_n)$ contains exactly $n-1$ different numbers.

2012 Saint Petersburg Mathematical Olympiad, 3

Tags: combinatorics

$25$ students are on exams. Exam consists of some questions with $5$ variants of answer. Every two students gave same answer for not more than $1$ question. Prove, that there are not more than $6$ questions in exam.

2020 Greece Junior Math Olympiad, 4

Tags: combinatorics

We are having 99 equal circles in a row and in the interior, we write inside them all the numbers from 1 up to 99 (one number in each circle).We color each of the circles with one of the two colors available: red and green. A coloring is good if it has the ability: Red circles lying in the interval of the numbers from 1 up to 50 are more than the red circles lying in the interval of the numbers from 51 up to 99 . a) Find how many different colorings can be constructed. b) Find how many different good colorings can be constructed. (Note: Two colorings are different, if they have different color in at least one of their circles.)

2015 Finnish National High School Mathematics Comp, 5

Tags: point , correct , probability , combinatorics

Mikko takes a multiple choice test with ten questions. His only goal is to pass the test, and this requires seven points. A correct answer is worth one point, and answering wrong results in the deduction of one point. Mikko knows for sure that he knows the correct answer in the six first questions. For the rest, he estimates that he can give the correct answer to each problem with probability $p, 0 < p < 1$. How many questions Mikko should try?

2024 USA TSTST, 9

Tags: rectangle , combinatorics

Let $n \ge 2$ be a fixed integer. The cells of an $n \times n$ table are filled with the integers from $1$ to $n^2$ with each number appearing exactly once. Let $N$ be the number of unordered quadruples of cells on this board which form an axis-aligned rectangle, with the two smaller integers being on opposite vertices of this rectangle. Find the largest possible value of $N$. [i]Anonymous[/i]

2012 Baltic Way, 9

Tags: combinatorics

Zeroes are written in all cells of a $5 \times 5$ board. We can take an arbitrary cell and increase by 1 the number in this cell and all cells having a common side with it. Is it possible to obtain the number 2012 in all cells simultaneously?

2006 Switzerland - Final Round, 6

Tags: combinatorics

At least three players have participated in a tennis tournament. Evey two players have played each other exactly once, and each player has at least one match won. Show that there are three players $A,B,C$ such that $A$ won against $B$, $B$ won against $C$ and $C$ won against $A$.

2015 JBMO Shortlist, C3

Tags: positive integer , combinatorics , array , table

Positive integers are put into the following table. \begin{tabular}{|l|l|l|l|l|l|l|l|l|l|} \hline 1 & 3 & 6 & 10 & 15 & 21 & 28 & 36 & & \\ \hline 2 & 5 & 9 & 14 & 20 & 27 & 35 & 44 & & \\ \hline 4 & 8 & 13 & 19 & 26 & 34 & 43 & 53 & & \\ \hline 7 & 12 & 18 & 25 & 33 & 42 & & & & \\ \hline 11 & 17 & 24 & 32 & 41 & & & & & \\ \hline 16 & 23 & & & & & & & & \\ \hline ... & & & & & & & & & \\ \hline ... & & & & & & & & & \\ \hline \end{tabular} Find the number of the line and column where the number $2015$ stays.

2008 Iran MO (2nd Round), 1

Tags: combinatorics

In how many ways, can we draw $n-3$ diagonals of a $n$-gon with equal sides and equal angles such that: $i)$ none of them intersect each other in the polygonal. $ii)$ each of the produced triangles has at least one common side with the polygonal.

2017 Purple Comet Problems, 29

Tags: combinatorics

Find the number of three-element subsets of $\{1, 2, 3,...,13\}$ that contain at least one element that is a multiple of $2$, at least one element that is a multiple of $3$, and at least one element that is a multiple of $5$ such as $\{2,3, 5\}$ or $\{6, 10,13\}$.

1972 Swedish Mathematical Competition, 2

Tags: combinatorial geometry , combinatorics

A rectangular grid of streets has $m$ north-south streets and $n$ east-west streets. For which $m, n > 1$ is it possible to start at an intersection and drive through each of the other intersections just once before returning to the start?

1991 Kurschak Competition, 3

Tags: combinatorics

Consider $998$ red points on the plane with no three collinear. We select $k$ blue points in such a way that inside each triangle whose vertices are red points, there is a blue point as well. Find the smallest $k$ for which the described selection of blue points is possible for any configuration of $998$ red points.

2022 LMT Spring, 2

Tags: geometry , combinatorics

Five people are standing in a straight line, and the distance between any two people is a unique positive integer number of units. Find the least possible distance between the leftmost and rightmost people in the line in units.

1980 Kurschak Competition, 1

Tags: combinatorics , coloring , combinatorial geometry

The points of space are coloured with five colours, with all colours being used. Prove that some plane contains four points of different colours.

2015 IMO, 1

Tags: combinatorics , geometrical combinatorics

We say that a finite set $\mathcal{S}$ of points in the plane is [i]balanced[/i] if, for any two different points $A$ and $B$ in $\mathcal{S}$, there is a point $C$ in $\mathcal{S}$ such that $AC=BC$. We say that $\mathcal{S}$ is [i]centre-free[/i] if for any three different points $A$, $B$ and $C$ in $\mathcal{S}$, there is no points $P$ in $\mathcal{S}$ such that $PA=PB=PC$. (a) Show that for all integers $n\ge 3$, there exists a balanced set consisting of $n$ points. (b) Determine all integers $n\ge 3$ for which there exists a balanced centre-free set consisting of $n$ points. Proposed by Netherlands

2009 Argentina Iberoamerican TST, 1

Tags: combinatorics

In the vertexes of a regular $ 31$-gon there are written the numbers from $ 1$ to $ 31$, ordered increasingly, clockwise oriented. We are allowed to perform an operation which consists in taking any three vertexes, namely the ones who have written $ a$,$ b$, and $ c$ and change them into $ c$, $ a\minus{}\frac{1}{10}$ and $ b\plus{}\frac{1}{10}$ respectively ( $ a$ becomes $ c$, $ b$ becomes $ a\minus{}\frac{1}{10}$ and $ c$ turns into $ b\plus{}\frac{1}{10}$ Prove that after applying several operations we can reach the state in which the numbers in the vertexes are the numbers from $ 1$ to $ 31$, ordered increasingly,anti-clockwise oriented.

2022 Sharygin Geometry Olympiad, 10.7

Tags: geometry , combinatorics , combinatorial geometry

Several circles are drawn on the plane and all points of their meeting or touching are marked. May be that each circle contains exactly four marked points and exactly four marked points lie on each circle?

2003 Junior Balkan Team Selection Tests - Romania, 3

Tags: combinatorics

Five real numbers of absolute values not greater than $1$ and having the sum equal to $1$ are written on the circumference of a circle. Prove that one can choose three consecutively disposed numbers $a, b, c$, such that all the sums $a + b,b + c$ and $a + b + c$ are nonnegative.

2011 Saint Petersburg Mathematical Olympiad, 3

Tags: combinatorics

Can we build parallelepiped $6 \times 7 \times 7$ from $1 \times 1 \times 2$ bricks, such that we have same amount bricks of one of $3$ directions ?

1981 Yugoslav Team Selection Test, Problem 1

Tags: arithmetic sequence , combinatorics

Let $n\ge3$ be a natural number. For a set $S$ of $n$ real numbers, $A(S)$ denotes the set of all strictly increasing arithmetic sequences of three terms in $S$. At most, how many elements can the set $A(S)$ have?

2016 Indonesia TST, 3

Tags: combinatorics , extremal combinatorics , set

Let $\{E_1, E_2, \dots, E_m\}$ be a collection of sets such that $E_i \subseteq X = \{1, 2, \dots, 100\}$, $E_i \neq X$, $i = 1, 2, \dots, m$. It is known that every two elements of $X$ is contained together in exactly one $E_i$ for some $i$. Determine the minimum value of $m$.

2015 Korea - Final Round, 6

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.