Found problems: 73
2024 Balkan MO, 1
Let $ABC$ be an acute-angled triangle with $AC > AB$ and let $D$ be the foot of the
$A$-angle bisector on $BC$. The reflections of lines $AB$ and $AC$ in line $BC$ meet $AC$ and $AB$ at points
$E$ and $F$ respectively. A line through $D$ meets $AC$ and $AB$ at $G$ and $H$ respectively such that $G$
lies strictly between $A$ and $C$ while $H$ lies strictly between $B$ and $F$. Prove that the circumcircles of
$\triangle EDG$ and $\triangle FDH$ are tangent to each other.
2025 Balkan MO, 1
An integer $n > 1$ is called $\emph{good}$ if there exists a permutation $a_1, a_2, a_3, \dots, a_n$ of the numbers $1, 2, 3, \dots, n$, such that:
$(i)$ $a_i$ and $a_{i+1}$ have different parities for every $1 \leq i \leq n-1$;
$(ii)$ the sum $a_1 + a_2 + \cdots + a_k$ is a quadratic residue modulo $n$ for every $1 \leq k \leq n$.
Prove that there exist infinitely many good numbers, as well as infinitely many positive integers which are not good.
2022 Balkan MO Shortlist, N2
Let $a, b$ and $n$ be positive integers with $a>b$ such that all of the following hold:
i. $a^{2021}$ divides $n$,
ii. $b^{2021}$ divides $n$,
iii. 2022 divides $a-b$.
Prove that there is a subset $T$ of the set of positive divisors of the number $n$ such that the sum of the elements of $T$ is divisible by 2022 but not divisible by $2022^2$.
[i]Proposed by Silouanos Brazitikos, Greece[/i]
2023 Balkan MO Shortlist, C5
Find the greatest integer $k\leq 2023$ for which the following holds: whenever Alice colours exactly $k$ numbers of the set $\{1,2,\dots, 2023\}$ in red, Bob can colour some of the remaining uncoloured numbers in blue, such that the sum of the red numbers is the same as the sum of the blue numbers.
Romania
2014 Balkan MO, 1
Let $x,y$ and $z$ be positive real numbers such that $xy+yz+xz=3xyz$. Prove that \[ x^2y+y^2z+z^2x \ge 2(x+y+z)-3 \] and determine when equality holds.
[i]UK - David Monk[/i]
2022 Balkan MO, 1
Let $ABC$ be an acute triangle such that $CA \neq CB$ with circumcircle $\omega$ and circumcentre $O$. Let $t_A$ and $t_B$ be the tangents to $\omega$ at $A$ and $B$ respectively, which meet at $X$. Let $Y$ be the foot of the perpendicular from $O$ onto the line segment $CX$. The line through $C$ parallel to line $AB$ meets $t_A$ at $Z$. Prove that the line $YZ$ passes through the midpoint of the line segment $AC$.
[i]Proposed by Dominic Yeo, United Kingdom[/i]
2025 Balkan MO, 3
Find all functions $f\colon \mathbb{R} \rightarrow \mathbb{R}$ such that for all $x,y \in \mathbb{R}$,
\[f(x+yf(x))+y = xy + f(x+y).\]
[i]Proposed by Giannis Galamatis, Greece[/i]
2019 Balkan MO Shortlist, A3
Let $a,b,c$ be real numbers such that $0 \leq a \leq b \leq c$ and $a+b+c=ab+bc+ca >0.$
Prove that $\sqrt{bc}(a+1) \geq 2$ and determine the equality cases.
(Edit: Proposed by sir Leonard Giugiuc, Romania)
2020 Balkan MO Shortlist, C2
Let $k$ be a positive integer. Determine the least positive integer $n$, with $n\geq k+1$, for which the game below can be played indefinitely:
Consider $n$ boxes, labelled $b_1,b_2,...,b_n$. For each index $i$, box $b_i$ contains exactly $i$ coins. At each step, the following three substeps are performed in order:
[b](1)[/b] Choose $k+1$ boxes;
[b](2)[/b] Of these $k+1$ boxes, choose $k$ and remove at least half of the coins from each, and add to the remaining box, if labelled $b_i$, a number of $i$ coins.
[b](3)[/b] If one of the boxes is left empty, the game ends; otherwise, go to the next step.
[i]Proposed by Demetres Christofides, Cyprus[/i]
2014 Contests, 2
A [i]special number[/i] is a positive integer $n$ for which there exists positive integers $a$, $b$, $c$, and $d$ with \[ n = \frac {a^3 + 2b^3} {c^3 + 2d^3}. \] Prove that
i) there are infinitely many special numbers;
ii) $2014$ is not a special number.
[i]Romania[/i]
2014 Balkan MO Shortlist, N4
A [i]special number[/i] is a positive integer $n$ for which there exists positive integers $a$, $b$, $c$, and $d$ with \[ n = \frac {a^3 + 2b^3} {c^3 + 2d^3}. \] Prove that
i) there are infinitely many special numbers;
ii) $2014$ is not a special number.
[i]Romania[/i]
1997 Balkan MO, 4
Find all functions $f: \mathbb R \to \mathbb R$ such that \[ f( xf(x) + f(y) ) = f^2(x) + y \] for all $x,y\in \mathbb R$.
2023 Balkan MO, 3
For each positive integer $n$, denote by $\omega(n)$ the number of distinct prime divisors of $n$ (for example, $\omega(1)=0$ and $\omega(12)=2$). Find all polynomials $P(x)$ with integer coefficients, such that whenever $n$ is a positive integer satisfying $\omega(n)>2023^{2023}$, then $P(n)$ is also a positive integer with
\[\omega(n)\ge\omega(P(n)).\]
Greece (Minos Margaritis - Iasonas Prodromidis)
2018 Balkan MO, 4
Find all primes $p$ and $q$ such that $3p^{q-1}+1$ divides $11^p+17^p$
Proposed by Stanislav Dimitrov,Bulgaria
2018 Balkan MO Shortlist, G4
A quadrilateral $ABCD$ is inscribed in a circle $k$ where $AB$ $>$ $CD$,and $AB$ is not paralel to $CD$.Point $M$ is the intersection of diagonals $AC$ and $BD$, and the perpendicular from $M$ to $AB$ intersects the segment $AB$ at a point $E$.If $EM$ bisects the angle $CED$ prove that $AB$ is diameter of $k$.
Proposed by Emil Stoyanov,Bulgaria
2024 Balkan MO, 2
Let $n \ge k \ge 3$ be integers. Show that for every integer sequence $1 \le a_1 < a_2 < . . . <
a_k \le n$ one can choose non-negative integers $b_1, b_2, . . . , b_k$, satisfying the following conditions:
[list=i]
[*] $0 \le b_i \le n$ for each $1 \le i \le k$,
[*] all the positive $b_i$ are distinct,
[*] the sums $a_i + b_i$, $1 \le i \le k$, form a permutation of the first $k$ terms of a non-constant arithmetic
progression.
[/list]
2020 Balkan MO, 3
Let $k$ be a positive integer. Determine the least positive integer $n$, with $n\geq k+1$, for which the game below can be played indefinitely:
Consider $n$ boxes, labelled $b_1,b_2,...,b_n$. For each index $i$, box $b_i$ contains exactly $i$ coins. At each step, the following three substeps are performed in order:
[b](1)[/b] Choose $k+1$ boxes;
[b](2)[/b] Of these $k+1$ boxes, choose $k$ and remove at least half of the coins from each, and add to the remaining box, if labelled $b_i$, a number of $i$ coins.
[b](3)[/b] If one of the boxes is left empty, the game ends; otherwise, go to the next step.
[i]Proposed by Demetres Christofides, Cyprus[/i]
2004 Balkan MO, 3
Let $O$ be an interior point of an acute triangle $ABC$. The circles with centers the midpoints of its sides and passing through $O$ mutually intersect the second time at the points $K$, $L$ and $M$ different from $O$. Prove that $O$ is the incenter of the triangle $KLM$ if and only if $O$ is the circumcenter of the triangle $ABC$.
2022 Balkan MO Shortlist, G1
Let $ABC$ be an acute triangle such that $CA \neq CB$ with circumcircle $\omega$ and circumcentre $O$. Let $t_A$ and $t_B$ be the tangents to $\omega$ at $A$ and $B$ respectively, which meet at $X$. Let $Y$ be the foot of the perpendicular from $O$ onto the line segment $CX$. The line through $C$ parallel to line $AB$ meets $t_A$ at $Z$. Prove that the line $YZ$ passes through the midpoint of the line segment $AC$.
[i]Proposed by Dominic Yeo, United Kingdom[/i]
2017 Balkan MO Shortlist, A1
Problem Shortlist BMO 2017
Let $ a $,$ b$,$ c$, be positive real numbers such that $abc= 1 $. Prove that
$$\frac{1}{a^{5}+b^{5}+c^{2}}+\frac{1}{b^{5}+c^{5}+a^{2}}+\frac{1}{c^{5}+b^{5}+b^{2}}\leq 1 . $$
2023 Balkan MO Shortlist, A1
Find all functions $f\colon \mathbb{R} \rightarrow \mathbb{R}$ such that for all $x,y \in \mathbb{R}$,
\[xf(x+f(y))=(y-x)f(f(x)).\]
[i]Proposed by Nikola Velov, Macedonia[/i]
2014 Balkan MO, 3
Let $ABCD$ be a trapezium inscribed in a circle $\Gamma$ with diameter $AB$. Let $E$ be the intersection point of the diagonals $AC$ and $BD$ . The circle with center $B$ and radius $BE$ meets $\Gamma$ at the points $K$ and $L$ (where $K$ is on the same side of $AB$ as $C$). The line perpendicular to $BD$ at $E$ intersects $CD$ at $M$. Prove that $KM$ is perpendicular to $DL$.
[i]Greece - Silouanos Brazitikos[/i]
2019 Balkan MO, 4
A grid consists of all points of the form $(m, n)$ where $m$ and $n$ are integers with $|m|\le 2019,|n| \le 2019$ and $|m| +|n| < 4038$. We call the points $(m,n)$ of the grid with either $|m| = 2019$ or $|n| = 2019$ the [i]boundary points[/i]. The four lines $x = \pm 2019$ and $y= \pm 2019$ are called [i]boundary lines[/i]. Two points in the grid are called [i]neighbours [/i] if the distance between them is equal to $1$.
Anna and Bob play a game on this grid.
Anna starts with a token at the point $(0,0)$. They take turns, with Bob playing first.
1) On each of his turns. Bob [i]deletes [/i] at most two boundary points on each boundary line.
2) On each of her turns. Anna makes exactly three [i]steps[/i] , where a [i]step [/i] consists of moving her token from its current point to any neighbouring point, which has not been deleted.
As soon as Anna places her token on some boundary point which has not been deleted, the game is over and Anna wins.
Does Anna have a winning strategy?
[i]Proposed by Demetres Christofides, Cyprus[/i]