Let $f,g$ be polynomials with complex coefficients such that $\gcd(\deg f,\deg g)=1$. Suppose that there exist polynomials $P(x,y)$ and $Q(x,y)$ with complex coefficients such that $f(x)+g(y)=P(x,y)Q(x,y)$. Show that one of $P$ and $Q$ must be constant. [i]Victor Wang.[/i]

Suppose that $|ax^2+bx+c| \geq |x^2-1|$ for all real numbers x. Prove that $|b^2-4ac|\geq 4$.

How many integers $n$ are there subject to the constraint that $1 \leq n \leq 2020$ and $n^n$ is a perfect square?

Three palaces, each rotating on a duck leg, make a full round in $30$, $50$, and $70$ days, respectively. Today, at noon, all three palaces face northwards. In how many days will they all face southwards?

Let $a$,$b$,$c$ be the roots of the equation $x^{3} - 2018x +2018 = 0$. Let $q$ be the smallest positive integer for which there exists an integer $p, \, 0 < p \leq q$, such that $$\frac {a^{p+q} + b^{p+q} + c^{p+q}} {p+q} = \left(\frac {a^{p} + b^{p} + c^{p}} {p}\right)\left(\frac {a^{q} + b^{q} + c^{q}} {q}\right).$$ Find $p^{2} + q^{2}$.

If $a$, $b$, $c$ are rational, show that \[ \frac{1}{(b-c)^2}+\frac{1}{(c-a)^2}+\frac{1}{(a-b)^2} \] is the square of a rational.

Let the real numbers $a,b,c,d$ satisfy the relations $a+b+c+d=6$ and $a^2+b^2+c^2+d^2=12.$ Prove that \[36 \leq 4 \left(a^3+b^3+c^3+d^3\right) - \left(a^4+b^4+c^4+d^4 \right) \leq 48.\] [i]Proposed by Nazar Serdyuk, Ukraine[/i]

Pit and Bill play the following game. First Pit writes down a number $a$, then Bill writes a number $b$, then Pit writes a number $c$. Can Pit always play so that the three equations $$x^3+ax^2+bx+c, x^3+bx^2+cx+a, x^3+cx^2+ax+b$$ have (a) a common real root; (b) a common negative root?

Does there exist a sequence of positive real numbers $\{a_i\}_{i=1}^{\infty}$ satisfying: \[ \sum_{i=1}^{n} a_i \geq n^2 \quad \text{and} \quad \sum_{i=1}^{n} a_i^2 \leq n^3 + 2025n \] for all positive integers $n$.

Solve in the set of real numbers the fractional part inequality $ \{ x \}\le\{ nx \} , $ where $ n $ is a fixed natural number.

Find the largest possible integer $k$, such that the following statement is true: Let $2009$ arbitrary non-degenerated triangles be given. In every triangle the three sides are coloured, such that one is blue, one is red and one is white. Now, for every colour separately, let us sort the lengths of the sides. We obtain \[ \left. \begin{array}{rcl} & b_1 \leq b_2\leq\ldots\leq b_{2009} & \textrm{the lengths of the blue sides }\\ & r_1 \leq r_2\leq\ldots\leq r_{2009} & \textrm{the lengths of the red sides }\\ \textrm{and } & w_1 \leq w_2\leq\ldots\leq w_{2009} & \textrm{the lengths of the white sides }\\ \end{array}\right.\] Then there exist $k$ indices $j$ such that we can form a non-degenerated triangle with side lengths $b_j$, $r_j$, $w_j$. [i]Proposed by Michal Rolinek, Czech Republic[/i]

Determine all triples $(a,b,c)$ of real numbers with \[a+\frac{4}{b}=b+\frac{4}{c}=c+\frac{4}{a}.\]

(10.4) A set of numbers $a_0, a_1,..., a_n$ satisfies the conditions: $a_0 = 0$, $0 \le a_{k+1}- a_k \le 1$ for $k = 0, 1, .. , n -1$. Prove the inequality $$\sum_{k=1}^n a^3_k \le \left(\sum_{k=1}^n a_k \right)^2$$ (11.3) A set of numbers $a_0, a_1,..., a_n$ satisfies the conditions: $a_0 = 0$, $a_{k+1} \ge a_k + 1$ for $k = 0, 1, .. , n -1$. Prove the inequality $$\sum_{k=1}^n a^3_k \ge \left(\sum_{k=1}^n a_k \right)^2$$

[b]7.1[/b] A rectangle that is not a square is inscribed in a square. Prove that its semi-perimeter is equal to the diagonal of the square. [b]7.2[/b] Find five numbers whose pairwise sums are 0, 2, 4,5, 7, 9, 10, 12, 14, 17. [b]7.3 [/b] In a $1000$-digit number, all but one digit is a five. Prove that this number is not a perfect square. [b]7.4 / 6.5[/b] Several teams took part in the volleyball tournament. Team A is considered stronger than team B if either A beat B or there is a team C such that A beat C, and C beat B. Prove that if team T is the winner of the tournament, then it is the strongest the rest of the teams. [b]7.5[/b] In a pentagon $ABCDE$, $K$ is the midpoint of $AB$, $L$ is the midpoint of $BC$, $M$ is the midpoint of $CD$, $N$ is the midpoint of $DE$, $P$ is the midpoint of $KM$, $Q$ is the midpoint of $LN$. Prove that the segment $ PQ$ is parallel to side $AE$ and is equal to its quarter. [img]https://cdn.artofproblemsolving.com/attachments/2/5/be8e9b0692d98115dbad04f960e8a856dc593f.png[/img] [b]7.6 / 8.4[/b] Several circles are arbitrarily placed in a circle of radius $3$, the sum of their radii is $25$. Prove that there is a straight line that intersects at least $9$ of these circles. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988084_1968_leningrad_math_olympiad]here[/url].

