We call a polynomial $P(x)=a_dx^d+...+a_0$ of degree $d$ [i]nice[/i] if $$\frac{2021(|a_d|+...+|a_0|)}{2022}<max_{0 \le i \le d}|a_i|$$ Initially Shayan has a sequence of $d$ distinct real numbers; $r_1,...,r_d \neq \pm 1$. At each step he choose a positive integer $N>1$ and raises the $d$ numbers he has to the exponent of $N$, then delete the previous $d$ numbers and constructs a monic polynomial of degree $d$ with these number as roots, then examine whether it is nice or not. Prove that after some steps, all the polynomials that shayan produces would be nice polynomials Proposed by [i]Navid Safaei[/i]

Let $f(x)=x^2-ax+b$, where $a$ and $b$ are positive integers. (a) Suppose that $a=2$ and $b=2$. Determine the set of real roots of $f(x)-x$, and the set of real roots of $f(f(x))-x$. (b) Determine the number of positive integers $(a,b)$ with $1\le a,b\le 2011$ for which every root of $f(f(x))-x$ is an integer.

Let $a,b,c,d >0$ and $abcd=1$. Prove that: \[ \frac{1}{(1+a)^2}+\frac{1}{(1+b)^2}+\frac{1}{(1+c)^2}+\frac{1}{(1+d)^2} \geq 1 \]

Determine if there exist four polynomials such that the sum of any three of them has a real root while the sum of any two of them does not.

For each rational number $r$ consider the statement: If $x$ is a real number such that $x^2-rx$ and $x^3-rx$ are both rational, then $x$ is also rational. [list](a) Prove the claim for $r \ge \frac43$ and $r \le 0$. (b) Let $p,q$ be different odd primes such that $3p <4q$. Prove that the claim for $r=\frac{p}q$ does not hold. [/list]

Let $n$ be a natural number and $f(x)$ be a polynomial with real coefficients having $n$ different positive real roots. Is it possible the polynomial: $$x(x+1)(x+2)(x+4)f(x)+a$$ to be presented as the $k$-th power of a polynomial with real coefficients, for some natural $k\geq 2$ and real $a$?

Let $P(x, y)$ and $Q(x, y)$ be polynomials in two variables with integer coefficients. The sequences of integers $a_0, a_1,\ldots$ and $b_0, b_1,\ldots$ satisfy \[a_{n+1}=P(a_n,b_n),\quad b_{n+1}=Q(a_n,b_n)\]for all $n\geqslant 0$. Let $m_n$ be the number of integer points of the coordinate plane, lying strictly inside the segment with endpoints $(a_n,b_n)$ and $(a_{n+1},b_{n+1})$. Prove that the sequence $m_0,m_1,\ldots$ is non-decreasing.

Let $a,b$ be integers with $0<a<b$. A set $\{x,y,z\}$ of non-negative integers is [i]olympic[/i] if $x<y<z$ and if $\{z-y,y-x\}=\{a,b\}$. Show that the set of all non-negative integers is the union of pairwise disjoint olympic sets.

An ordered pair $(x, y)$ of integers is a primitive point if the greatest common divisor of $x$ and $y$ is $1$. Given a finite set $S$ of primitive points, prove that there exist a positive integer $n$ and integers $a_0, a_1, \ldots , a_n$ such that, for each $(x, y)$ in $S$, we have: $$a_0x^n + a_1x^{n-1} y + a_2x^{n-2}y^2 + \cdots + a_{n-1}xy^{n-1} + a_ny^n = 1.$$ [i]Proposed by John Berman, United States[/i]

Assume that a real polynomial $P(x)$ has no real roots. Prove that the polynomial $$Q(x)=P(x)+\frac{P''(x)}{2!}+\frac{P^{(4)}(x)}{4!}+\ldots$$ also has no real roots.

