Olympiad problems

2022 Taiwan TST Round 3, C

Consider a checkered $3m\times 3m$ square, where $m$ is an integer greater than $1.$ A frog sits on the lower left corner cell $S$ and wants to get to the upper right corner cell $F.$ The frog can hop from any cell to either the next cell to the right or the next cell upwards. Some cells can be [i]sticky[/i], and the frog gets trapped once it hops on such a cell. A set $X$ of cells is called [i]blocking[/i] if the frog cannot reach $F$ from $S$ when all the cells of $X$ are sticky. A blocking set is [i] minimal[/i] if it does not contain a smaller blocking set.[list=a][*]Prove that there exists a minimal blocking set containing at least $3m^2-3m$ cells. [*]Prove that every minimal blocking set containing at most $3m^2$ cells.

2022 Germany Team Selection Test, 1

Tags: algebra , floor function , IMO Shortlist , ISL 2021 , Summation , NumberTheory

Which positive integers $n$ make the equation \[\sum_{i=1}^n \sum_{j=1}^n \left\lfloor \frac{ij}{n+1} \right\rfloor=\frac{n^2(n-1)}{4}\] true?

2022 Germany Team Selection Test, 3

Tags: combinatorics , ISL 2021 , frog , board

Consider a checkered $3m\times 3m$ square, where $m$ is an integer greater than $1.$ A frog sits on the lower left corner cell $S$ and wants to get to the upper right corner cell $F.$ The frog can hop from any cell to either the next cell to the right or the next cell upwards. Some cells can be [i]sticky[/i], and the frog gets trapped once it hops on such a cell. A set $X$ of cells is called [i]blocking[/i] if the frog cannot reach $F$ from $S$ when all the cells of $X$ are sticky. A blocking set is [i] minimal[/i] if it does not contain a smaller blocking set.[list=a][*]Prove that there exists a minimal blocking set containing at least $3m^2-3m$ cells. [*]Prove that every minimal blocking set containing at most $3m^2$ cells.

2022 Thailand TST, 1

Tags: algebra , floor function , IMO Shortlist , ISL 2021 , Summation , NumberTheory

Which positive integers $n$ make the equation \[\sum_{i=1}^n \sum_{j=1}^n \left\lfloor \frac{ij}{n+1} \right\rfloor=\frac{n^2(n-1)}{4}\] true?

2022 Brazil Team Selection Test, 1

Tags: algebra , IMO Shortlist , 2021 , A1 , ISL 2021

Let $n$ be a positive integer. Given is a subset $A$ of $\{0,1,...,5^n\}$ with $4n+2$ elements. Prove that there exist three elements $a<b<c$ from $A$ such that $c+2a>3b$. [i]Proposed by Dominik Burek and Tomasz Ciesla, Poland[/i]

Russian TST 2022, P1

Tags: IMO Shortlist , pigeonhole principle , ISL 2021 , c2

Let $n\ge 3$ be a fixed integer. There are $m\ge n+1$ beads on a circular necklace. You wish to paint the beads using $n$ colors, such that among any $n+1$ consecutive beads every color appears at least once. Find the largest value of $m$ for which this task is $\emph{not}$ possible. [i]Carl Schildkraut, USA[/i]

2022 Germany Team Selection Test, 1

Tags: algebra , IMO Shortlist , 2021 , A1 , ISL 2021

Let $n$ be a positive integer. Given is a subset $A$ of $\{0,1,...,5^n\}$ with $4n+2$ elements. Prove that there exist three elements $a<b<c$ from $A$ such that $c+2a>3b$. [i]Proposed by Dominik Burek and Tomasz Ciesla, Poland[/i]

2022 Switzerland Team Selection Test, 3

Tags: ISL 2021 , combinatorics , game

A hunter and an invisible rabbit play a game on an infinite square grid. First the hunter fixes a colouring of the cells with finitely many colours. The rabbit then secretly chooses a cell to start in. Every minute, the rabbit reports the colour of its current cell to the hunter, and then secretly moves to an adjacent cell that it has not visited before (two cells are adjacent if they share an edge). The hunter wins if after some finite time either:[list][*]the rabbit cannot move; or [*]the hunter can determine the cell in which the rabbit started.[/list]Decide whether there exists a winning strategy for the hunter. [i]Proposed by Aron Thomas[/i]

2022 Germany Team Selection Test, 2

Tags: ISL 2021 , IMO Shortlist , geometry , cyclic quadrilateral , concurrency , Angle Chasing , imo shortlist g4

