Let $ b, m, n$ be positive integers such that $ b > 1$ and $ m \neq n.$ Prove that if $ b^m \minus{} 1$ and $ b^n \minus{} 1$ have the same prime divisors, then $ b \plus{} 1$ is a power of 2.

Reimu invented a new number base system that uses exactly five digits. The number $0$ in the decimal system is represented as $00000$, and whenever a number is incremented, Reimu finds the leftmost digit (of the five digits) that is equal to the ``units" (rightmost) digit, increments this digit, and sets all the digits to its right to 0. (For example, an analogous system that uses three digits would begin with $000$, $100$, $110$, $111$, $200$, $210$, $211$, $220$, $221$, $222$, $300$, $\ldots$.) Compute the decimal representation of the number that Reimu would write as $98765$. [i]Proposed by Yannick Yao[/i]

Let $a_0,a_1,\dots,a_{2024}$ be real numbers such that $\left|a_{i+1}-a_i\right| \le 1$ for $i=0,1,\dots,2023$. a) Find the minimum possible value of $$a_0a_1+a_1a_2+\dots+a_{2023}a_{2024}$$ b) Does there exist a real number $C$ such that $$a_0a_1-a_1a_2+a_2a_3-a_3a_4+\dots+a_{2022}a_{2023}-a_{2023}a_{2024} \ge C$$ for all real numbers $a_0,a_1,\dots,a_2024$ such that $\left|a_{i+1}-a_i\right| \le 1$ for $i=0,1,\dots,2023$.

Let $ ABCDEF$ be a convex hexagon with $ AB \equal{} BC \equal{} CD$ and $ DE \equal{} EF \equal{} FA$, such that $ \angle BCD \equal{} \angle EFA \equal{} \frac {\pi}{3}$. Suppose $ G$ and $ H$ are points in the interior of the hexagon such that $ \angle AGB \equal{} \angle DHE \equal{} \frac {2\pi}{3}$. Prove that $ AG \plus{} GB \plus{} GH \plus{} DH \plus{} HE \geq CF$.

Let $A_1$, $A_2$, $\cdots$, $A_m$ be $m$ subsets of a set of size $n$. Prove that $$ \sum_{i=1}^{m} \sum_{j=1}^{m}|A_i|\cdot |A_i \cap A_j|\geq \frac{1}{mn}\left(\sum_{i=1}^{m}|A_i|\right)^3.$$

Given a polynomial of degree $2$, $p(x) = ax^2 +bx+c$ define the function $$S(p) = (a -b)^2 + (b - c)^2 + (c - a)^2.$$ Determine the real number$ r$such that, for any polynomial $p(x)$ of degree $2$ with real roots, holds $S(p) \ge ra^2$

A pyramid has a base which is an equilateral triangle with side length $300$ centimeters. The vertex of the pyramid is $100$ centimeters above the center of the triangular base. A mouse starts at a corner of the base of the pyramid and walks up the edge of the pyramid toward the vertex at the top. When the mouse has walked a distance of $134$ centimeters, how many centimeters above the base of the pyramid is the mouse?

Let $ABC$ be a given triangle and $\ell$ be a line that meets the lines $BC, CA$ and $AB$ in $A_1,B_1$ and $C_1$ respectively. Let $A'$ be the midpoint, of the segment connecting the projections of $A_1$ onto the lines $AB$ and $AC$. Construct, analogously the points $B'$ and $C'$. (a) Show that the points $A', B'$ and $C'$ are collinear on some line $\ell'$. (b) Show that if $\ell$ contains the circumcenter of the triangle $ABC$, then $\ell' $ contains the center of it's Euler circle.

Prove that for each natural number $d$, There is a monic and unique polynomial of degree $d$ like $P$ such that $P(1)$≠$0$ and for each sequence like $a_{1}$,$a_{2}$, $...$ of real numbers that the recurrence relation below is true for them, there is a natural number $k$ such that $0=a_{k}=a_{k+1}= ...$ : $P(n)a_{1} + P(n-1)a_{2} + ... + P(1)a_{n}=0$ $n>1$

