Given is a positive integer $n \geq 2$. Determine the maximum value of the sum of natural numbers $k_1,k_2,...,k_n$ satisfying the condition: $k_1^3+k_2^3+ \dots +k_n^3 \leq 7n$.

Given a positive integrer number $n$ ($n\ne 0$), let $f(n)$ be the average of all the positive divisors of $n$. For example, $f(3)=\frac{1+3}{2}=2$, and $f(12)=\frac{1+2+3+4+6+12}{6}=\frac{14}{3}$. [b]a[/b] Prove that $\frac{n+1}{2} \ge f(n)\ge \sqrt{n}$. [b]b[/b] Find all $n$ such that $f(n)=\frac{91}{9}$.

Prove that for each natural number $m$, there is a natural number $N$ such that for each $b$ that $2\leq b\leq1389$ sum of digits of $N$ in base $b$ is larger than $m$.

[u]Round 5[/u] [b]p13.[/b] Vincent the Bug is at the vertex $A$ of square $ABCD$. Each second, he moves to an adjacent vertex with equal probability. The probability that Vincent is again on vertex $A$ after $4$ seconds is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Compute $p + q$. [b]p14.[/b] Let $ABC$ be a triangle with $AB = 2$, $AC = 3$, and $\angle BAC = 60^o$. Let $P$ be a point inside the triangle such that $BP = 1$ and $CP =\sqrt3$, let $x$ equal the area of $APC$. Compute $16x^2$. [b]p15.[/b] Let $n$ be the number of multiples of$ 3$ between $2^{2020}$ and $2^{2021}$. When $n$ is written in base two, how many digits in this representation are $1$? [u]Round 6[/u] [b]p16.[/b] Let $f(n)$ be the least positive integer with exactly n positive integer divisors. Find $\frac{f(200)}{f(50)}$ . [b]p17.[/b] The five points $A, B, C, D$, and $E$ lie in a plane. Vincent the Bug starts at point $A$ and, each minute, chooses a different point uniformly at random and crawls to it. Then the probability that Vincent is back at $A$ after $5$ minutes can be expressed as $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Compute $p + q$. [b]p18.[/b] A circle is divided in the following way. First, four evenly spaced points $A, B, C, D$ are marked on its perimeter. Point $P$ is chosen inside the circle and the circle is cut along the rays $PA$, $PB$, $PC$, $PD$ into four pieces. The piece bounded by $PA$, $PB$, and minor arc $AB$ of the circle has area equal to one fifth of the area of the circle, and the piece bounded by $PB$, $PC$, and minor arc $BC$ has area equal to one third of the area of the circle. Suppose that the ratio between the area of the second largest piece and the area of the circle is $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Compute $p + q$. [u]Round 7 [/u] [b]p19.[/b] There exists an integer $n$ such that $|2^n - 5^{50}|$ is minimized. Compute $n$. [b]p20.[/b] For nonnegative integers $a = \overline{a_na_{n-1} ... a_2a_1}$, $b = \overline{b_mb_{m-1} ... b_2b_1}$, define their distance to be $$d(a, b) = \overline{|a_{\max\,\,(m,n)} - b_{\max\,\,(m,n)}||a_{\max\,\,(m,n)-1} - b_{\max\,\,(m,n)-1}|...|a_1 - b_1|}$$ where $a_k = 0$ if $k > n$, $b_k = 0$ if $k > m$. For example, $d(12321, 5067) = 13346$. For how many nonnegative integers $n$ is $d(2021, n) + d(12345, n)$ minimized? [b]p21.[/b] Let $ABCDE$ be a regular pentagon and let $P$ be a point outside the pentagon such that $\angle PEA = 6^o$ and $\angle PDC = 78^o$. Find the degree-measure of $\angle PBD$. [u]Round 8[/u] [b]p22.[/b] What is the least positive integer $n$ such that $\sqrt{n + 3} -\sqrt{n} < 0.02$ ? [b]p23.[/b] What is the greatest prime divisor of $20^4 + 21 \cdot 23 - 6$? [b]p24.[/b] Let $ABCD$ be a parallelogram and let $M$ be the midpoint of $AC$. Suppose the circumcircle of triangle $ABM$ intersects $BC$ again at $E$. Given that $AB = 5\sqrt2$, $AM = 5$, $\angle BAC$ is acute, and the area of $ABCD$ is $70$, what is the length of $DE$? PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2949414p26408213]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all monic polynomials $P(x),Q(x)$ with integer coefficients such that $Q(0) =0$ and $P(Q(x)) = (x-1)(x-2)...(x-15)$.