In each of (a) to (d) you have to find a strictly increasing surjective function from A to B or prove that there doesn't exist any. (a) $A=\{x|x\in \mathbb{Q},x\leq \sqrt{2}\}$ and $B=\{x|x\in \mathbb{Q},x\leq \sqrt{3}\}$ (b) $A=\mathbb{Q}$ and $B=\mathbb{Q}\cup \{\pi \} $ In (c) and (d) we say $(x,y)>(z,t)$ where $x,y,z,t \in \mathbb{R}$ , whenever $x>z$ or $x=z$ and $y>t$. (c) $A=\mathbb{R}$ and $B=\mathbb{R}^2$ (d) $X=\{2^{-x}| x\in \mathbb{N}\}$ , then $A=X \times (X\cup \{0\})$ and $B=(X \cup \{ 0 \}) \times X$ (e) If $A,B \subset \mathbb{R}$ , such that there exists a surjective non-decreasing function from $A$ to $B$ and a surjective non-decreasing function from $B$ to $A$ , does there exist a surjective strictly increasing function from $B$ to $A$? Time allowed for this problem was 2 hours.

We examine the following two sequences: The Fibonacci sequence: $F_{0}= 0, F_{1}= 1, F_{n}= F_{n-1}+F_{n-2 }$ for $n \geq 2$; The Lucas sequence: $L_{0}= 2, L_{1}= 1, L_{n}= L_{n-1}+L_{n-2}$ for $n \geq 2$. It is known that for all $n \geq 0$ \[F_{n}=\frac{\alpha^{n}-\beta^{n}}{\sqrt{5}},L_{n}=\alpha^{n}+\beta^{n},\] where $\alpha=\frac{1+\sqrt{5}}{2},\beta=\frac{1-\sqrt{5}}{2}$. These formulae can be used without proof. Prove that \[\sum_{k=1}^{n}[\alpha^{k}F_{k}+\frac{1}{2}]=F_{2n+1}\; \forall n>1.\]

Let $f(x) = \frac{1}{1-\frac{3x}{16}}$. Consider the sequence $\{ 0, f(0), f(f(0)), f^3(0), \dots \}$ Find the smallest $L$ such that $f^n(0) \leq L$ for all $n$. If the sequence is unbounded, write none as your answer.

Let $m,n\ge 1$ and $a_1 < a_2 < \ldots < a_n$ be integers. Prove that there exists a subset $T$ of $\mathbb{N}$ such that \[|T| \leq 1+ \frac{a_n-a_1}{2n+1}\] and for every $i \in \{1,2,\ldots , m\}$, there exists $t \in T$ and $s \in [-n,n]$, such that $a_i=t+s$.

Cookie Monster says a positive integer $n$ is $crunchy$ if there exist $2n$ real numbers $x_1,x_2,\ldots,x_{2n}$, not all equal, such that the sum of any $n$ of the $x_i$'s is equal to the product of the other $n$ of the $x_i$'s. Help Cookie Monster determine all crunchy integers. [i]Yannick Yao[/i]

Prove that for any positive reals $ a,b,c,d $ with $ a+b+c+d = 4 $, we have $$ \sum\limits_{cyc}{\frac{3a^3}{a^2+ab+b^2}}+\sum\limits_{cyc}{\frac{2ab}{a+b}} \ge 8 $$

Let $P(x)$, $Q(x)$ be nonconstant polynomials with real number coefficients. Prove that if \[\lfloor P(y) \rfloor = \lfloor Q(y) \rfloor\] for all real numbers $y$, then $P(x) = Q(x)$ for all real numbers $x$.

Consider a paper punch that can be centered at any point of the plane and that, when operated, removes from the plane precisely those points whose distance from the center is irrational. How many punches are needed to remove every point?