[b]a)[/b] Find the number of infinite sequences of integers $ \left( a_n \right)_{n\ge 1} $ that have the property that $ a_na_{n+2}a_{n+3}=-1, $ for any natural number $ n. $ [b]b)[/b] Prove that there is no infinite sequence of integers $ \left( b_n \right)_{n\ge 1} $ that have the property that $ b_nb_{n+2}b_{n+3}=2005, $ for any natural number $ n. $

Suppose $ a$ and $ b$ are real numbers such that the roots of the cubic equation $ ax^3\minus{}x^2\plus{}bx\minus{}1$ are positive real numbers. Prove that: \[ (i)\ 0<3ab\le 1\text{ and }(i)\ b\ge \sqrt{3} \] [19 points out of 100 for the 6 problems]

Let $n\geqslant 2$ be a positive integer. Paul has a $1\times n^2$ rectangular strip consisting of $n^2$ unit squares, where the $i^{\text{th}}$ square is labelled with $i$ for all $1\leqslant i\leqslant n^2$. He wishes to cut the strip into several pieces, where each piece consists of a number of consecutive unit squares, and then [i]translate[/i] (without rotating or flipping) the pieces to obtain an $n\times n$ square satisfying the following property: if the unit square in the $i^{\text{th}}$ row and $j^{\text{th}}$ column is labelled with $a_{ij}$, then $a_{ij}-(i+j-1)$ is divisible by $n$. Determine the smallest number of pieces Paul needs to make in order to accomplish this.

Let $ n$ be an integer greater than $ 3$, and let $ a_1, a_2, \cdots, a_n$ be non-negative real numbers with $ a_1 \plus{} a_2 \plus{} \cdots \plus{} a_n \equal{} 2$. Determine the minimum value of \[ \frac{a_1}{a_2^2 \plus{} 1}\plus{} \frac{a_2}{a^2_3 \plus{} 1}\plus{} \cdots \plus{} \frac{a_n}{a^2_1 \plus{} 1}.\]

Leonard wrote three 3-digit numbers on the board whose sum is $1000$. All of the nine digits are different. Determine which digit does not appear on the board. [i]Proposed by Giorgi Arabidze, Georgia[/i]

The quadratic expression $ax^2+bx+c$ is the $4$-th power (of an integer) for any integer $x$. Prove that $a = b = 0$.

For a set \(S\) of positive integers and a positive integer \(n\), consider the game of [i]\((n,S)\)-nim[/i], which is as follows. A pile starts with \(n\) watermelons. Two players, Deric and Erek, alternate turns eating watermelons from the pile, with Deric going first. On any turn, the number of watermelons eaten must be an element of \(S\). The last player to move wins. Let \(f(S)\) denote the set of positive integers \(n\) for which Deric has a winning strategy in \((n,S)\)-nim. Let \(T\) be a set of positive integers. Must the sequence \[T, \; f(T), \; f(f(T)), \;\ldots\] be eventually constant? [i]Proposed by Brandon Wang and Edward Wan[/i]

For all real numbers $a,b,c>0$ such that $abc=1$, prove that $\frac{a}{1+b^3}+\frac{b}{1+c^3}+\frac{c}{1+a^3}\geq \frac{3}{2}$.

For which values of $n$ is it possible to construct an $n$ by $n$ by $n$ cube with $n^3$ unit cubes, each of which is black or white, such that each cube shares a common face with exactly three cubes of the opposite colour? (S Tokarev)

The tangent to the circle circumscribed to the triangle $ABC$, taken through the vertex $A$, intersects the line $BC$ at the point $P$, and the tangents to the same circle, taken through $B$ and $C$, intersect the lines $AC$ and $AB$, respectively at the points $Q$ and $R$. Prove that the points $P, Q$ ¸ and $R$ are collinear.

$ABC$ is acute-angled triangle. $AA_1,BB_1,CC_1$ are altitudes. $X,Y$ - midpoints of $AC_1,A_1C$. $XY=BB_1$. Prove that one side of $ABC$ in $\sqrt{2}$ greater than other side.

