Olympiad problems

2023 USA IMO Team Selection Test, 4

Let $\lfloor \bullet \rfloor$ denote the floor function. For nonnegative integers $a$ and $b$, their [i]bitwise xor[/i], denoted $a \oplus b$, is the unique nonnegative integer such that $$ \left \lfloor \frac{a}{2^k} \right \rfloor+ \left\lfloor\frac{b}{2^k} \right\rfloor - \left\lfloor \frac{a\oplus b}{2^k}\right\rfloor$$ is even for every $k \ge 0$. Find all positive integers $a$ such that for any integers $x>y\ge 0$, we have \[ x\oplus ax \neq y \oplus ay. \] [i]Carl Schildkraut[/i]

2023 USA IMOTST, 2

Tags: combinatorics , USA TST , USA TST 2023 , game , ilostthegame , BALLLIGHTNING

Let $m$ and $n$ be fixed positive integers. Tsvety and Freyja play a game on an infinite grid of unit square cells. Tsvety has secretly written a real number inside of each cell so that the sum of the numbers within every rectangle of size either $m$ by $n$ or $n$ by $m$ is zero. Freyja wants to learn all of these numbers. One by one, Freyja asks Tsvety about some cell in the grid, and Tsvety truthfully reveals what number is written in it. Freyja wins if, at any point, Freyja can simultaneously deduce the number written in every cell of the entire infinite grid (If this never occurs, Freyja has lost the game and Tsvety wins). In terms of $m$ and $n$, find the smallest number of questions that Freyja must ask to win, or show that no finite number of questions suffice. [i]Nikolai Beluhov[/i]

2023 USA EGMO Team Selection Test, 5

Tags: floor function , algebra , function , USA TST , USA TST 2023

Let $\lfloor \bullet \rfloor$ denote the floor function. For nonnegative integers $a$ and $b$, their [i]bitwise xor[/i], denoted $a \oplus b$, is the unique nonnegative integer such that $$ \left \lfloor \frac{a}{2^k} \right \rfloor+ \left\lfloor\frac{b}{2^k} \right\rfloor - \left\lfloor \frac{a\oplus b}{2^k}\right\rfloor$$ is even for every $k \ge 0$. Find all positive integers $a$ such that for any integers $x>y\ge 0$, we have \[ x\oplus ax \neq y \oplus ay. \] [i]Carl Schildkraut[/i]

2023 USA EGMO Team Selection Test, 4

Tags: geometry , TST , USA TST , USA TST 2023

Let $ABC$ be a triangle with $AB+AC=3BC$. The $B$-excircle touches side $AC$ and line $BC$ at $E$ and $D$, respectively. The $C$-excircle touches side $AB$ at $F$. Let lines $CF$ and $DE$ meet at $P$. Prove that $\angle PBC = 90^{\circ}$. [i]Ray Li[/i]

2023 USA IMO Team Selection Test, 5

Tags: combinatorics , USA TST , USA TST 2023 , game , ilostthegame , BALLLIGHTNING

Let $m$ and $n$ be fixed positive integers. Tsvety and Freyja play a game on an infinite grid of unit square cells. Tsvety has secretly written a real number inside of each cell so that the sum of the numbers within every rectangle of size either $m$ by $n$ or $n$ by $m$ is zero. Freyja wants to learn all of these numbers. One by one, Freyja asks Tsvety about some cell in the grid, and Tsvety truthfully reveals what number is written in it. Freyja wins if, at any point, Freyja can simultaneously deduce the number written in every cell of the entire infinite grid (If this never occurs, Freyja has lost the game and Tsvety wins). In terms of $m$ and $n$, find the smallest number of questions that Freyja must ask to win, or show that no finite number of questions suffice. [i]Nikolai Beluhov[/i]

2023 USA IMOTST, 1

Tags: floor function , algebra , function , USA TST , USA TST 2023

Let $\lfloor \bullet \rfloor$ denote the floor function. For nonnegative integers $a$ and $b$, their [i]bitwise xor[/i], denoted $a \oplus b$, is the unique nonnegative integer such that $$ \left \lfloor \frac{a}{2^k} \right \rfloor+ \left\lfloor\frac{b}{2^k} \right\rfloor - \left\lfloor \frac{a\oplus b}{2^k}\right\rfloor$$ is even for every $k \ge 0$. Find all positive integers $a$ such that for any integers $x>y\ge 0$, we have \[ x\oplus ax \neq y \oplus ay. \] [i]Carl Schildkraut[/i]

2023 USA EGMO Team Selection Test, 6

Tags: combinatorics , USA TST , USA TST 2023 , game , ilostthegame , BALLLIGHTNING

Let $m$ and $n$ be fixed positive integers. Tsvety and Freyja play a game on an infinite grid of unit square cells. Tsvety has secretly written a real number inside of each cell so that the sum of the numbers within every rectangle of size either $m$ by $n$ or $n$ by $m$ is zero. Freyja wants to learn all of these numbers. One by one, Freyja asks Tsvety about some cell in the grid, and Tsvety truthfully reveals what number is written in it. Freyja wins if, at any point, Freyja can simultaneously deduce the number written in every cell of the entire infinite grid (If this never occurs, Freyja has lost the game and Tsvety wins). In terms of $m$ and $n$, find the smallest number of questions that Freyja must ask to win, or show that no finite number of questions suffice. [i]Nikolai Beluhov[/i]

2023 USA IMO Team Selection Test, 6

Tags: function , algebra , USA TST , USA TST 2023

Let $\mathbb{N}$ denote the set of positive integers. Fix a function $f: \mathbb{N} \rightarrow \mathbb{N}$ and for any $m,n \in \mathbb{N}$ define $$\Delta(m,n)=\underbrace{f(f(\ldots f}_{f(n)\text{ times}}(m)\ldots))-\underbrace{f(f(\ldots f}_{f(m)\text{ times}}(n)\ldots)).$$ Suppose $\Delta(m,n) \neq 0$ for any distinct $m,n \in \mathbb{N}$. Show that $\Delta$ is unbounded, meaning that for any constant $C$ there exists $m,n \in \mathbb{N}$ with $\left|\Delta(m,n)\right| > C$.

2023 USA IMOTST, 3

Tags: function , algebra , USA TST , USA TST 2023

Let $\mathbb{N}$ denote the set of positive integers. Fix a function $f: \mathbb{N} \rightarrow \mathbb{N}$ and for any $m,n \in \mathbb{N}$ define $$\Delta(m,n)=\underbrace{f(f(\ldots f}_{f(n)\text{ times}}(m)\ldots))-\underbrace{f(f(\ldots f}_{f(m)\text{ times}}(n)\ldots)).$$ Suppose $\Delta(m,n) \neq 0$ for any distinct $m,n \in \mathbb{N}$. Show that $\Delta$ is unbounded, meaning that for any constant $C$ there exists $m,n \in \mathbb{N}$ with $\left|\Delta(m,n)\right| > C$.