This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 17

2009 Balkan MO, 2

Let $ MN$ be a line parallel to the side $ BC$ of a triangle $ ABC$, with $ M$ on the side $ AB$ and $ N$ on the side $ AC$. The lines $ BN$ and $ CM$ meet at point $ P$. The circumcircles of triangles $ BMP$ and $ CNP$ meet at two distinct points $ P$ and $ Q$. Prove that $ \angle BAQ = \angle CAP$. [i]Liubomir Chiriac, Moldova[/i]

2009 Balkan MO, 1

Solve the equation \[ 3^x \minus{} 5^y \equal{} z^2.\] in positive integers. [i]Greece[/i]

2016 Balkan MO, 2

Let $ABCD$ be a cyclic quadrilateral with $AB<CD$. The diagonals intersect at the point $F$ and lines $AD$ and $BC$ intersect at the point $E$. Let $K$ and $L$ be the orthogonal projections of $F$ onto lines $AD$ and $BC$ respectively, and let $M$, $S$ and $T$ be the midpoints of $EF$, $CF$ and $DF$ respectively. Prove that the second intersection point of the circumcircles of triangles $MKT$ and $MLS$ lies on the segment $CD$. [i](Greece - Silouanos Brazitikos)[/i]

2009 Balkan MO Shortlist, N2

Solve the equation \[ 3^x \minus{} 5^y \equal{} z^2.\] in positive integers. [i]Greece[/i]

2022 Balkan MO Shortlist, C4

Consider an $n \times n$ grid consisting of $n^2$ until cells, where $n \geq 3$ is a given odd positive integer. First, Dionysus colours each cell either red or blue. It is known that a frog can hop from one cell to another if and only if these cells have the same colour and share at least one vertex. Then, Xanthias views the colouring and next places $k$ frogs on the cells so that each of the $n^2$ cells can be reached by a frog in a finite number (possible zero) of hops. Find the least value of $k$ for which this is always possible regardless of the colouring chosen by Dionysus. [i]Proposed by Tommy Walker Mackay, United Kingdom[/i]

2014 Balkan MO Shortlist, N1

$\boxed{N1}$Let $n$ be a positive integer,$g(n)$ be the number of positive divisors of $n$ of the form $6k+1$ and $h(n)$ be the number of positive divisors of $n$ of the form $6k-1,$where $k$ is a nonnegative integer.Find all positive integers $n$ such that $g(n)$ and $h(n)$ have different parity.

2009 Balkan MO Shortlist, G4

Let $ MN$ be a line parallel to the side $ BC$ of a triangle $ ABC$, with $ M$ on the side $ AB$ and $ N$ on the side $ AC$. The lines $ BN$ and $ CM$ meet at point $ P$. The circumcircles of triangles $ BMP$ and $ CNP$ meet at two distinct points $ P$ and $ Q$. Prove that $ \angle BAQ = \angle CAP$. [i]Liubomir Chiriac, Moldova[/i]

2021 Balkan MO Shortlist, A3

Find all functions $f: \mathbb{R}^{+} \rightarrow \mathbb{R}^{+}$, such that $f(x+f(x)+f(y))=2f(x)+y$ for all positive reals $x,y$. [i]Proposed by Athanasios Kontogeorgis, Greece[/i]

2021 Balkan MO, 4

Problem 4. Angel has a warehouse, which initially contains $100$ piles of $100$ pieces of rubbish each. Each morning, Angel performs exactly one of the following moves: (a) He clears every piece of rubbish from a single pile. (b) He clears one piece of rubbish from each pile. However, every evening, a demon sneaks into the warehouse and performs exactly one of the following moves: (a) He adds one piece of rubbish to each non-empty pile. (b) He creates a new pile with one piece of rubbish. What is the first morning when Angel can guarantee to have cleared all the rubbish from the warehouse?

2016 Balkan MO Shortlist, G2