The function $\varphi(x,y,z)$ defined for all triples $(x,y,z)$ of real numbers, is such that there are two functions $f$ and $g$ defined for all pairs of real numbers, such that \[\varphi(x,y,z) = f(x+y,z) = g(x,y+z)\] for all real numbers $x,y$ and $z.$ Show that there is a function $h$ of one real variable, such that \[\varphi(x,y,z) = h(x+y+z)\] for all real numbers $x,y$ and $z.$

4) find all polynom with coeffs a permutation of $[1,...,n]$ and all roots rational

Let $x_1, x_2, x_3, y_1, y_2, y_3$ be real numbers in $[-1, 1]$. Find the maximum value of \[(x_1y_2-x_2y_1)(x_2y_3-x_3y_2)(x_3y_1-x_1y_3).\]

For a given positive integer $n$ and prime number $p$, find the minimum value of positive integer $m$ that satisfies the following property: for any polynomial $$f(x)=(x+a_1)(x+a_2)\ldots(x+a_n)$$ ($a_1,a_2,\ldots,a_n$ are positive integers), and for any non-negative integer $k$, there exists a non-negative integer $k'$ such that $$v_p(f(k))<v_p(f(k'))\leq v_p(f(k))+m.$$ Note: for non-zero integer $N$,$v_p(N)$ is the largest non-zero integer $t$ that satisfies $p^t\mid N$.

Let $a, b, c$ be positive real numbers. Prove that $$\frac{1}{a+b+\frac{1}{abc}+1}+\frac{1}{b+c+\frac{1}{abc}+1}+\frac{1}{c+a+\frac{1}{abc}+1}\le \frac{a + b + c}{a+b+c+1}$$

Let $a\equiv 1\pmod{4}$ be a positive integer. Show that any polynomial $Q\in\mathbb{Z}[X]$ with all positive coefficients such that $$Q(n+1)((a+1)^{Q(n)}-a^{Q(n)})$$ is a perfect square for any $n\in\mathbb{N}^{\ast}$ must be a constant polynomial. [i]Proposed by Vlad Matei, Romania[/i]

Let $P(z)=a_nz^n+a_{n-1}z^{n-1}+\ldots+a_mz^m$ be a polynomial with complex coefficients such that $a_m\neq 0, a_n\neq 0$ and $n>m$. Prove that \[\text{max}_{|z|=1}\{|P(z)|\}\ge\sqrt{2|a_ma_n|+\sum_{k=m}^{n} |a_k|^2}\]

Point $ A$ lies at $ (0, 4)$ and point $ B$ lies at $ (3, 8)$. Find the $ x$-coordinate of the point $ X$ on the $ x$-axis maximizing $ \angle AXB$.

