Olympiad problems

2001 China Team Selection Test, 1

Given seven points on a plane, with no three points collinear. Prove that it is always possible to divide these points into the vertices of a triangle and a convex quadrilateral, with no shared parts between the two shapes.

2020 Kürschák Competition, P1

Tags: combinatorics , combinatorical geometry

Let $n$ and $k$ be positive integers. Given $n$ closed discs in the plane such that no matter how we choose $k + 1$ of them, there are always two of the chosen discs that have no common point. Prove that the $n$ discs can be partitioned into at most $10k$ classes such that any two discs in the same class have no common point.

2023 China Girls Math Olympiad, 8

Tags: combinatorics , geometry , combinatorical geometry

Let $P_i(x_i,y_i)\ (i=1,2,\cdots,2023)$ be $2023$ distinct points on a plane equipped with rectangular coordinate system. For $i\neq j$, define $d(P_i,P_j) = |x_i - x_j| + |y_i - y_j|$. Define $$\lambda = \frac{\max_{i\neq j}d(P_i,P_j)}{\min_{i\neq j}d(P_i,P_j)}$$. Prove that $\lambda \geq 44$ and provide an example in which the equality holds.

2019 Korea Junior Math Olympiad., 1

Tags: algebraic geometry , combinatorical geometry , combinatorics , KJMO , Coloring

Each integer coordinates are colored with one color and at least 5 colors are used to color every integer coordinates. Two integer coordinates $(x, y)$ and $(z, w)$ are colored in the same color if $x-z$ and $y-w$ are both multiples of 3. Prove that there exists a line that passes through exactly three points when five points with different colors are chosen randomly.

2019 Israel Olympic Revenge, P2

Tags: combinatorical geometry , combinatorics , olympic revenge

A $5779$-dimensional polytope is call a [b]$k$-tope[/b] if it has exactly $k$ $5778$-dimensional faces. Find all sequences $b_{5780}, b_{5781}, \dots, b_{11558}$ of nonnegative integers, not all $0$, such that the following condition holds: It is possible to tesselate every $5779$-dimensional polytope with [u]convex[/u] $5779$-dimensional polytopes, such that the number of $k$-topes in the tessellation is proportional to $b_k$, while there are no $k$-topes in the tessellation if $k\notin \{5780, 5781, \dots, 11558\}$.

2001 China Team Selection Test, 1

Tags: graph theory , combinatorical geometry , combinatorics

Given seven points on a plane, with no three points collinear. Prove that it is always possible to divide these points into the vertices of a triangle and a convex quadrilateral, with no shared parts between the two shapes.

2021 Iranian Combinatorics Olympiad, P6

Tags: combinatorics , triangulation , convex quadrilateral , combinatorical geometry

Let $\mathcal{P}$ be a convex polygon and $\textbf{T}$ be a triangle with vertices among the vertices of $\mathcal{P}$. By removing $\textbf{T}$ from $\mathcal{P}$, we end up with $0, 1, 2,$ or $3$ smaller polygons (possibly with shared vertices) which we call the effect of $\textbf{T}$. A triangulation of $P$ is a way of dissecting it into some triangles using some non-intersecting diagonals. We call a triangulation of $\mathcal{P}$ $\underline{\text{beautiful}}$, if for each of its triangles, the effect of this triangle contains exactly one polygon with an odd number of vertices. Prove that a triangulation of $\mathcal{P}$ is beautiful if and only if we can remove some of its diagonals and end up with all regions as quadrilaterals.

2023 Grosman Mathematical Olympiad, 7

Tags: combinatorical geometry , Coloring , Equilateral Triangle , combinatorics , 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.

2013 IMO Shortlist, C2

Tags: combinatorics , IMO , IMO 2013 , geometry , IMO Shortlist , combinatorical geometry

A configuration of $4027$ points in the plane is called Colombian if it consists of $2013$ red points and $2014$ blue points, and no three of the points of the configuration are collinear. By drawing some lines, the plane is divided into several regions. An arrangement of lines is good for a Colombian configuration if the following two conditions are satisfied: i) No line passes through any point of the configuration. ii) No region contains points of both colors. Find the least value of $k$ such that for any Colombian configuration of $4027$ points, there is a good arrangement of $k$ lines. Proposed by [i]Ivan Guo[/i] from [i]Australia.[/i]

2022 China Girls Math Olympiad, 7

Tags: combinatorics , combinatorical geometry , Coloring

Let $n \geqslant 3$ be integer. Given convex $n-$polygon $\mathcal{P}$. A $3-$coloring of the vertices of $\mathcal{P}$ is called [i]nice[/i] such that every interior point of $\mathcal{P}$ is inside or on the bound of a triangle formed by polygon vertices with pairwise distinct colors. Determine the number of different nice colorings. ([I]Two colorings are different as long as they differ at some vertices. [/i])

2022 Canada National Olympiad, 4

Tags: combinatorical geometry , combinatorics

Call a set of $n$ lines [i]good[/i] if no $3$ lines are concurrent. These $n$ lines divide the Euclidean plane into regions (possible unbounded). A [i]coloring[/i] is an assignment of two colors to each region, one from the set $\{A_1, A_2\}$ and the other from $\{B_1, B_2, B_3\}$, such that no two adjacent regions (adjacent meaning sharing an edge) have the same $A_i$ color or the same $B_i$ color, and there is a region colored $A_i, B_j$ for any combination of $A_i, B_j$. A number $n$ is [i]colourable[/i] if there is a coloring for any set of $n$ good lines. Find all colourable $n$.

2014 Argentina National Olympiad Level 2, 5

Tags: combinatorics , combinatorical geometry

Let $A{}$ be a point in the Cartesian plane. At each step, Ann tells Bob a number $0< a\leqslant 1$ and he then moves $A{}$ in one of the four cardinal directions, at his choice, by a distance of $a{}$. This process cotinues as long as Ann wishes. Amongst every $100$ consecutive moves, each of the four possible moves should have been made at least once. Ann's goal is to force Bob to eventually choose a point at a distance greater than $100$ from the initial position of $A{}$. Can Ann achieve her goal?

2013 IMO, 2

Tags: combinatorics , IMO , IMO 2013 , geometry , IMO Shortlist , combinatorical geometry

A configuration of $4027$ points in the plane is called Colombian if it consists of $2013$ red points and $2014$ blue points, and no three of the points of the configuration are collinear. By drawing some lines, the plane is divided into several regions. An arrangement of lines is good for a Colombian configuration if the following two conditions are satisfied: i) No line passes through any point of the configuration. ii) No region contains points of both colors. Find the least value of $k$ such that for any Colombian configuration of $4027$ points, there is a good arrangement of $k$ lines. Proposed by [i]Ivan Guo[/i] from [i]Australia.[/i]