Let $(x_n)$ be an infinite sequence of real numbers from interval $(0, 1)$. An infinite sequence $(a_n)$ of positive integers is defined as follows: $a_1 = 1$, and for $i \ge 1$, $a_{i+1}$ is equal to the smallest positive integer $m$, for which $[x_1 + x_2 + \ldots + x_m] = a_i$. Show that for any indexes $i, j$ holds $a_{i+j} \ge a_i + a_j$. [i]Proposed by Nazar Serdyuk[/i]

Let $\mathbb{Z}$ denote the set of all integers. Find all polynomials $P(x)$ with integer coefficients that satisfy the following property: For any infinite sequence $a_1$, $a_2$, $\dotsc$ of integers in which each integer in $\mathbb{Z}$ appears exactly once, there exist indices $i < j$ and an integer $k$ such that $a_i +a_{i+1} +\dotsb +a_j = P(k)$.

Let $P(x)$ be a polynomial with integer coefficients of degree $n \ge 3$. If $x_1,...,x_m$ ($n\ge m\ge3$) are different integers such that $P(x_1) = P(x_2) = ... = P(x_m) = 1$, prove that $P$ cannot have integer roots$.

[u]Round 1[/u] [b]p1.[/b] What is the remainder when $2021$ is divided by $102$? [b]p2.[/b] Brian has $2$ left shoes and $2$ right shoes. Given that he randomly picks $2$ of the $4$ shoes, the probability he will get a left shoe and a right shoe is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Compute $p + q$. [b]p3.[/b] In how many ways can $59$ be written as a sum of two perfect squares? (The order of the two perfect squares does not matter.) [u]Round 2 [/u] [b]p4.[/b] Two positive integers have a sum of $60$. Their least common multiple is $273$. What is the positive diffeerence between the two numbers? [b]p5.[/b] How many ways are there to distribute $13$ identical apples among $4$ identical boxes so that no two boxes receive the same number of apples? A box may receive zero apples. [b]p6.[/b] In square $ABCD$ with side length $5$, $P$ lies on segment $AB$ so that $AP = 3$ and $Q$ lies on segment $AD$ so that $AQ = 4$. Given that the area of triangle $CPQ$ is $x$, compute $2x$. [u]Round 3 [/u] [b]p7.[/b] Find the number of ordered triples $(a, b, c)$ of nonnegative integers such that $2a+3b+5c = 15$. [b]p8.[/b] What is the greatest integer $n \le 15$ such that $n + 1$ and $n^2 + 3$ are both prime? [b]p9.[/b] For positive integers $a, b$, and $c$, suppose that $gcd \,\,(a, b) = 21$, $gcd \,\,(a, c) = 10$, and $gcd \,\,(b,c) = 11$. Find $\frac{abc}{lcm \,\,(a,b,c)}$ . (Note: $gcd$ is the greatest common divisor function and $lcm$ is the least common multiple function.) [u]Round 4[/u] [b]p10.[/b] The vertices of a square in the coordinate plane are at $(0, 0)$, $(0, 6)$, $(6, 0)$, and $(6, 6)$. Line $\ell$ intersects the square at exactly two lattice points (that is, points with integer coordinates). How many such lines $\ell$ are there that divide the square into two regions, one of them having an area of $12$? [b]p11.[/b] Let $f(n)$ be defined as follows for positive integers $n$: $f(1) = 0$, $f(n) = 1$ if $n$ is prime, and $f(n) = f(n - 1) + 1$ otherwise. What is the maximum value of $f(n)$ for $n \le 120$? [b]p12.[/b] The graph of the equation $y = x^3 + ax^2 + bx + c$ passes through the points $(2,4)$, $(3, 9)$, and $(4, 16)$. What is $b$? PS. You should use hide for answers. Rounds 5- 8 have been posted [url=https://artofproblemsolving.com/community/c3h2949415p26408227]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given are positive integers $r$ and $k$ and an infinite sequence of positive integers $a_1 \le a_2 \le ...$ such that $\frac{r}{a_r}= k + 1$. Prove that there is a $t$ satisfying $\frac{t}{a_t}=k$.

Find all functions from $\mathbb{N}\cup\{0\}\to\mathbb{N}\cup\{0\}$ such that $f(m^2+mf(n))=mf(m+n)$, for all $m,n\in \mathbb{N}\cup\{0\}$.

Find all functions $f:\mathbb Z^+\to\mathbb R^+$ that satisfy $f(nk^2)=f(n)f^2(k)$ for all positive integers $n$ and $k$, furthermore $\lim\limits_{n\to\infty}\dfrac{f(n+1)}{f(n)}=1$.

Find all functions $f : \mathbb{N} \to \mathbb{N}$ with $$f(x) + yf(f(x)) < x(1 + f(y)) + 2021$$ holds for all positive integers $x,y.$

Let $\mathbb{R}^{+}$ be the set of positive real numbers. Find all real numbers $a$ for which there exists a function $f :\mathbb{R}^{+} \to \mathbb{R}^{+}$ such that $3(f(x))^{2}=2f(f(x))+ax^{4}$, for all $x \in \mathbb{R}^{+}$.

Find the sum of the real roots of the polynomial \[ \prod_{k=1}^{100} \left( x^2-11x+k \right) = \left( x^2-11x+1 \right)\left( x^2-11x+2 \right)\dots\left(x^2-11x+100\right). \][i]Proposed by Evan Chen[/i]

Find all functions $f : R- \{-1\} \to R$ such that $$f(x)f \left( f \left(\frac{1 - y}{1 + y} \right)\right) = f\left(\frac{x + y}{xy + 1}\right) $$ for all $x, y \in R$ that satisfy $(x + 1)(y + 1)(xy + 1) \ne 0$.

Prove that : For each integer $n \ge 3$, there exists the positive integers $a_1<a_2< \cdots <a_n$ , such that for $ i=1,2,\cdots,n-2 $ , With $a_{i},a_{i+1},a_{i+2}$ may be formed as a triangle side length , and the area of the triangle is a positive integer.

For each non-zero complex number $ z,$ let $\arg(z)$ be the unique real number $ t$ such that $ \minus{}\pi < t \leq \pi$ and $ z \equal{} |z|(\cos(t) \plus{} \textrm{i} sin(t)).$ Given a real number $ c > 0$ and a complex number $ z \neq 0$ with $\arg z \neq \pi,$ define \[ B(c, z) \equal{} \{b \in \mathbb{R} \ ; \ |w \minus{} z| < b \Rightarrow |\arg(w) \minus{} \arg(z)| < c\}.\] Determine necessary and sufficient conditions, in terms of $ c$ and $ z,$ such that $ B(c, z)$ has a maximum element, and determine what this maximum element is in this case.

[b]p1.[/b] A band of pirates unloaded some number of treasure chests from their ship. The number of pirates was between $60$ and $69$ (inclusive). Each pirate handled exactly $11$ treasure chests, and each treasure chest was handled by exactly $7$ pirates. Exactly how many treasure chests were there? Show that your answer is the only solution. [b]p2.[/b] Let $a$ and $b$ be the lengths of the legs of a right triangle, let $c$ be the length of the hypotenuse, and let $h$ be the length of the altitude drawn from the vertex of the right angle to the hypotenuse. Prove that $c+h>a+b$. [b]p3.[/b] Prove that $$\frac{1}{70}< \frac{1}{2} \frac{3}{4} \frac{5}{6} ... \frac{2001}{2002} < \frac{1}{40}$$ [b]p4.[/b] Given a positive integer $a_1$ we form a sequence $a_1 , a_2 , a _3,...$ as follows: $a_2$ is obtained from $a_1$ by adding together the digits of $a_1$ raised to the $2001$-st power; $a_3$ is obtained from $a_2$ using the same rule, and so on. For example, if $a_1 =25$, then $a_2 =2^{2001}+5^{2001}$, which is a $1399$-digit number containing $106$ $0$'s, $150$ $1$'s, 4124$ 42$'s, $157$ $3$'s, $148$ $4$'s, $141$ $5$'s, $128$ $6$'s, $1504 47$'s, $152$ $8$'s, $143$ $9$'s. So $a_3 = 106 \times 0^{2001}+ 150 \times 1^{2001}+ 124 \times 2^{2001}+ 157 \times 3^{2001}+ ...+ 143 \times 9^{2001}$ which is a $1912$-digit number, and so forth. Prove that if any positive integer $a_1$ is chosen to start the sequence, then there is a positive integer $M$ (which depends on $a_1$ ) that is so large that $a_n < M$ for all $n=1,2,3,...$ [b]p5.[/b] Let $P(x)$ be a polynomial with integer coefficients. Suppose that there are integers $a$, $b$, and $c$ such that $P(a)=0$, $P(b)=1$, and $P(c)=2$. Prove that there is at most one integer $n$ such that $P(n)=4$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ be a positive integer. Prove that $a_1!a_2! ... a_n! < k!$, where $k$ is an integer which is greater than the sum of the positive integers $a_1, a_2,.., a_n$.

For a non-empty finite set $A$ of positive integers, let $\text{lcm}(A)$ denote the least common multiple of elements in $A$, and let $d(A)$ denote the number of prime factors of $\text{lcm}(A)$ (counting multiplicity). Given a finite set $S$ of positive integers, and $$f_S(x)=\sum_{\emptyset \neq A \subset S} \frac{(-1)^{|A|} x^{d(A)}}{\text{lcm}(A)}.$$ Prove that, if $0 \le x \le 2$, then $-1 \le f_S(x) \le 0$.

The numbers $1,2,\ldots,49,50$ are written on the blackboard. Ann performs the following operation: she chooses three arbitrary numbers $a,b,c$ from the board, replaces them by their sum $a+b+c$ and writes $(a+b)(b+c)(c+a)$ to her notebook. Ann performs such operations until only two numbers remain on the board (in total 24 operations). Then she calculates the sum of all $24$ numbers written in the notebook. Let $A$ and $B$ be the maximum and the minimum possible sums that Ann san obtain. Find the value of $\frac{A}{B}$. [i](I. Voronovich)[/i]

Let $n\in\mathbb{N}^*$. Prove that \[ \lim_{x\to 0}\frac{ \displaystyle (1+x^2)^{n+1}-\prod_{k=1}^n\cos kx}{ \displaystyle x\sum_{k=1}^n\sin kx}=\frac{2n^2+n+12}{6n}. \]

Given that $P(x)$ is the least degree polynomial with rational coefficients such that \[P(\sqrt{2} + \sqrt{3}) = \sqrt{2},\] find $P(10)$.

Determine if there are triplets ($x,y,z)$ of real numbers such that $$\begin{cases} x+y+z=7 \\ xy+yz+zx=11\end{cases}$$ If the answer is affirmative, find the minimum and maximum values ​​of $z$ in such a triplet.

Find all the functions $f:\mathbb{N}\to\mathbb{R}$ that satisfy \[ f(x+y)=f(x)+f(y) \] for all $x,y\in\mathbb{N}$ satisfying $10^6-\frac{1}{10^6} < \frac{x}{y} < 10^6+\frac{1}{10^6}$. Note: $\mathbb{N}$ denotes the set of positive integers and $\mathbb{R}$ denotes the set of real numbers.

Find all polynomials with real coefficients such that one can find an integer valued series $a_0, a_1, \dots$ satisfying $\lfloor P(x) \rfloor = a_{ \lfloor x^2 \rfloor}$ for all $x$ real numbers.

Let \(f:\mathbb R\to\mathbb R\) be a function such that for all real numbers \(x\neq1\), \[f(x-f(x))+f(x)=\frac{x^2-x+1}{x-1}.\] Find all possible values of \(f(2023)\). [i]Proposed by Linus Tang[/i]

Positive real numbers $a$ and $b$ satisfy the following conditions: the function $f(x)=x^3+ax^2+2bx-1$ has three different real roots, while the function $g(x)=2x^2+2bx+a$ doesn't have real roots. Prove that $a-b>1$. [i](V. Karamzin)[/i]

Given the polynomial sequence $(p_{n}(x))$ satisfying $p_{1}(x)=x^{2}-1$, $p_{2}(x)=2x(x^{2}-1)$, and $p_{n+1}(x)p_{n-1}(x)=(p_{n}(x)^{2}-(x^{2}-1)^{2}$, for $n\geq 2$, let $s_{n}$ be the sum of the absolute values of the coefficients of $p_{n}(x)$. For each $n$, find a non-negative integer $k_{n}$ such that $2^{-k_{n}}s_n$ is odd.