Let $ABCD$ be a quadrilateral inscribed in a circle $\Omega.$ Let the tangent to $\Omega$ at $D$ meet rays $BA$ and $BC$ at $E$ and $F,$ respectively. A point $T$ is chosen inside $\triangle ABC$ so that $\overline{TE}\parallel\overline{CD}$ and $\overline{TF}\parallel\overline{AD}.$ Let $K\ne D$ be a point on segment $DF$ satisfying $TD=TK.$ Prove that lines $AC,DT,$ and $BK$ are concurrent.

2022 SAFEST Olympiad, 1

Tags: algebra , floor function , IMO Shortlist , ISL 2021 , Summation , NumberTheory

Which positive integers $n$ make the equation \[\sum_{i=1}^n \sum_{j=1}^n \left\lfloor \frac{ij}{n+1} \right\rfloor=\frac{n^2(n-1)}{4}\] true?

2022 Thailand TST, 3

Tags: ISL 2021 , combinatorics , game

A hunter and an invisible rabbit play a game on an infinite square grid. First the hunter fixes a colouring of the cells with finitely many colours. The rabbit then secretly chooses a cell to start in. Every minute, the rabbit reports the colour of its current cell to the hunter, and then secretly moves to an adjacent cell that it has not visited before (two cells are adjacent if they share an edge). The hunter wins if after some finite time either:[list][*]the rabbit cannot move; or [*]the hunter can determine the cell in which the rabbit started.[/list]Decide whether there exists a winning strategy for the hunter. [i]Proposed by Aron Thomas[/i]

2022 Germany Team Selection Test, 3

Tags: ISL 2021 , combinatorics , game

A hunter and an invisible rabbit play a game on an infinite square grid. First the hunter fixes a colouring of the cells with finitely many colours. The rabbit then secretly chooses a cell to start in. Every minute, the rabbit reports the colour of its current cell to the hunter, and then secretly moves to an adjacent cell that it has not visited before (two cells are adjacent if they share an edge). The hunter wins if after some finite time either:[list][*]the rabbit cannot move; or [*]the hunter can determine the cell in which the rabbit started.[/list]Decide whether there exists a winning strategy for the hunter. [i]Proposed by Aron Thomas[/i]

2022 Saudi Arabia IMO TST, 1

Tags: algebra , floor function , IMO Shortlist , ISL 2021 , Summation , NumberTheory

Which positive integers $n$ make the equation \[\sum_{i=1}^n \sum_{j=1}^n \left\lfloor \frac{ij}{n+1} \right\rfloor=\frac{n^2(n-1)}{4}\] true?

2022 Germany Team Selection Test, 3

Tags: combinatorics , ISL 2021 , frog , board

Consider a checkered $3m\times 3m$ square, where $m$ is an integer greater than $1.$ A frog sits on the lower left corner cell $S$ and wants to get to the upper right corner cell $F.$ The frog can hop from any cell to either the next cell to the right or the next cell upwards. Some cells can be [i]sticky[/i], and the frog gets trapped once it hops on such a cell. A set $X$ of cells is called [i]blocking[/i] if the frog cannot reach $F$ from $S$ when all the cells of $X$ are sticky. A blocking set is [i] minimal[/i] if it does not contain a smaller blocking set.[list=a][*]Prove that there exists a minimal blocking set containing at least $3m^2-3m$ cells. [*]Prove that every minimal blocking set containing at most $3m^2$ cells.

2022 Brazil Team Selection Test, 2

Tags: algebra , floor function , IMO Shortlist , ISL 2021 , Summation , NumberTheory

Which positive integers $n$ make the equation \[\sum_{i=1}^n \sum_{j=1}^n \left\lfloor \frac{ij}{n+1} \right\rfloor=\frac{n^2(n-1)}{4}\] true?

2022 Germany Team Selection Test, 2

Tags: ISL 2021 , IMO Shortlist , geometry , cyclic quadrilateral , concurrency , Angle Chasing , imo shortlist g4

Let $ABCD$ be a quadrilateral inscribed in a circle $\Omega.$ Let the tangent to $\Omega$ at $D$ meet rays $BA$ and $BC$ at $E$ and $F,$ respectively. A point $T$ is chosen inside $\triangle ABC$ so that $\overline{TE}\parallel\overline{CD}$ and $\overline{TF}\parallel\overline{AD}.$ Let $K\ne D$ be a point on segment $DF$ satisfying $TD=TK.$ Prove that lines $AC,DT,$ and $BK$ are concurrent.

2022 Taiwan TST Round 2, 3

Tags: geometry , circumcircle , excircle , DDIT , ISL 2021

Let $ABC$ be a triangle with circumcircle $\omega$ and let $\Omega_A$ be the $A$-excircle. Let $X$ and $Y$ be the intersection points of $\omega$ and $\Omega_A$. Let $P$ and $Q$ be the projections of $A$ onto the tangent lines to $\Omega_A$ at $X$ and $Y$ respectively. The tangent line at $P$ to the circumcircle of the triangle $APX$ intersects the tangent line at $Q$ to the circumcircle of the triangle $AQY$ at a point $R$. Prove that $\overline{AR} \perp \overline{BC}$.

