Found problems: 64
2024-IMOC, C7
On a plane there is an invisible [color=#eee]rabbit[/color] (rabbit) hiding on a lattice point. We want to put $n$ hunters on some lattice points to catch the rabbit. In a turn each hunter can choose to shoot to left/right or top/bottom direction. On the $i$th turn there will be these steps in order
1. The rabbit jumps to an adjacent lattice point on the top, bottom, left, or right.
2. item Each hunter moves to an adjacent lattice point on the top, bottom, left or right (each hunter can move to different direction). Then they shoot a bullet which travels $\frac{334111214}{334111213}i$ units on the directions they chose.
If a bullet hits the rabbit then it is caught. Find the smallest number $n$ such that the rabbit would definitely be caught in a finite number of turns.
[i]Proposed by tob8y[/i]
2017-IMOC, C6
Consider a convex polygon in a plane such that the length of all edges and diagonals are rational. After connecting all diagonals, prove that any length of a segment is rational.
2024-IMOC, G3
Triangle $ABC$ has circumcircle $\Omega$ and incircle $\omega$, where $\omega$ is tangent to $BC, CA, AB$ at $D,E,F$, respectively. $T$ is an arbitrary point on $\omega$. $EF$ meets $BC$ at $K$, $AT$ meets $\Omega$ again at $P$, $PK$ meets $\Omega$ again at $S$. $X$ is a point on $\Omega$ such that $S, D, X$ are colinear. Let $Y$ be the intersection of $AX$ and $EF$, prove that $YT$ is tangent to $\omega$.
[i]Proposed by chengbilly[/i]
2021-IMOC, C8
Find all positive integers $m,n$ such that the $m \times n$ grid can be tiled with figures formed by deleting one of the corners of a $2 \times 3$ grid.
[i]usjl, ST[/i]
2023-IMOC, A5
We can conduct the following moves to a real number $x$: choose a positive integer $n$, and positives reals $a_1,a_2,\cdots, a_n$ whose reciprocals sum up to $1$. Let $x_0=x$, and $x_k=\sqrt{x_{k-1}a_k}$ for all $1\leq k\leq n$. Finally, let $y=x_n$. We said $M>0$ is "tremendous" if for any $x\in \mathbb{R}^+$, we can always choose $n,a_1,a_2,\cdots, a_n$ to make the resulting $y$ smaller than $M$. Find all tremendous numbers.
[i]Proposed by ckliao914.[/i]
2020-IMOC, N4
$\textbf{N4:} $ Let $a,b$ be two positive integers such that for all positive integer $n>2020^{2020}$, there exists a positive integer $m$ coprime to $n$ with
\begin{align*} \text{ $a^n+b^n \mid a^m+b^m$} \end{align*}
Show that $a=b$
[i]Proposed by ltf0501[/i]
2022-IMOC, C4
Let $N$ be a given positive integer. Consider a permutation of $1,2,3,\cdots,N$, denoted as $p_1,p_2,\cdots,p_N$. For a section $p_l, p_{l+1},\cdots, p_r$, we call it "extreme" if $p_l$ and $p_r$ are the maximum and minimum value of that section. We say a permutation $p_1,p_2,\cdots,p_N$ is "super balanced" if there isn't an "extreme" section with a length at least $3$. For example, $1,4,2,3$ is "super balanced", but $3,1,2,4$ isn't. Please answer the following questions:
1. How many "super balanced" permutations are there?
2. For each integer $M\leq N$. How many "super balanced" permutations are there such that $p_1=M$?
[i]Proposed by ltf0501[/i]
2019-IMOC, A1
Find all functions $f:\mathbb{R}\to\mathbb{R}$ such that for all $x,y\in\mathbb{R}$,
$$f(xy+f(x))=f(xf(y))+x$$
2024-IMOC, C6
On an $m\times n$ grid there's a snail in each cell. Each round, the snail army can choose four snail in a $2\times 2$ square and make them perform the complete [b]Quadrilateral Dance[/b], which is rotating the four snails clockwise by $90$ degrees, moving each one to an adjacent cell. Find all pairs of positive integers $(m,n)$ such that the snails can achieve any permutation by performing a finite number of times of [b]Quadrilateral Dance[/b].
[i]Proposed by chengbilly[/i]
2022-IMOC, C6
Let $k\geq4$ be an integer. Sunny and Ming play a game with strings. A string is a sequence that every element of it is an integer between $1$ and $k$, inclusive. At first, Sunny chooses two positive integers $N,L\geq2$ and write down $N$ strings, each having length $L$. Then Ming mark at most $\frac{N}{2}$ strings. Then Sunny chooses an unmarked string $s$ and calculate the biggest integer $n$ such that there exists another string satisfying its first $n$ element is the same as the first $n$ element of $s$. Then Sunny burn down all strings which first $n$ element if different from the first $n$ element of $s$, leaving only the ones which have the same first $n$ element of $s$. Finally, Ming chooses an integer $d$ between $1$ and $k$, inclusive, and remove all strings which $(n+1)$th element is $d$. Sunny's score would be the number of strings left. Find the maximum score that Sunny can guarantee to get.
[i]Proposed by USJL[/i]
2024-IMOC, G7
Triangle $ABC$ has circumcenter $O$ and incenter $I$. The incircle is tangent to $AC, AB$ at $E, F$, respectively. $H$ is the orthocenter of $\triangle BIC$. $\odot(AEF)$ and $\odot(ABC)$ intersects again at $S$. $BC, AH$ intersects $OI$ again at $J, K$, respectively. Prove that $H, K, J, S$ are concyclic.
[i]Proposed by chengbilly[/i]
2020-IMOC, N3
$\textbf{N3:}$ For any positive integer $n$, define $rad(n)$ to be the product of all prime divisors of $n$ (without multiplicities), and in particular $rad(1)=1$. Consider an infinite sequence of positive integers $\{a_n\}_{n=1}^{\infty}$ satisfying that
\begin{align*} a_{n+1} = a_n + rad(a_n), \: \forall n \in \mathbb{N} \end{align*}
Show that there exist positive integers $t,s$ such that $a_t$ is the product of the $s$ smallest primes.
[i]Proposed by ltf0501[/i]
2024-IMOC, A2
Given integer $n \geq 3$ and $x_1$, $x_2$, …, $x_n$ be $n$ real numbers satisfying $|x_1|+|x_2|+…+|x_n|=1$. Find the minimum of
\[|x_1+x_2|+|x_2+x_3|+…+|x_{n-1}+x_n|+|x_n+x_1|.\]
[i]Proposed by snap7822[/i]
2021-IMOC, C1
The numbers $1,2,\cdots,2021$ are arranged in a circle. For any $1 \le i \le 2021$, if $i,i+1,i+2$ are three consecutive numbers in some order such that $i+1$ is not in the middle, then $i$ is said to be a good number. Indices are taken mod $2021$. What is the maximum possible number of good numbers?
[i]CSJL[/i]
2023-IMOC, A6
We define \[f(x,y,z)=|xy|\sqrt{x^2+y^2}+|yz|\sqrt{y^2+z^2}+|zx|\sqrt{z^2+x^2}.\]
Find the best constants $c_1,c_2\in\mathbb{R}$ such that \[c_1(x^2+y^2+z^2)^{3/2}\leq f(x,y,z)\leq c_1(x^2+y^2+z^2)^{3/2}\] hold for all reals $x,y,z$ satisfying $x+y+z=0$.
[i]Proposed by Untro368.[/i]
2024-IMOC, G2
Triangle $ABC$ has circumcenter $O$. $D$ is an arbitrary point on $BC$, and $AD$ intersects $\odot(ABC)$ at $E$. $S$ is a point on $\odot(ABC)$ such that $D, O, E, S$ are colinear. $AS$ intersects $BC$ at $P$. $Q$ is a point on $BC$ such that $D, O, A, Q$ are concylic. Prove that $\odot(ABC)$ is tangent to $\odot (APQ)$.
[i]Proposed by chengbilly[/i]
2021-IMOC, N10
A prime is called [i]perfect[/i] if there is a permutation $a_1, a_2, \cdots, a_{\frac{p-1}{2}}, b_1, b_2, \cdots, b_{\frac{p-1}{2}}$ of $1, 2, \cdots, p-1$ satisfies $$b_i \equiv a_i + \frac{1}{a_i} \pmod p$$ for all $1 \le i \le \frac{p-1}{2}$. Show that there are infinitely many primes that are not perfect.
[i]Proposed By - CSJL[/i]
2024-IMOC, G5
Triangle $ABC$ satisfying $AB<AC$ has circumcircle $\Omega$. $E, F$ lies on $AC, AB$, respectively, such that $BCEF$ is cyclic. $T$ lies on $EF$ such that $\odot(TEF)$ is tangent to $BC$ at $T$. $A'$ is the antipode of $A$ on $\Omega$. $TA', TA$ intersects $\Omega$ again at $X, Y$, respectively, and $EF$ intersects $\odot(TXY)$ again at $W$. Prove that $\measuredangle WBA=\measuredangle ACW$
[i]Proposed by BlessingOfHeaven[/i]
2024-IMOC, C3
There are $n$ snails on the plane where the $i$ snail has $a_i$ attack and $d_i$ defense, where $a_i, d_i\in \mathbb{R}$ and each snail has a distinct attack and a distinct defense. We said a 4-tuple of subsets of snails $(S_1, S_2, S_3, S_4)$ is [b]balanced[/b] if $|S_1|+|S_3|$ is either $\lceil n/2\rceil$ or $\lfloor n/2\rfloor$ and there exist real numbers $A, D$ such that
\begin{align*}
S_1=\{i\ |\ a_i\geq A\text{ and } d_i\geq D, 1\leq i\leq n\}\\
S_2=\{i\ |\ a_i<A\text{ and } d_i\geq D, 1\leq i\leq n\}\\
S_3=\{i\ |\ a_i< A\text{ and } d_i< D, 1\leq i\leq n\}\\
S_4=\{i\ |\ a_i\geq A\text{ and } d_i< D, 1\leq i\leq n\}
\end{align*}
Find the largest integer $k$ such that there is always at least $k$ [b]balanced[/b] 4-tuples of subsets.
[i]Proposed by redshrimp[/i]
2022-IMOC, N6
Find all integer coefficient polynomial $P(x)$ such that for all positive integer $x$, we have $$\tau(P(x))\geq\tau(x)$$Where $\tau(n)$ denotes the number of divisors of $n$. Define $\tau(0)=\infty$.
Note: you can use this conclusion. For all $\epsilon\geq0$, there exists a positive constant $C_\epsilon$ such that for all positive integer $n$, the $n$th smallest prime is at most $C_\epsilon n^{1+\epsilon}$.
[i]Proposed by USJL[/i]
2020-IMOC, C6
$\definecolor{A}{RGB}{70,255,50}\color{A}\fbox{C6.}$ There are $n$ $\definecolor{A}{RGB}{0,0,255}\color{A}\text{boys}$ and $n$ $\definecolor{A}{RGB}{255,0,255}\color{A}\text{girls}$ in a club. Some of them are friends with each other. The $\definecolor{A}{RGB}{0,0,255}\color{A}\text{boys}$ want to get into a [i]relationship[/i], so some subset of them wants to ask some $\definecolor{A}{RGB}{255,0,255}\color{A}\text{girls}$ out for a trip. Because the $\definecolor{A}{RGB}{0,0,255}\color{A}\text{boys}$ are shy, for a nonempty set $B$ of $\definecolor{A}{RGB}{0,0,255}\color{A}\text{boys}$, they want to make sure that each of the girl they ask out is friend with one of the $\definecolor{A}{RGB}{0,0,255}\color{A}\text{boys}$ in $B$. If the number of $\definecolor{A}{RGB}{255,0,255}\color{A}\text{girls}$ they are able to ask out is smaller than the number of the $\definecolor{A}{RGB}{0,0,255}\color{A}\text{boys}$ in $B$, then the nonempty set $B$ of those $\definecolor{A}{RGB}{0,0,255}\color{A}\text{boys}$ is called a group of complete losers.
Show that for any $0 \le k < 2n$, there exists an arrangement of the [i]friendships[/i] among those $2n$ people so that there are exactly $k$ groups of complete losers.
[i]Proposed by [/i][b][color=#419DAB]ltf0501[/color][/b].
[color=#3D9186]#1737[/color]
2020-IMOC, C4
$\definecolor{A}{RGB}{70,80,0}\color{A}\fbox{C4.}$ Show that for any positive integer $n \ge 3$ and some subset of $\lbrace{1, 2, . . . , n}\rbrace$ with size more than $\frac{n}2 + 1$, there exist three distinct elements $a, b, c$ in the subset such that $$\definecolor{A}{RGB}{255,70,255}\color{A} (ab)^2 + (bc)^2 + (ca)^2$$is a perfect square.
[i]Proposed by [/i][b][color=#419DAB]ltf0501[/color][/b].
[color=#3D9186]#1736[/color]
2021-IMOC qualification, N2
Prove: for all positive integers $m, n$
$\frac 1m + \frac 1{m+1} + \dotsb + \frac 1 {m+n} $ is not an integer.
2017-IMOC, C7
There are $12$ monsters in a plane. Each monster is capable of spraying fire in a $30$-degree cone. Prove that monsters can destroy the plane.
2020-IMOC, A1
$\definecolor{A}{RGB}{190,0,60}\color{A}\fbox{A1.}$ Find all $f:\mathbb{R}\rightarrow \mathbb{R}$ such that $$\definecolor{A}{RGB}{80,0,200}\color{A} x^4+y^4+z^4\ge f(xy)+f(yz)+f(zx)\ge xyz(x+y+z)$$holds for all $a,b,c\in\mathbb{R}$.
[i]Proposed by [/i][b][color=#FFFF00]usjl[/color][/b].
[color=#B6D7A8]#1733[/color]