Prove that the following equation has no solution in integer numbers: \[ x^2 + 4 = y^5. \] [i]Bulgaria[/i]

Consider two positive integers $a$ and $b$ such that $a^{n+1} + b^{n+1}$ is divisible by $a^n + b^n$ for infinitely many positive integers $n$. Is it necessarily true that $a = b$? (Boris Frenkin)

Let $I$ be the incenter of a non-isosceles triangle $ABC$. The line $AI$ intersects the circumcircle of the triangle $ABC$ at $A$ and $D$. Let $M$ be the middle point of the arc $BAC$. The line through the point $I$ perpendicular to $AD$ intersects $BC$ at $F$. The line $MI$ intersects the circle $BIC$ at $N$. Prove that the line $FN$ is tangent to the circle $BIC$.

Let $ABC$ be an acute-angled triangle with height intersection $H$. Let $G$ be the intersection of parallel of $AB$ through $H$ with the parallel of $AH$ through $B$. Let $I$ be the point on the line $GH$, so that $AC$ bisects segment $HI$. Let $J$ be the second intersection of $AC$ and the circumcircle of the triangle $CGI$. Show that $IJ = AH$

On an infinite square grid, Gru and his $2022$ minions play a game, making moves in a cyclic order with Gru first. On any move, the current player selects $2$ adjacent cells of their choice, and paints their shared border. A border cannot be painted over more than once. Gru wins if after any move there is a $2 \times 1$ or $1 \times 2$ subgrid with its border (comprising of $6$ segments) completely colored, but the $1$ segment inside it uncolored. Can he guarantee a win? [i]Evan Chang[/i] [size=50](oops)[/size]

In the triangle $ABC$, $AD$ is altitude, $M$ is the midpoint of $BC$. It is known that $\angle BAD = \angle DAM = \angle MAC$. Find the values of the angles of the triangle $ABC$

There are $100$ different real numbers. Prove, that we can put it in $10 \times 10$ table, such that difference between two numbers in cells with common side are not equals $1$ [i]A. Golovanov[/i]

Two distinct positive even integers sum to $8.$ Determine the larger of the $2$ integers.

Let $a_{1}$, $a_{2}$, …, $a_{6}$; $b_{1}$, $b_{2}$, …, $b_{6}$ and $c_{1}$, $c_{2}$, …, $c_{6}$ are all permutations of $1$, $2$, …, $6$, respectively. Find the minimum value of $\sum_{i=1}^{6}a_{i}b_{i}c_{i}$.

Alex has an $20 \times 16$ grid of lightbulbs, initially all off. He has $36$ switches, one for each row and column. Flipping the switch for the $i$th row will toggle the state of each lightbulb in the $i$th row (so that if it were on before, it would be off, and vice versa). Similarly, the switch for the $j$th column will toggle the state of each bulb in the $j$th column. Alex makes some (possibly empty) sequence of switch flips, resulting in some configuration of the lightbulbs and their states. How many distinct possible configurations of lightbulbs can Alex achieve with such a sequence? Two configurations are distinct if there exists a lightbulb that is on in one configuration and off in another.

If $x,y,z$ are real numbers satisfying relations \[x+y+z = 1 \quad \textrm{and} \quad \arctan x + \arctan y + \arctan z = \frac{\pi}{4},\] prove that $x^{2n+1} + y^{2n+1} + z^{2n+1} = 1$ holds for all positive integers $n$.

Let $f: N \to N$ be a function satisfying (a) $1\le f(x)-x \le 2019$ $\forall x \in N$ (b) $f(f(x))\equiv x$ (mod $2019$) $\forall x \in N$ Show that $\exists x \in N$ such that $f^k(x)=x+2019 k, \forall k \in N$

Let $ X_1,X_2,\ldots, X_n$ be independent, identically distributed, nonnegative random variables with a common continuous distribution function $ F$. Suppose in addition that the inverse of $ F$, the quantile function $ Q$, is also continuous and $ Q(0)=0$. Let $ 0=X_{0: n} \leq X_{1: n} \leq \ldots \leq X_{n: n}$ be the ordered sample from the above random variables. Prove that if $ EX_1$ is finite, then the random variable \[ \Delta = \sup_{0\leq y \leq 1} \left| \frac 1n \sum_{i=1}^{\lfloor ny \rfloor +1} (n+1-i)(X_{i: n}-X_{i-1: n})- \int_0^y (1-u)dQ(u) \right|\] tends to zero with probability one as $ n \rightarrow \infty$. [i]S. Csorgp, L. Horvath[/i]