2022 Brazil Team Selection Test, 4

Tags: ISL 2021 , number theory , Sequence

Let $a_1,a_2,a_3,\ldots$ be an infinite sequence of positive integers such that $a_{n+2m}$ divides $a_{n}+a_{n+m}$ for all positive integers $n$ and $m.$ Prove that this sequence is eventually periodic, i.e. there exist positive integers $N$ and $d$ such that $a_n=a_{n+d}$ for all $n>N.$

2021 IMO Shortlist, C2

Tags: IMO Shortlist , pigeonhole principle , ISL 2021 , c2

Let $n\ge 3$ be a fixed integer. There are $m\ge n+1$ beads on a circular necklace. You wish to paint the beads using $n$ colors, such that among any $n+1$ consecutive beads every color appears at least once. Find the largest value of $m$ for which this task is $\emph{not}$ possible. [i]Carl Schildkraut, USA[/i]

Kvant 2025, M2829

Tags: combinatorics , ISL 2021 , frog , board

Consider a checkered $3m\times 3m$ square, where $m$ is an integer greater than $1.$ A frog sits on the lower left corner cell $S$ and wants to get to the upper right corner cell $F.$ The frog can hop from any cell to either the next cell to the right or the next cell upwards. Some cells can be [i]sticky[/i], and the frog gets trapped once it hops on such a cell. A set $X$ of cells is called [i]blocking[/i] if the frog cannot reach $F$ from $S$ when all the cells of $X$ are sticky. A blocking set is [i] minimal[/i] if it does not contain a smaller blocking set.[list=a][*]Prove that there exists a minimal blocking set containing at least $3m^2-3m$ cells. [*]Prove that every minimal blocking set containing at most $3m^2$ cells.

2022 Taiwan TST Round 2, A

Tags: ISL 2021 , algebra , Inequality , inequalities

Let $n\geqslant 1$ be an integer, and let $x_0,x_1,\ldots,x_{n+1}$ be $n+2$ non-negative real numbers that satisfy $x_ix_{i+1}-x_{i-1}^2\geqslant 1$ for all $i=1,2,\ldots,n.$ Show that \[x_0+x_1+\cdots+x_n+x_{n+1}>\bigg(\frac{2n}{3}\bigg)^{3/2}.\][i]Pakawut Jiradilok and Wijit Yangjit, Thailand[/i]

2022 SAFEST Olympiad, 3

Tags: ISL 2021 , combinatorics , game

A hunter and an invisible rabbit play a game on an infinite square grid. First the hunter fixes a colouring of the cells with finitely many colours. The rabbit then secretly chooses a cell to start in. Every minute, the rabbit reports the colour of its current cell to the hunter, and then secretly moves to an adjacent cell that it has not visited before (two cells are adjacent if they share an edge). The hunter wins if after some finite time either:[list][*]the rabbit cannot move; or [*]the hunter can determine the cell in which the rabbit started.[/list]Decide whether there exists a winning strategy for the hunter. [i]Proposed by Aron Thomas[/i]

2022 Thailand TST, 2

Tags: ISL 2021 , IMO Shortlist , geometry , cyclic quadrilateral , concurrency , Angle Chasing , imo shortlist g4

Let $ABCD$ be a quadrilateral inscribed in a circle $\Omega.$ Let the tangent to $\Omega$ at $D$ meet rays $BA$ and $BC$ at $E$ and $F,$ respectively. A point $T$ is chosen inside $\triangle ABC$ so that $\overline{TE}\parallel\overline{CD}$ and $\overline{TF}\parallel\overline{AD}.$ Let $K\ne D$ be a point on segment $DF$ satisfying $TD=TK.$ Prove that lines $AC,DT,$ and $BK$ are concurrent.

2022 Germany Team Selection Test, 1

Tags: algebra , floor function , IMO Shortlist , ISL 2021 , Summation , NumberTheory

Which positive integers $n$ make the equation \[\sum_{i=1}^n \sum_{j=1}^n \left\lfloor \frac{ij}{n+1} \right\rfloor=\frac{n^2(n-1)}{4}\] true?

2022 Estonia Team Selection Test, 1

Tags: algebra , IMO Shortlist , 2021 , A1 , ISL 2021

Let $n$ be a positive integer. Given is a subset $A$ of $\{0,1,...,5^n\}$ with $4n+2$ elements. Prove that there exist three elements $a<b<c$ from $A$ such that $c+2a>3b$. [i]Proposed by Dominik Burek and Tomasz Ciesla, Poland[/i]