Olympiad problems

2021 Bulgaria National Olympiad, 3

Find all $f:R^+ \rightarrow R^+$ such that $f(f(x) + y)f(x) = f(xy + 1)\ \ \forall x, y \in R^+$ @below: [url]https://artofproblemsolving.com/community/c6h2254883_2020_imoc_problems[/url] [quote]Feel free to start individual threads for the problems as usual[/quote]

2024-IMOC, G4

Tags: geometry , IMOC

Given triangle $ABC$ with $AB<AC$ and its circumcircle $\Omega$. Let $I$ be the incenter of $ABC$, and the feet from $I$ to $BC$ is $D$. The circle with center $A$ and radius $AI$ intersects $\Omega$ at $E$ and $F$. $P$ is a point on $EF$ such that $DP$ is parallel to $AI$. Prove that $AP$ and $MI$ intersects on $\Omega$ where $M$ is the midpoint of arc $BAC$. [hide = Remark] In the test, the incenter called $O$ and the circumcircle called $Luna$ $Cabrera$ You have to prove $AP \cap MO \in Luna$ $Cabrera$ [/hide] [i]Proposed by BlessingOfHeaven[/i]

2020-IMOC, C1

Tags: IMOC , combinatorics

Find all positive integer $N$ such that for any infinite triangular grid with exactly $N$ black unit equilateral triangles, there exists an equilateral triangle $S$ whose sides align with grid lines such that there is exactly one black unit equilateral triangle outside of $S.$ (ltf0501)

2021-IMOC qualification, N3

Tags: IMOC , number theory

Prove: There exists a positive integer $n$ with $2021$ prime divisors, satisfying $n|2^n+1$.

2024-IMOC, C2

Tags: combinatorics , game , IMOC

Given integer $n \geq 3$. There are $n$ dots marked $1$ to $n$ clockwise on a big circle. And between every two neighboring dots, there is a light. At first, every light were dark. A and B are playing a game, A pick up $n$ pairs from $\{ (i,j)|1 \leq i < j \leq n \}$ and for every pairs $(i,j)$. B starts from the point marked $i$ and choose to walk clockwise or counterclockwise to the point marked $j$. And B invert the status of all passing lights (bright $\leftrightarrow$ dark) A hopes the number of dark light can be as much as possible while B hopes the number of bright light can be as much as possible. Suppose A, B are both smart, how many lights are bright in the end? [i]Proposed by BlessingOfHeaven[/i] [img]https://pbs.twimg.com/profile_images/1014932415201120256/u9KAaMZ4_400x400.jpg[/img]

2024-IMOC, A1

Tags: algebra , IMOC , inequalities , series

Given a positive integer $N$. Prove that \[\sum_{m=1}^N \sum_{n=1}^N \frac{1}{mn^2+m^2n+2mn}<\frac{7}{4}.\] [i]Proposed by tan-1[/i]

2020-IMOC, A3

Tags: quadratics , inequalities , IMOC , Taiwan

$\definecolor{A}{RGB}{250,120,0}\color{A}\fbox{A3.}$ Assume that $a, b, c$ are positive reals such that $a + b + c = 3$. Prove that $$\definecolor{A}{RGB}{200,0,200}\color{A} \frac{1}{8a^2-18a+11}+\frac{1}{8b^2-18b+11}+\frac{1}{8c^2-18c+11}\le 3.$$ [i]Proposed by [/i][b][color=#419DAB]ltf0501[/color][/b]. [color=#3D9186]#1734[/color]

2024-IMOC, C5

Tags: combinatorics , IMOC

Given integer $n\geq 2$, two invisible [color=#eee]rabbits[/color] (rabbits) discussed their strategy and was sent to two points $A, B$ with distance $n$ units on a plane, respectively. However, they do not know whether they are on the same or different side of the plane (when facing each other, the might view the left/right direction as the same or different). They both can see points $A,B$, and they need to hop to each other's starting point. Each hop would measure $1$ unit in distance, and they would jump and land at the same time for each round. However, if at any time they landed no more than $1$ unit away, they'll both turn into deer. Find the minimum number of round they need to reach their destiny while ensuring they won't turn into deer. [i]Proposed by redshrimp[/i]

2019-IMOC, N1

Tags: number theory , IMOC

Find all pairs of positive integers $(x, y)$ so that $$(xy - 6)^2 | x^2 + y^2$$

2022-IMOC, N2

Tags: IMOC , number theory

For a positive integer $n$, define $f(x)$ to be the smallest positive integer $x$ satisfying the following conditions: there exists a positive integer $k$ and $k$ distinct positive integers $n=a_0<a_1<a_2<\cdots<a_{k-1}=x$ such that $a_0a_1\cdots a_{k-1}$ is a perfect square. Find the smallest real number $c$ such that there exists a positive integer $N$ such that for all $n>N$ we have $f(n)\leq cn$. [i]Proposed by Fysty and amano_hina[/i]

2020-IMOC, N1

Tags: IMOC , equation , Integer , number theory

$\textbf{N1.}$ Find all nonnegative integers $a,b,c$ such that \begin{align*} a^2+b^2+c^2-ab-bc-ca = a+b+c \end{align*} [i]Proposed by usjl[/i]

2021-IMOC, C4

Tags: combinatorics , graph theory , IMOC , 2021

There is a city with many houses, where the houses are connected by some two-way roads. It is known that for any two houses $A,B$, there is exactly one house $C$ such that both $A,B$ are connected to $C$. Show that for any two houses not connected directly by a road, they have the same number of roads adjacent to them. [i]ST[/i]

2021-IMOC, C6

Tags: combinatorics , graph theory , IMOC

Two people play a game on a graph with $2022$ points. Initially, there are no edges in the graph. They take turns and connect two non-neighbouring vertices with an edge. Whoever makes the graph connected loses. Which player has a winning strategy? [i]ST, danny2915[/i]

2022-IMOC, N5

Tags: IMOC , number theory

Find all solution $(p,r)$ of the "Pythagorean-Euler Theorem" $$p^p+(p+1)^p+\cdots+(p+r)^p=(p+r+1)^p$$Where $p$ is a prime and $r$ is a positive integer. [i]Proposed by Li4 and Untro368[/i]