Found problems: 76
Are there any positive integers $m$ and $n$ satisfying the equation
$m^3 = 9n^4 + 170n^2 + 289$ ?
Let $\triangle ABC$ be an acute triangle. The line through $A$ perpendicular to $BC$ intersects $BC$ at $D$.
Let $E$ be the midpoint of $AD$ and $\omega$ the the circle with center $E$ and radius equal to $AE$. The line
$BE$ intersects $\omega$ at a point $X$ such that $X$ and $B$ are not on the same side of $AD$ and the line $CE$
intersects $\omega$ at a point $Y$ such that $C$ and $Y$ are not on the same side of $AD$. If both of the intersection
points of the circumcircles of $\triangle BDX$ and $\triangle CDY$ lie on the line $AD$, prove that $AB = AC$.
Let $n$ be a positive integer. We are given a $3n \times 3n$ board whose unit squares are colored in black and white in such way that starting with the top left square, every third diagonal is colored in black and the rest of the board is in white. In one move, one can take a $2 \times 2$ square and change the color of all its squares in such way that white squares become orange, orange ones become black and black ones become white. Find all $n$ for which, using a finite number of moves, we can make all the squares which were initially black white, and all squares which were initially white black.
Proposed by [i]Boris Stanković and Marko Dimitrić, Bosnia and Herzegovina[/i]
In an exotic country, the National Bank issues coins that can take any value in the interval $[0, 1]$. Find the smallest constant $c > 0$ such that the following holds, no matter the situation in that country:
[i]Any citizen of the exotic country that has a finite number of coins, with a total value of no more than $1000$, can split those coins into $100$ boxes, such that the total value inside each box is at most $c$.[/i]
Determine all pairs $(k, n)$ of positive integers that satisfy
$$1! + 2! + ... + k! = 1 + 2 + ... + n.$$
Let $ABC$ be an acute triangle with $AC > AB$ and circumcircle $\Gamma$. The tangent from $A$
to $\Gamma$ intersects $BC$ at $T$. Let $M$ be the midpoint of $BC$ and let $R$ be the reflection of $A$ in $B$.
Let $S$ be a point so that $SABT$ is a parallelogram and finally let $P$ be a point on line $SB$ such
that $MP$ is parallel to $AB$.
Given that $P$ lies on $\Gamma$, prove that the circumcircle of $\triangle STR$ is tangent to line $AC$.
[i]Proposed by Sam Bealing, United Kingdom[/i]
Viktor and Natalia bought $2020$ buckets of ice-cream and want to organize a degustation schedule with $2020$ rounds such that:
- In every round, both of them try $1$ ice-cream, and those $2$ ice-creams tried in a single round
are different from each other.
- At the end of the $2020$ rounds, both of them have tried each ice-cream exactly once.
We will call a degustation schedule fair if the number of ice-creams that were tried by Viktor before Natalia is equal to the number of ice creams tried by Natalia before Viktor.
Prove that the number of fair schedules is strictly larger than $2020!(2^{1010} + (1010!)^2)$.
[i]Proposed by Viktor Simjanoski, Macedonia
[/i]
Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that
$$f(x^2 + y) \ge (\frac{1}{x} + 1)f(y)$$
holds for all $x \in \mathbb{R} \setminus \{0\}$ and all $y \in \mathbb{R}$.
Find all positive integers $n$ for which there exists an integer multiple of $2022$ such that the sum of the squares of its digits is equal to $n$.
Denote by $l(n)$ the largest prime divisor of $n$. Let $a_{n+1} = a_n + l(a_n)$ be a recursively
defined sequence of integers with $a_1 = 2$. Determine all natural numbers $m$ such that there
exists some $i \in \mathbb{N}$ with $a_i = m^2$.
[i]Proposed by Nikola Velov, North Macedonia[/i]
Let $ABC$ be an acute triangle such that $AB < AC$. Let $\omega$ be the circumcircle of $ABC$
and assume that the tangent to $\omega$ at $A$ intersects the line $BC$ at $D$. Let $\Omega$ be the circle with
center $D$ and radius $AD$. Denote by $E$ the second intersection point of $\omega$ and $\Omega$. Let $M$ be the
midpoint of $BC$. If the line $BE$ meets $\Omega$ again at $X$, and the line $CX$ meets $\Omega$ for the second
time at $Y$, show that $A, Y$, and $M$ are collinear.
[i]Proposed by Nikola Velov, North Macedonia[/i]
Let $n \geq 2$ be an integer and let \[M=\bigg\{\frac{a_1 + a_2 + ... + a_k}{k}: 1 \le k \le n\text{ and }1 \le a_1 < \ldots < a_k \le n\bigg\}\] be the set of the arithmetic means of the elements of all non-empty subsets of $\{1, 2, ..., n\}$. Find \[\min\{|a - b| : a, b \in M\text{ with } a \neq b\}.\]
In an exotic country, the National Bank issues coins that can take any value in the interval $[0, 1]$. Find the smallest constant $c > 0$ such that the following holds, no matter the situation in that country:
[i]Any citizen of the exotic country that has a finite number of coins, with a total value of no more than $1000$, can split those coins into $100$ boxes, such that the total value inside each box is at most $c$.[/i]
Let $n \ge 2$ be an integer. In each cell of a $4n \times 4n$ table we write the sum of the cell row index and the cell column index. Initially, no cell is colored. A move consists of choosing two cells which are not colored and coloring one of them in red and one of them in blue.
Show that, however Alex perfors $n^2$ moves, Jane can afterwards perform a number of moves (eventually none) after which the sum of the numbers written in the red cells is the same as the sum of the numbers written in the blue ones.
Let $n$ be a positive integer. We are given a $3n \times 3n$ board whose unit squares are colored in black and white in such way that starting with the top left square, every third diagonal is colored in black and the rest of the board is in white. In one move, one can take a $2 \times 2$ square and change the color of all its squares in such way that white squares become orange, orange ones become black and black ones become white. Find all $n$ for which, using a finite number of moves, we can make all the squares which were initially black white, and all squares which were initially white black.
Proposed by [i]Boris Stanković and Marko Dimitrić, Bosnia and Herzegovina[/i]
Given is an acute angled triangle $ABC$ with orthocenter $H$ and circumcircle $k$. Let $\omega$ be the circle with diameter $AH$ and $P$ be the point of intersection of $\omega$ and $k$ other than $A$. Assume that $BP$ and $CP$ intersect $\omega$ for the second time at points $Q$ and $R$, respectively. If $D$ is the foot of the altitude from $A$ to $BC$ and $S$ is the point of the intersection of $\omega$ and $QD$, prove that $HR = HS$.
Let $n > 3$ be a positive integer. Find all integers $k$ such that $1 \le k \le n$ and for
which the following property holds:
If $x_1, . . . , x_n$ are $n$ real numbers such that $x_i + x_{i + 1} + ... + x_{i + k - 1} = 0$ for all integers $i > 1$ (indexes are taken modulo $n$), then $x_1 = . . . = x_n = 0$.
Proposed by [i]Vincent Jugé and Théo Lenoir, France[/i]
In Mathcity, there are infinitely many buses and infinitely many stations. The stations are indexed by the powers of $2: 1, 2, 4, 8, 16, ...$ Each bus goes by finitely many stations, and the bus number is the sum of all the stations it goes by. For simplifications, the mayor of Mathcity wishes that the bus numbers form an arithmetic progression with common difference $r$ and whose first term is the favourite number of the mayor. For which positive integers $r$ is it always possible that, no matter the favourite number of the mayor, given any $m$ stations, there is a bus going by all of them?
Proposed by [i]Savinien Kreczman and Martin Rakovsky, France[/i]
Let $n \ge 2$ be an integer. Alex writes the numbers $1, 2, ..., n$ in some order on a circle such that any two neighbours are coprime. Then, for any two numbers that are not comprime, Alex draws a line segment between them. For each such segment $s$ we denote by $d_s$ the difference of the numbers written in its extremities and by $p_s$ the number of all other drawn segments which intersect $s$ in its interior.
Find the greatest $n$ for which Alex can write the numbers on the circle such that $p_s \le |d_s|$, for each drawn segment $s$.
Find all pairs $(a, p)$ of positive integers, where $p$ is a prime, such that for any pair of positive integers $m$ and $n$ the remainder obtained when $a^{2^n}$ is divided by $p^n$ is non-zero and equals the remainder obtained when $a^{2^m}$ is divided by $p^m$.
Can every positive rational number $q$ be written as
$$\frac{a^{2021} + b^{2023}}{c^{2022} + d^{2024}},$$
where $a, b, c, d$ are all positive integers?
[i]Proposed by Dominic Yeo, UK[/i]
Consider the sequence $a_1, a_2, a_3, ...$ defined by $a_1 = 9$ and
$a_{n + 1} = \frac{(n + 5)a_n + 22}{n + 3}$
for $n \ge 1$.
Find all natural numbers $n$ for which $a_n$ is a perfect square of an integer.
Let $K$ and $N > K$ be fixed positive integers. Let $n$ be a positive integer and let $a_1, a_2, ..., a_n$ be distinct integers. Suppose that whenever $m_1, m_2, ..., m_n$ are integers, not all equal to $0$, such that $\mid{m_i}\mid \le K$ for each $i$, then the sum
$$\sum_{i = 1}^{n} m_ia_i$$
is not divisible by $N$. What is the largest possible value of $n$?
[i]Proposed by Ilija Jovcevski, North Macedonia[/i]
Alice and Bob play a game together as a team on a $100 \times 100$ board with all unit squares initially white. Alice sets up the game by coloring exactly $k$ of the unit squares red at the beginning. After that, a legal move for Bob is to choose a row or column with at least $10$ red squares and color all of the remaining squares in it red. What is the
smallest $k$ such that Alice can set up a game in such a way that Bob can color the entire board red after finitely many moves?
Proposed by [i]Nikola Velov, Macedonia[/i]
Alice and Bob play a game together as a team on a $100 \times 100$ board with all unit squares initially white. Alice sets up the game by coloring exactly $k$ of the unit squares red at the beginning. After that, a legal move for Bob is to choose a row or column with at least $10$ red squares and color all of the remaining squares in it red. What is the
smallest $k$ such that Alice can set up a game in such a way that Bob can color the entire board red after finitely many moves?
Proposed by [i]Nikola Velov, Macedonia[/i]