Prove that $x = y = z = 1$ is the only positive solution of the system \[\left\{ \begin{array}{l} x+y^2 +z^3 = 3\\ y+z^2 +x^3 = 3\\ z+x^2 +y^3 = 3\\ \end{array} \right. \]

It is known that there is a number $S$ such that if $ a+b+c+d = S$ and $\frac{1}{a}+ \frac{1}{b}+ \frac{1}{c}+ \frac{1}{d} = S$ $(a, b, c, d$ are different from zero and one$)$, then $\frac{1}{a- 1} ++ \frac{1}{b- 1} + \frac{1}{c- 1} + \frac{1}{d -1} = S.$ Find $S$.

Let $a$ be a positive real number. Collinear points $Z_1, Z_2, Z_3, Z_4$ (in that order) are plotted on the $(x, y)$ Cartesian plane. Suppose that the graph of the equation \[ x^2 + (y+a)^2 + x^2 + (y-a)^2 = 4a^2 + \sqrt{(x^2 + (y+a)^2)(x^2 + (y-a)^2)} \] passes through points $Z_1$ and $Z_4$, and the graph of the equation \[ x^2 + (y+a)^2 + x^2 + (y-a)^2 = 4a^2 - \sqrt{(x^2 + (y+a)^2)(x^2 + (y-a)^2)} \] passes through points $Z_2$ and $Z_3$. If $Z_1Z_2 = 5$, $Z_2Z_3 = 1$, and $Z_3Z_4 = 3$, then $a^2$ can be written as $\frac{m + n\sqrt{p}}{q}$, where $m$, $n$, $p$, and $q$ are positive integers, $m$, $n$, and $q$ are relatively prime, and $p$ is squarefree. Find $m + n + p + q$.

Let $x_0 = 10^9$, $x_n = \frac{x^2_{n-1}+2}{2x_{n-1}}$ for $n > 0$. Prove that $0 < x_{36} - \sqrt2 < 10^{-9}$.

Let $f(x) =x^2-2x$. Find all $x$ for which $f(f(x))<3$.

Let $f : N \to [0, \infty)$ be a function satisfying the following conditions: a) $f(4)=2$ b) $\frac{1}{f( 0 ) + f( 1)} + \frac{1}{f( 1 ) + f( 2 )} + ... + \frac{1}{f (n ) + f(n + 1) }= f ( n + 1)$ for all integers $n \ge 0$. Find $f(n)$ in closed form.

Let $x,y,z$ be positive real numbers such that $x^2+y^2+z^2=3$. Prove that \[ xyz(x+y+z)+2021\geqslant 2024xyz\]

Given the polynomial $P(x)=(x^2-7x+6)^{2n}+13$ where $n$ is a positive integer. Prove that $P(x)$ can't be written as a product of $n+1$ non-constant polynomials with integer coefficients.

[b]p1.[/b] $17$ rooks are placed on an $8\times 8$ chess board. Prove that there must be at least one rook that is attacking at least $2$ other rooks. [b]p2.[/b] In New Scotland there are three kinds of coins: $1$ cent, $6$ cent, and $36$ cent coins. Josh has $99$ of the $36$-cent coins (and no other coins). He is allowed to exchange a $36$ cent coin for $6$ coins of $6$ cents, and to exchange a $6$ cent coin for $6$ coins of $1$ cent. Is it possible that after several exchanges Josh will have $500$ coins? [b]p3.[/b] Find all solutions $a, b, c, d, e, f, g, h, i$ if these letters represent distinct digits and the following multiplication is correct: $\begin{tabular}{ccccc} & & a & b & c \\ x & & & d & e \\ \hline & f & a & c & c \\ + & g & h & i & \\ \hline f & f & f & c & c \\ \end{tabular}$ [b]p4.[/b] Pinocchio rode a bicycle for $3.5$ hours. During every $1$-hour period he went exactly $5$ km. Is it true that his average speed for the trip was $5$ km/h? Explain your reasoning. [b]p5.[/b] Let $a, b, c$ be odd integers. Prove that the equation $ax^2 + bx + c = 0$ cannot have a rational solution. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find a factor of $2^{33}-2^{19}-2^{17}-1$ that lies between $1000$ and $5000$.

Solve the system of equations $$ \left\{\begin{array}{l} x \log x+y \log y+z \log x=0\\ \\ \dfrac{\log x}{x}+\dfrac{\log y}{y}+\dfrac{\log z}{z}=0 \end{array} \right. $$

Let $m$ be a positive integer. Find all bounded sequences of integers $a_1, a_2, a_3,... $for which $a_n + a_{n+1} + a_{n+m }= 0$ for all $n \in N$.