The players Alfred and Bertrand put together a polynomial $x^n + a_{n-1}x^{n- 1} +... + a_0$ with the given degree $n \ge 2$. To do this, they alternately choose the value in $n$ moves one coefficient each, whereby all coefficients must be integers and $a_0 \ne 0$ must apply. Alfred's starts first . Alfred wins if the polynomial has an integer zero at the end. (a) For which $n$ can Alfred force victory if the coefficients $a_j$ are from the right to the left, i.e. for $j = 0, 1,. . . , n - 1$, be determined? (b) For which $n$ can Alfred force victory if the coefficients $a_j$ are from the left to the right, i.e. for $j = n -1, n - 2,. . . , 0$, be determined? (Theresia Eisenkölbl, Clemens Heuberger)

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$.

Find all the functions $\varphi:\mathbb{Z}[x]\to\mathbb{Z}[x]$ such that $\varphi(x)=x,$ any integer polynomials $f, g$ satisfy $\varphi(f+g)=\varphi(f)+\varphi(g)$ and $\varphi(f)$ is a perfect power if and only if $f{}$ is a perfect power. [i]Note:[/i] A polynomial $f\in \mathbb{Z}[x]$ is a perfect power if $f = g^n$ for some $g\in \mathbb{Z}[x]$ and $n\geqslant 2.$ [i]Proposed by Pavel Ciurea[/i]

Prove that the polynomial $x^{1999}+x^{1998}+...+x^3+x^2+ax+b$ for any real values of the coefficients $a>b>0$ does not have an integer root.

[b]p1.[/b] Find the smallest positive integer $N$ such that $N!$ is a multiple of $10^{2010}$. [b]p2.[/b] An equilateral triangle $T$ is externally tangent to three mutually tangent unit circles, as shown in the diagram. Find the area of $T$. [b]p3. [/b]The polynomial $p(x) = x^3 + ax^2 + bx + c$ has the property that the average of its roots, the product of its roots, and the sum of its coefficients are all equal. If $p(0) = 2$, find $b$. [b]p4.[/b] A regular pentagon $P = A_1A_2A_3A_4A_5$ and a square $S = B_1B_2B_3B_4$ are both inscribed in the unit circle. For a given pentagon $P$ and square $S$, let $f(P, S)$ be the minimum length of the minor arcs AiBj , for $1 \le i \le 5$ and $1 \le j \le 4$. Find the maximum of $f(P, S)$ over all pairs of shapes. [b]p5.[/b] Let $ a, b, c$ be three three-digit perfect squares that together contain each nonzero digit exactly once. Find the value of $a + b + c$. [b]p6. [/b]There is a big circle $P$ of radius $2$. Two smaller circles $Q$ and $R$ are drawn tangent to the big circle $P$ and tangent to each other at the center of the big circle $P$. A fourth circle $S$ is drawn externally tangent to the smaller circles $Q$ and $R$ and internally tangent to the big circle $P$. Finally, a tiny fifth circle $T$ is drawn externally tangent to the $3$ smaller circles $Q, R, S$. What is the radius of the tiny circle $T$? [b]p7.[/b] Let $P(x) = (1 +x)(1 +x^2)(1 +x^4)(1 +x^8)(...)$. This infinite product converges when $|x| < 1$. Find $P\left( \frac{1}{2010}\right)$. [b]p8.[/b] $P(x)$ is a polynomial of degree four with integer coefficients that satisfies $P(0) = 1$ and $P(\sqrt2 + \sqrt3) = 0$. Find $P(5)$. [b]p9.[/b] Find all positive integers $n \ge 3$ such that both roots of the equation $$(n - 2)x^2 + (2n^2 - 13n + 38)x + 12n - 12 = 0$$ are integers. [b]p10.[/b] Let $a, b, c, d, e, f$ be positive integers (not necessarily distinct) such that $$a^4 + b^4 + c^4 + d^4 + e^4 = f^4.$$ Find the largest positive integer $n$ such that $n$ is guaranteed to divide at least one of $a, b, c, d, e, f$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].