Given $P(z)= z^2 +az +b,$ where $a,b \in \mathbb{C}.$ Suppose that $|P(z)|=1$ for every complex number $z$ with $|z|=1.$ Prove that $a=b=0.$

A polynomial $p(x)$ of degree $1000$ is such that $p(n) = (n+1)2^n$ for all nonnegative integers $n$ such that $n\leq 1000$. Given that \[p(1001) = a\cdot 2^b - c,\] where $a$ is an odd integer, and $0 < c < 2007$, find $c-(a+b)$.

Maxim has guessed a polynomial $f(x)$ of degree $n$. Sasha wants to guess it (knowing $n$). During a turn, Sasha can name a certain segment $[a;b]$ and Maxim will give in response the maximum value of $f(x)$ on the segment $[a;b]$. Will Sasha be able to guess $f(x)$ in a finite number of steps? [i]M. Didin[/i]

Let $ \mathbb{Z}$ be the ring of rational integers. Construct an integral domain $ I$ satisfying the following conditions: a)$ \mathbb{Z} \varsubsetneqq I$; b) no element of $ I \minus{} \mathbb{Z}$ (only in $ I$) is algebraic over $ \mathbb{Z}$ (that is, not a root of a polynomial with coefficients in $ \mathbb{Z}$); c) $ I$ only has trivial endomorphisms. [i]E. Fried[/i]

Let $n$ be a positive integer. Find all positive integers $m$ for which there exists a polynomial $f(x) = a_{0} + \cdots + a_{n}x^{n} \in \mathbb{Z}[X]$ ($a_{n} \not= 0$) such that $\gcd(a_{0},a_{1},\cdots,a_{n},m)=1$ and $m|f(k)$ for each $k \in \mathbb{Z}$.

Find a polynomial $Q(x)$ such that $(2x^2 - 6x + 5)Q(x)$ is a polynomial with all positive coefficients.

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]

The polynomial $P(x) = x^3 - 6x - 2$ has three real roots, $\alpha$, $\beta$, and $\gamma$. Depending on the assignment of the roots, there exist two different quadratics $Q$ such that the graph of $y=Q(x)$ pass through the points $(\alpha,\beta)$, $(\beta,\gamma)$, and $(\gamma,\alpha)$. What is the larger of the two values of $Q(1)$?

For each integer $n > 0$ show that there is a polynomial $p(x)$ such that $p(2 cos x) = 2 cos nx$.

Let $P(x)$ and $Q(x)$ be (monic) polynomials with real coefficients (the first coefficient being equal to $1$), and $\deg P(x)=\deg Q(x)=10$. Prove that if the equation $P(x)=Q(x)$ has no real solutions, then $ P(x+1)=Q(x-1) $ has a real solution.

If $ a_0,a_1,\dots,a_{50}$ are the coefficients of the polynomial \[ \left(1\plus{}x\plus{}x^2\right)^{25}\] show that $ a_0\plus{}a_2\plus{}a_4\plus{}\cdots\plus{}a_{50}$ is even.

Let $a$ and $b$ be real numbers, and the polynomial $P(x) =ax + b$ such that $P(2)- P(1)= 3$: Compute the value of $P(5)- P(0)$. [b]A.[/b] $11$ [b]B.[/b] $13$ [b]C.[/b] $15$ [b]D.[/b] $17$ [b]E.[/b] $19$

Prove that if the polynomial $ f(x) = ax^3 + bx^2 + cx + d $ with integer coefficients takes odd values for $ x = 0 $ and $ x = 1 $, then the equation $ f(x) = 0 $ has no integer roots.

Let $ k \equal{} \sqrt[3]{3}$. a, Find all polynomials $ p(x)$ with rationl coefficients whose degree are as least as possible such that $ p(k \plus{} k^2) \equal{} 3 \plus{} k$. b, Does there exist a polynomial $ p(x)$ with integer coefficients satisfying $ p(k \plus{} k^2) \equal{} 3 \plus{} k$

We define the polynomial $f(x)$ in $\mathbb R[x]$ as follows: $f(x)=x^n+a_{n-2}x^{n-2}+a_{n-3}x^{n-3}+.....+a_1x+a_0$ Prove that there exists an $i$ in the set $\{1,....,n\}$ such that we have $|f(i)|\ge \frac{n!}{\dbinom{n}{i}}$. [i]proposed by Mohammadmahdi Yazdi[/i]