[i]20 problems for 20 minutes.[/i] [b]p1.[/b] Determine how many digits the number $10^{10}$ has. [b]p2.[/b] Let $ABC$ be a triangle with $\angle ABC = 60^o$ and $\angle BCA = 70^o$. Compute $\angle CAB$ in degrees. [b]p3.[/b] Given that $x : y = 2012 : 2$ and $y : z = 1 : 2013$, compute $x : z$. Express your answer as a common fraction. [b]p4.[/b] Determine the smallest perfect square greater than $2400$. [b]p5.[/b] At $12:34$ and $12:43$, the time contains four consecutive digits. Find the next time after 12:43 that the time contains four consecutive digits on a 24-hour digital clock. [b]p6.[/b] Given that $ \sqrt{3^a \cdot 9^a \cdot 3^a} = 81^2$, compute $a$. [b]p7.[/b] Find the number of positive integers less than $8888$ that have a tens digit of $4$ and a units digit of $2$. [b]p8.[/b] Find the sum of the distinct prime divisors of $1 + 2012 + 2013 + 2011 \cdot 2013$. [b]p9.[/b] Albert wants to make $2\times 3$ wallet sized prints for his grandmother. Find the maximum possible number of prints Albert can make using one $4 \times 7$ sheet of paper. [b]p10.[/b] Let $ABC$ be an equilateral triangle, and let $D$ be a point inside $ABC$. Let $E$ be a point such that $ADE$ is an equilateral triangle and suppose that segments $DE$ and $AB$ intersect at point $F$. Given that $\angle CAD = 15^o$, compute $\angle DFB$ in degrees. [b]p11.[/b] A palindrome is a number that reads the same forwards and backwards; for example, $1221$ is a palindrome. An almost-palindrome is a number that is not a palindrome but whose first and last digits are equal; for example, $1231$ and $1311$ are an almost-palindromes, but $1221$ is not. Compute the number of $4$-digit almost-palindromes. [b]p12.[/b] Determine the smallest positive integer $n$ such that the sum of the digits of $11^n$ is not $2^n$. [b]p13.[/b] Determine the minimum number of breaks needed to divide an $8\times 4$ bar of chocolate into $1\times 1 $pieces. (When a bar is broken into pieces, it is permitted to rotate some of the pieces, stack some of the pieces, and break any set of pieces along a vertical plane simultaneously.) [b]p14.[/b] A particle starts moving on the number line at a time $t = 0$. Its position on the number line, as a function of time, is $$x = (t-2012)^2 -2012(t-2012)-2013.$$ Find the number of positive integer values of $t$ at which time the particle lies in the negative half of the number line (strictly to the left of $0$). [b]p15.[/b] Let $A$ be a vertex of a unit cube and let $B$,$C$, and $D$ be the vertices adjacent to A. The tetrahedron $ABCD$ is cut off the cube. Determine the surface area of the remaining solid. [b]p16.[/b] In equilateral triangle $ABC$, points $P$ and $R$ lie on segment $AB$, points $I$ and $M$ lie on segment $BC$, and points $E$ and $S$ lie on segment $CA$ such that $PRIMES$ is a equiangular hexagon. Given that $AB = 11$, $PS = 2$, $RI = 3$, and $ME = 5$, compute the area of hexagon $PRIMES$. [b]p17.[/b] Find the smallest odd positive integer with an odd number of positive integer factors, an odd number of distinct prime factors, and an odd number of perfect square factors. [b]p18.[/b] Fresh Mann thinks that the expressions $2\sqrt{x^2 -4} $and $2(\sqrt{x^2} -\sqrt4)$ are equivalent to each other, but the two expressions are not equal to each other for most real numbers $x$. Find all real numbers $x$ such that $2\sqrt{x^2 -4} = 2(\sqrt{x^2} -\sqrt4)$. [b]p19.[/b] Let $m$ be the positive integer such that a $3 \times 3$ chessboard can be tiled by at most $m$ pairwise incongruent rectangles with integer side lengths. If rotations and reflections of tilings are considered distinct, suppose that there are $n$ ways to tile the chessboard with $m$ pairwise incongruent rectangles with integer side lengths. Find the product $mn$. [b]p20.[/b] Let $ABC$ be a triangle with $AB = 4$, $BC = 5$, and $CA = 6$. A triangle $XY Z$ is said to be friendly if it intersects triangle $ABC$ and it is a translation of triangle $ABC$. Let $S$ be the set of points in the plane that are inside some friendly triangle. Compute the ratio of the area of $S$ to the area of triangle $ABC$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Chords $AB$ and $CD$ of a circle intersect inside the circle at $P$ such that $AP = 8, P B = 6, P D = 3$ and $\angle AP C = 60^{\circ}$. Find the area of $\bigtriangleup AP C$.