[b]p1.[/b] Eric is playing Brawl Stars. If he starts playing at $11:10$ AM, and plays for $2$ hours total, then how many minutes past noon does he stop playing? [b]p2.[/b] James is making a mosaic. He takes an equilateral triangle and connects the midpoints of its sides. He then takes the center triangle formed by the midsegments and connects the midpoints of its sides. In total, how many equilateral triangles are in James’ mosaic? [b]p3.[/b] What is the greatest amount of intersections that $3$ circles and $3$ lines can have, given that they all lie on the same plane? [b]p4.[/b] In the faraway land of Arkesia, there are two types of currencies: Silvers and Gold. Each Silver is worth $7$ dollars while each Gold is worth $17$ dollars. In Daniel’s wallet, the total dollar value of the Silvers is $1$ more than that of the Golds. What is the smallest total dollar value of all of the Silvers and Golds in his wallet? [b]p5.[/b] A bishop is placed on a random square of a $8$-by-$8$ chessboard. On average, the bishop is able to move to $s$ other squares on the chessboard. Find $4s$. Note: A bishop is a chess piece that can move diagonally in any direction, as far as it wants. [b]p6.[/b] Andrew has a certain amount of coins. If he distributes them equally across his $9$ friends, he will have $7$ coins left. If he apportions his coins for each of his $15$ classmates, he will have $13$ coins to spare. If he splits the coins into $4$ boxes for safekeeping, he will have $2$ coins left over. What is the minimum number of coins Andrew could have? [b]p7.[/b] A regular polygon $P$ has three times as many sides as another regular polygon $Q$. The interior angle of $P$ is $16^o$ greater than the interior angle of $Q$. Compute how many more diagonals $P$ has compared to $Q$. [b]p8.[/b] In an certain airport, there are three ways to switch between the ground floor and second floor that are 30 meters apart: either stand on an escalator, run on an escalator, or climb the stairs. A family on vacation takes 65 seconds to climb up the stairs. A solo traveller late for their flight takes $25$ seconds to run upwards on the escalator. The amount of time (in seconds) it takes for someone to switch floors by standing on the escalator can be expressed as $\frac{u}{v}$ , where $u$ and $v$ are relatively prime. Find $u + v$. (Assume everyone has the same running speed, and the speed of running on an escalator is the sum of the speeds of riding the escalator and running on the stairs.) [b]p9.[/b] Avanish, being the studious child he is, is taking practice tests to improve his score. Avanish has a $60\%$ chance of passing a practice test. However, whenever Avanish passes a test, he becomes more confident and instead has a $70\%$ chance of passing his next immediate test. If Avanish takes $3$ practice tests in a row, the expected number of practice tests Avanish will pass can be expressed as $\frac{a}{b}$ , where $a$ and $b$ are relatively prime. Find $a + b$. [b]p10.[/b] Triangle $\vartriangle ABC$ has sides $AB = 51$, $BC = 119$, and $AC = 136$. Point $C$ is reflected over line $\overline{AB}$ to create point $C'$. Next, point $B$ is reflected over line $\overline{AC'}$ to create point $B'$. If $[B'C'C]$ can be expressed in the form of $a\sqrt{b}$, where $b$ is not divisible by any perfect square besides $1$, find $a + b$. [b]p11[/b]. Define the following infinite sequence $s$: $$s = \left\{\frac{1}{1},\frac{1}{1 + 3},\frac{1}{1 + 3 + 6}, ... ,\frac{1}{1 + 3 + 6 + ...+ t_k},...\right\},$$ where $t_k$ denotes the $k$th triangular number. The sum of the first $2024$ terms of $s$, denoted $S$, can be expressed as $$S = 3 \left(\frac{1}{2}+\frac{1}{a}-\frac{1}{b}\right),$$ where $a$ and $b$ are positive integers. Find the minimal possible value of $a + b$. [b]p12.[/b] Omar writes the numbers from $1$ to $1296$ on a whiteboard and then converts each of them into base $6$. Find the sum of all of the digits written on the whiteboard (in base $10$), including both the base $10$ and base $6$ numbers. [b]p13.[/b] A mountain number is a number in a list that is greater than the number to its left and right. Let $N$ be the amount of lists created from the integers $1$ - $100$ such that each list only has one mountain number. $N$ can be expressed as $$N = 2^a(2^b - c^2),$$ where $a$, $b$ and $c$ are positive integers and $c$ is not divisible by $2$. Find $a + b+c$. (The numbers at the beginning or end of a list are not considered mountain numbers.)[hide]Original problem was voided because the original format of the answer didn't match the result's format. So I changed it in the wording, in order the problem to be correct[/hide] [b]p14.[/b] A circle $\omega$ with center $O$ has a radius of $25$. Chords $\overline{AB}$ and $\overline{CD}$ are drawn in $\omega$ , intersecting at $X$ such that $\angle BXC = 60^o$ and $AX > BX$. Given that the shortest distance of $O$ with $\overline{AB}$ and $\overline{CD}$ is $7$ and $15$ respectively, the length of $BX$ can be expressed as $x - \frac{y}{\sqrt{z}}$ , where $x$, $y$, and $z$ are positive integers such that $z$ is not divisible by any perfect square. Find $x + y + z.$ [hide]two answers were considered correct according to configuration[/hide] [b]p15.[/b] How many ways are there to split the first $10$ natural numbers into $n$ sets (with $n \ge 1$) such that all the numbers are used and each set has the same average? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

How many digits has the number $2^{100}$?

Find all functions $ f: \mathbb{Z} \to \mathbb{Z} $ such that $$ f\left(x+f\left(y\right)\right)f\left(y+f\left(x\right)\right)=\left(2x+f\left(y-x\right)\right)\left(2y+f\left(x-y\right)\right) $$ holds for all integers $ x,y $