Find all second degree polynomial $d(x)=x^{2}+ax+b$ with integer coefficients, so that there exists an integer coefficient polynomial $p(x)$ and a non-zero integer coefficient polynomial $q(x)$ that satisfy: \[\left( p(x) \right)^{2}-d(x) \left( q(x) \right)^{2}=1, \quad \forall x \in \mathbb R.\]

The nonzero coefficients of a polynomial $P$ with real coefficients are all replaced by their mean to form a polynomial $Q$. Which of the following could be a graph of $y = P(x)$ and $y = Q(x)$ over the interval $-4\leq x \leq 4$? [asy]//Choice A size(100);defaultpen(linewidth(0.7)+fontsize(8)); real end=4.5; draw((-end,0)--(end,0), EndArrow(5)); draw((0,-end)--(0,end), EndArrow(5)); real ticks=0.2, four=3.7, r=0.1; draw((1,ticks)--(1,-ticks)^^(-1,ticks)--(-1,-ticks)^^(four,ticks)--(four,-ticks)^^(-four,ticks)--(-four,-ticks)); label("$x$", (4,0), N); label("$y$", (0,4), W); label("$-4$", (-4,-ticks), S); label("$-1$", (-1,-ticks), S); label("$1$", (1,-ticks), S); label("$4$", (4,-ticks), S); real f(real x) { return 0.101562 x^4+0.265625 x^3+0.0546875 x^2-0.109375 x+0.125; } real g(real x) { return 0.0625 x^4+0.0520833 x^3-0.21875 x^2-0.145833 x-2.5; } draw(graph(f,-four, four), heavygray); draw(graph(g,-four, four), black); clip((-end-r,-end-r)--(-end-r, end+r)--(end+r,end+r)--(end+r, -end-r)--cycle); label("$\textbf{(A)}$", (-5,4.5)); [/asy] [asy]//Choice B size(100);defaultpen(linewidth(0.7)+fontsize(8)); real end=4.5; draw((-end,0)--(end,0), EndArrow(5)); draw((0,-end)--(0,end), EndArrow(5)); real ticks=0.2, four=3.7, r=0.1; draw((1,ticks)--(1,-ticks)^^(-1,ticks)--(-1,-ticks)^^(four,ticks)--(four,-ticks)^^(-four,ticks)--(-four,-ticks)); label("$x$", (4,0), N); label("$y$", (0,4), W); label("$-4$", (-4,-ticks), S); label("$-1$", (-1,-ticks), S); label("$1$", (1,-ticks), S); label("$4$", (4,-ticks), S); real f(real x) { return 0.541667 x^4+0.458333 x^3-0.510417 x^2-0.927083 x-2; } real g(real x) { return -0.791667 x^4-0.208333 x^3-0.177083 x^2-0.260417 x-1; } draw(graph(f,-four, four), heavygray); draw(graph(g,-four, four), black); clip((-end-r,-end-r)--(-end-r, end+r)--(end+r,end+r)--(end+r, -end-r)--cycle); label("$\textbf{(B)}$", (-5,4.5)); [/asy] [asy]//Choice C size(100);defaultpen(linewidth(0.7)+fontsize(8)); real end=4.5; draw((-end,0)--(end,0), EndArrow(5)); draw((0,-end)--(0,end), EndArrow(5)); real ticks=0.2, four=3.7, r=0.1; draw((1,ticks)--(1,-ticks)^^(-1,ticks)--(-1,-ticks)^^(four,ticks)--(four,-ticks)^^(-four,ticks)--(-four,-ticks)); label("$x$", (4,0), N); label("$y$", (0,4), W); label("$-4$", (-4,-ticks), S); label("$-1$", (-1,-ticks), S); label("$1$", (1,-ticks), S); label("$4$", (4,-ticks), S); real f(real x) { return 0.21875 x^2+0.28125 x+0.5; } real g(real x) { return -0.375 x^2-0.75 x+0.5; } draw(graph(f,-four, four), heavygray); draw(graph(g,-four, four), black); clip((-end-r,-end-r)--(-end-r, end+r)--(end+r,end+r)--(end+r, -end-r)--cycle); label("$\textbf{(C)}$", (-5,4.5)); [/asy] [asy]//Choice D size(100);defaultpen(linewidth(0.7)+fontsize(8)); real end=4.5; draw((-end,0)--(end,0), EndArrow(5)); draw((0,-end)--(0,end), EndArrow(5)); real ticks=0.2, four=3.7, r=0.1; draw((1,ticks)--(1,-ticks)^^(-1,ticks)--(-1,-ticks)^^(four,ticks)--(four,-ticks)^^(-four,ticks)--(-four,-ticks)); label("$x$", (4,0), N); label("$y$", (0,4), W); label("$-4$", (-4,-ticks), S); label("$-1$", (-1,-ticks), S); label("$1$", (1,-ticks), S); label("$4$", (4,-ticks), S); real f(real x) { return 0.015625 x^5-0.244792 x^3+0.416667 x+0.6875; } real g(real x) { return 0.0284722 x^6-0.340278 x^4+0.874306 x^2-1.5625; } real z=3.14; draw(graph(f,-z, z), heavygray); draw(graph(g,-z, z), black); clip((-end-r,-end-r)--(-end-r, end+r)--(end+r,end+r)--(end+r, -end-r)--cycle); label("$\textbf{(D)}$", (-5,4.5)); [/asy] [asy]//Choice E size(100);defaultpen(linewidth(0.7)+fontsize(8)); real end=4.5; draw((-end,0)--(end,0), EndArrow(5)); draw((0,-end)--(0,end), EndArrow(5)); real ticks=0.2, four=3.7, r=0.1; draw((1,ticks)--(1,-ticks)^^(-1,ticks)--(-1,-ticks)^^(four,ticks)--(four,-ticks)^^(-four,ticks)--(-four,-ticks)); label("$x$", (4,0), N); label("$y$", (0,4), W); label("$-4$", (-4,-ticks), S); label("$-1$", (-1,-ticks), S); label("$1$", (1,-ticks), S); label("$4$", (4,-ticks), S); real f(real x) { return 0.026067 x^4-0.0136612 x^3-0.157131 x^2-0.00961796 x+1.21598; } real g(real x) { return -0.166667 x^3+0.125 x^2+0.479167 x-0.375; } draw(graph(f,-four, four), heavygray); draw(graph(g,-four, four), black); clip((-end-r,-end-r)--(-end-r, end+r)--(end+r,end+r)--(end+r, -end-r)--cycle); label("$\textbf{(E)}$", (-5,4.5)); [/asy]