Javiera and Claudio play on a board consisting of a row with $2019$ cells. Claudio starts by placing a token anywhere on the board. Next Javiera says a natural number $k$, $1 \le k \le n$ and Claudio must move the token to the right or to the left at your choice $k$ squares and so on. Javiera wins if she manages to remove the piece that Claudio moves from the board. Determine the smallest $n$ such that Javiera always wins after a finite number of moves.

Let the $f:\mathbb{N}\rightarrow\mathbb{N}$ be the function such that (i) For all positive integers $n,$ $f(n+f(n))=f(n)$ (ii) $f(n_o)=1$ for some $n_0$ Prove that $f(n)\equiv 1.$

Compute the number of positive integers $n\le1000$ such that $\text{lcm}(n,9)$ is a perfect square. (Recall that $\text{lcm}$ denotes the least common multiple.)

Let $f(x)$ and $g(x)$ be degree $n$ polynomials, and $x_0,x_1,\ldots,x_n$ be real numbers such that $$f(x_0)=g(x_0),f'(x_1)=g'(x_1),f''(x_2)=g''(x_2),\ldots,f^{(n)}(x_n)=g^{(n)}(x_n).$$Prove that $f(x)=g(x)$ for all $x$.

Let $n$ be a positive integer greater than $1$. Evaluate the following summation: \[ \sum_{k=0}^{n-1} \frac{1}{1 + 8 \sin^2 \left( \frac{k \pi}{n} \right)}. \]

A $3$ by $3$ determinant has three entries equal to $2$, three entries equal to $5$, and three entries equal to $8$. Find the maximum possible value of the determinant.

Let $m, n$ be positive integers. Let $S(n,m)$ be the number of sequences of length $n$ and consisting of $0$ and $1$ in which there exists a $0$ in any consecutive $m$ digits. Prove that \[S(2015n,n).S(2015m,m)\ge S(2015n,m).S(2015m,n)\]

In a sports tournament involving $N$ teams, each team plays every other team exactly one. At the end of every match, the winning team gets $1$ point and losing team gets $0$ points. At the end of the tournament, the total points received by the individual teams are arranged in decreasing order as follows: \[x_1 \ge x_2 \ge \cdots \ge x_N . \] Prove that for any $1\le k \le N$, \[\frac{N - k}{2} \le x_k \le N - \frac{k+1}{2}\]

The cricles $\Gamma_1$ and $\Gamma_2$ intersect in $ M $ and $N.$ A line that goes through $ M $ intersects the cricles $\Gamma_1$ and $\Gamma_2$ in $ A$ and $B$, such that $M\in(AB)$. The bisector of angle $ AMN $ intersects the circle $\Gamma_1$ in $D,$ and the bisector of angle $BMN$ intersects the circle $\Gamma_2$ in $C.$ Prove that the circle with diameter $CD$ splits the segment $AB$ in half.

Let \(m\) be a positive integer. Find, in terms of \(m\), all polynomials \(P(x)\) with integer coefficients such that for every integer \(n\), there exists an integer \(k\) such that \(P(k)=n^m\). [i]Proposed by Raymond Feng[/i]