Let $ABCD$ be a cyclic quadrilateral with $AB<CD$. The diagonals intersect at the point $F$ and lines $AD$ and $BC$ intersect at the point $E$. Let $K$ and $L$ be the orthogonal projections of $F$ onto lines $AD$ and $BC$ respectively, and let $M$, $S$ and $T$ be the midpoints of $EF$, $CF$ and $DF$ respectively. Prove that the second intersection point of the circumcircles of triangles $MKT$ and $MLS$ lies on the segment $CD$. [i](Greece - Silouanos Brazitikos)[/i]

2022 Balkan MO, 4

Consider an $n \times n$ grid consisting of $n^2$ until cells, where $n \geq 3$ is a given odd positive integer. First, Dionysus colours each cell either red or blue. It is known that a frog can hop from one cell to another if and only if these cells have the same colour and share at least one vertex. Then, Xanthias views the colouring and next places $k$ frogs on the cells so that each of the $n^2$ cells can be reached by a frog in a finite number (possible zero) of hops. Find the least value of $k$ for which this is always possible regardless of the colouring chosen by Dionysus. [i]Proposed by Tommy Walker Mackay, United Kingdom[/i]

2017 Balkan MO Shortlist, N4

Find all pairs of positive integers $(x,y)$ , such that $x^2$ is divisible by $2xy^2 -y^3 +1$.

2021 Balkan MO, 2

Find all functions $f: \mathbb{R}^{+} \rightarrow \mathbb{R}^{+}$, such that $f(x+f(x)+f(y))=2f(x)+y$ for all positive reals $x,y$. [i]Proposed by Athanasios Kontogeorgis, Greece[/i]

2017 Balkan MO, 2

Consider an acute-angled triangle $ABC$ with $AB<AC$ and let $\omega$ be its circumscribed circle. Let $t_B$ and $t_C$ be the tangents to the circle $\omega$ at points $B$ and $C$, respectively, and let $L$ be their intersection. The straight line passing through the point $B$ and parallel to $AC$ intersects $t_C$ in point $D$. The straight line passing through the point $C$ and parallel to $AB$ intersects $t_B$ in point $E$. The circumcircle of the triangle $BDC$ intersects $AC$ in $T$, where $T$ is located between $A$ and $C$. The circumcircle of the triangle $BEC$ intersects the line $AB$ (or its extension) in $S$, where $B$ is located between $S$ and $A$. Prove that $ST$, $AL$, and $BC$ are concurrent. $\text{Vangelis Psychas and Silouanos Brazitikos}$

2010 Balkan MO Shortlist, A4

Let $n>2$ be a positive integer. Consider all numbers $S$ of the form \begin{align*} S= a_1 a_2 + a_2 a_3 + \ldots + a_{k-1} a_k \end{align*} with $k>1$ and $a_i$ begin positive integers such that $a_1+a_2+ \ldots + a_k=n$. Determine all the numbers that can be represented in the given form.

2021 Balkan MO Shortlist, C5

Problem 4. Angel has a warehouse, which initially contains $100$ piles of $100$ pieces of rubbish each. Each morning, Angel performs exactly one of the following moves: (a) He clears every piece of rubbish from a single pile. (b) He clears one piece of rubbish from each pile. However, every evening, a demon sneaks into the warehouse and performs exactly one of the following moves: (a) He adds one piece of rubbish to each non-empty pile. (b) He creates a new pile with one piece of rubbish. What is the first morning when Angel can guarantee to have cleared all the rubbish from the warehouse?

2017 Balkan MO Shortlist, G3

Consider an acute-angled triangle $ABC$ with $AB<AC$ and let $\omega$ be its circumscribed circle. Let $t_B$ and $t_C$ be the tangents to the circle $\omega$ at points $B$ and $C$, respectively, and let $L$ be their intersection. The straight line passing through the point $B$ and parallel to $AC$ intersects $t_C$ in point $D$. The straight line passing through the point $C$ and parallel to $AB$ intersects $t_B$ in point $E$. The circumcircle of the triangle $BDC$ intersects $AC$ in $T$, where $T$ is located between $A$ and $C$. The circumcircle of the triangle $BEC$ intersects the line $AB$ (or its extension) in $S$, where $B$ is located between $S$ and $A$. Prove that $ST$, $AL$, and $BC$ are concurrent. $\text{Vangelis Psychas and Silouanos Brazitikos}$