Depending on the real number \( a \), find all polynomials \( P(x) \) with real coefficients such that \[ (x^3 - ax^2 + 1)P(x) = (x^3 + ax^2 + 1)P(x-1) \] for every real number \( x \).

Suppose that $ x_1, x_2, x_3, \ldots$ are positive real numbers for which \[ x^n_n \equal{} \sum^{n\minus{}1}_{j\equal{}0} x^j_n\] for $ n \equal{} 1, 2, 3, \ldots$ Prove that $ \forall n,$ \[ 2 \minus{} \frac{1}{2^{n\minus{}1}} \leq x_n < 2 \minus{} \frac{1}{2^n}.\]

Let $ n>m>1$ be odd integers, let $ f(x)\equal{}x^n\plus{}x^m\plus{}x\plus{}1$. Prove that $ f(x)$ can't be expressed as the product of two polynomials having integer coefficients and positive degrees.

Let the function $f:N^*\to N^*$ such that [b](1)[/b] $(f(m),f(n))\le (m,n)^{2014} , \forall m,n\in N^*$; [b](2)[/b] $n\le f(n)\le n+2014 , \forall n\in N^*$ Show that: there exists the positive integers $N$ such that $ f(n)=n $, for each integer $n \ge N$. (High School Affiliated to Nanjing Normal University )

Let $F$ be the set of all polynomials $\Gamma$ such that all the coefficients of $\Gamma (x)$ are integers and $\Gamma (x) = 1$ has integer roots. Given a positive intger $k$, find the smallest integer $m(k) > 1$ such that there exist $\Gamma \in F$ for which $\Gamma (x) = m(k)$ has exactly $k$ distinct integer roots.

$k$ and $n$ are positive integers that are greater than $1$. $N$ is the set of positive integers. $A_1, A_2, \cdots A_k$ are pairwise not-intersecting subsets of $N$ and $A_1 \cup A_2 \cup \cdots \cup A_k = N$. Prove that for some $i \in \{ 1,2,\cdots,k \}$, there exsits infinity many non-factorable n-th degree polynomials so that coefficients of one polynomial are pairwise distinct and all the coeficients are in $A_i$.

Let $P (x)$ be a polynomial with integer coefficients. Given that for some integer $a$ and some positive integer $n$, where \[\underbrace{P(P(\ldots P}_{\text{n times}}(a)\ldots)) = a,\] is it true that $P (P (a)) = a$?

Determine the largest positive integer $n$ such that the following statement is true: There exists $n$ real polynomials, $P_1(x),\ldots,P_n(x)$ such that the sum of any two of them have no real roots but the sum of any three does.