The point $M$ inside a convex quadrilateral $ABCD$ is equidistant from the lines $AB$ and $CD$ and is equidistant from the lines $BC$ and $AD$. The area of $ABCD$ occurred to be equal to $MA\cdot MC +MB \cdot MD$. Prove that the quadrilateral $ABCD$ is a) tangential (circumscribed), b) cyclic (inscribed). (Nairi Sedrakyan)

Find all polynomials $P\in \mathbb C[X]$ such that \[P(X^{2})=P(X)^{2}+2P(X)\]

[u]Round 5 [/u] [b]p13.[/b] Suppose $\vartriangle ABC$ is an isosceles triangle with $\overline{AB} = \overline{BC}$, and $X$ is a point in the interior of $\vartriangle ABC$. If $m \angle ABC = 94^o$, $m\angle ABX = 17^o$, and $m\angle BAX = 13^o$, then what is $m\angle BXC$ (in degrees)? [b]p14.[/b] Find the remainder when $\sum^{2019}_{n=1} 1 + 2n + 4n^2 + 8n^3$ is divided by $2019$. [b]p15.[/b] How many ways can you assign the integers $1$ through $10$ to the variables $a, b, c, d, e, f, g, h, i$, and $j$ in some order such that $a < b < c < d < e, f < g < h < i$, $a < g, b < h, c < i$, $f < b, g < c$, and $h < d$? [u]Round 6 [/u] [b]p16.[/b] Call an integer $n$ equi-powerful if $n$ and $n^2$ leave the same remainder when divided by 1320. How many integers between $1$ and $1320$ (inclusive) are equi-powerful? [b]p17.[/b] There exists a unique positive integer $j \le 10$ and unique positive integers $n_j$ , $n_{j+1}$, $...$, $n_{10}$ such that $$j \le n_j < n_{j+1} < ... < n_{10}$$ and $${n_{10} \choose 10}+ {n_9 \choose 9}+ ... + {n_j \choose j}= 2019.$$ Find $n_j + n_{j+1} + ... + n_{10}$. [b]p18.[/b] If $n$ is a randomly chosen integer between $1$ and $390$ (inclusive), what is the probability that $26n$ has more positive factors than $6n$? [u]Round 7[/u] [b]p19.[/b] Suppose $S$ is an $n$-element subset of $\{1, 2, 3, ..., 2019\}$. What is the largest possible value of $n$ such that for every $2 \le k \le n$, $k$ divides exactly $n - 1$ of the elements of $S$? [b]p20.[/b] For each positive integer $n$, let $f(n)$ be the fewest number of terms needed to write $n$ as a sum of factorials. For example, $f(28) = 3$ because $4! + 2! + 2! = 28$ and 28 cannot be written as the sum of fewer than $3$ factorials. Evaluate $f(1) + f(2) + ... + f(720)$. [b]p21.[/b] Evaluate $\sum_{n=1}^{\infty}\frac{\phi (n)}{101^n-1}$ , where $\phi (n)$ is the number of positive integers less than or equal to n that are relatively prime to $n$. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c4h2788993p24519281]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A two-player game is played on a chessboard with $ m$ columns and $ n$ rows. Each player has only one piece. At the beginning of the game, the piece of the first player is on the upper left corner, and the piece of the second player is on the lower right corner. If two squares have a common edge, we call them adjacent squares. The player having the turn moves his piece to one of the adjacent squares. The player wins if the opponent's piece is on that square, or if he manages to move his piece to the opponent's initial row. If the first move is made by the first player, for which of the below pairs of $ \left(m,n\right)$ there is a strategy that guarantees the second player win. $\textbf{(A)}\ (1998, 1997) \qquad\textbf{(B)}\ (1998, 1998) \qquad\textbf{(C)}\ (997, 1998) \qquad\textbf{(D)}\ (998, 1998) \qquad\textbf{(E)}\ \text{None }$

Do positive reals $a, b, c, x$ such that $a^2+ b^2 = c^2$ and $(a + x)^2+ (b +x)^2 = (c + x)^2$ exist?