Find all pairs of polynomials $p$, $q$ with complex coefficients so that \[p(x)\cdot q(x)=p(q(x)).\]

Given is a polynomial $P(x)$ of degree $n>1$ with real coefficients. The equation $P(P(P(x)))=P(x)$ has $n^3$ distinct real roots. Prove that these roots could be split into two groups with equal arithmetic mean.

Let $ P,Q,R $ be polynomials of degree $ 3 $ with real coefficients such that $ P(x)\le Q(x)\le R(x) , $ for every real $ x. $ Suppose $ P-R $ admits a root. Show that $ Q=kP+(1-k)R, $ for some real number $ k\in [0,1] . $ What happens if $ P,Q,R $ are of degree $ 4, $ under the same circumstances?

Determine the maximum value of $m^2+n^2$, where $m$ and $n$ are integers in the range $1,2,\ldots,1981$ satisfying $(n^2-mn-m^2)^2=1$.

Let $n \ge 2$ be an integer. Find all real numbers $a$ such that there exist real numbers $x_1,x_2,\dots,x_n$ satisfying \[x_1(1-x_2)=x_2(1-x_3)=\dots=x_n(1-x_1)=a.\] [i]Proposed by Walther Janous and Gerhard Kirchner, Innsbruck.[/i]

Find all positive integers such that $3^{2n}+3n^2+7$ is a perfect square.

Let $ K$ be a finite field of $ p$ elements, where $ p$ is a prime. For every polynomial $ f(x)\equal{}\sum_{i\equal{}0}^na_ix^i$ ($ \in K[x]$) put $ \overline{f(x)}\equal{}\sum_{i\equal{}0}^n a_ix^{p^i}$. Prove that for any pair of polynomials $ f(x),g(x)\in K[x]$, $ \overline{f(x)}|\overline{g(x)}$ if and only if $ f(x)|g(x)$.

For any set $A=\{a_1,a_2,\cdots,a_m\}$, let $P(A)=a_1a_2\cdots a_m$. Let $n={2010\choose99}$, and let $A_1, A_2,\cdots,A_n$ be all $99$-element subsets of $\{1,2,\cdots,2010\}$. Prove that $2010|\sum^{n}_{i=1}P(A_i)$.

Let $n$ be a natural number and $f_1$, $f_2$, ..., $f_n$ be polynomials with integers coeffcients. Show that there exists a polynomial $g(x)$ which can be factored (with at least two terms of degree at least $1$) over the integers such that $f_i(x)+g(x)$ cannot be factored (with at least two terms of degree at least $1$) over the integers for every $i$.

Let \(P(x)=x^{2}+ax+b\) be a quadratic polynomial where \(a\) is real and \(b \neq 2\), is rational. Suppose \(P(0)^{2},P(1)^{2},P(2)^{2}\) are integers, prove that \(a\) and \(b\) are integers.

Consider the equilateral triangular lattice in the complex plane defined by the Eisenstein integers; let the ordered pair $(x,y)$ denote the complex number $x+y\omega$ for $\omega=e^{2\pi i/3}$. We define an $\omega$-chessboard polygon to be a (non self-intersecting) polygon whose sides are situated along lines of the form $x=a$ or $y=b$, where $a$ and $b$ are integers. These lines divide the interior into unit triangles, which are shaded alternately black and white so that adjacent triangles have different colors. To tile an $\omega$-chessboard polygon by lozenges is to exactly cover the polygon by non-overlapping rhombuses consisting of two bordering triangles. Finally, a [i]tasteful tiling[/i] is one such that for every unit hexagon tiled by three lozenges, each lozenge has a black triangle on its left (defined by clockwise orientation) and a white triangle on its right (so the lozenges are BW, BW, BW in clockwise order). a) Prove that if an $\omega$-chessboard polygon can be tiled by lozenges, then it can be done so tastefully. b) Prove that such a tasteful tiling is unique. [i]Victor Wang.[/i]

It is known that $a^{2005} + b^{2005}$ can be expressed as the polynomial of $a + b$ and $ab$. Find the coefficients' sum of this polynomial.

Find all pairs $ (m, n)$ of positive integers that have the following property: For every polynomial $P (x)$ of real coefficients and degree $m$, there exists a polynomial $Q (x)$ of real coefficients and degree $n$ such that $Q (P (x))$ is divisible by $Q (x)$.

Let $x$, $y$, $z$ be positive reals satisfying $\left(x+y+z\right)^{3}=32xyz$ Find the minimum and the maximum of $P=\frac{x^{4}+y^{4}+z^{4}}{\left(x+y+z\right)^{4}}$

Let $a,b, c, d,e$ be the roots of $p(x) = 2x^5 - 3x^3 + 2x -7$. Find the value of $$(a^3 - 1)(b^3 - 1)(c^3 - 1)(d^3 - 1)(e^3 - 1).$$

Let $k$ be a constant number larger than $1$. Find all polynomials $P(x)$ such that $P({x^k}) = {\left( {P(x)} \right)^k}$ for all real $x$.

Real numbers $x_1, x_2, x_3, x_4$ are roots of the fourth degree polynomial $W (x)$ with integer coefficients. Prove that if $x_3 + x_4$ is a rational number and $x_3x_4$ is a irrational number, then $x_1 + x_2 = x_3 + x_4$.

$p(x) $ is a real polynomial of degree $3$. Find necessary and sufficient conditions on its coefficients in order that $p(n)$ is integral for every integer $n$.

Let $ f(x) \equal{} 1 \plus{} x \plus{} x^2 \plus{} \cdots \plus{} x^{100}$. Find $ f'(1)$.

Find all polynomials $P$ such that $P(x)+3P(x+2)=3P(x+1)+P(x+3)$ for all real numbers $x$.

Prove that the equation $x^6 - 100x+1 = 0$ has two roots, and both of these roots are positive. a) Find the first non-zero digit in the decimal notation of the lesser root of this equation. b) Find the first two non-zero digits in the decimal notation of the lesser root of this equation.

Decide whether for every polynomial $P$ of degree at least $1$, there exist infinitely many primes that divide $P(n)$ for at least one positive integer $n$. [i](Walther Janous)[/i]

Find the least positive integer $ n$ so that the polynomial $ P(X)\equal{}\sqrt3\cdot X^{n\plus{}1}\minus{}X^n\minus{}1$ has at least one root of modulus $ 1$.

Does there exist an irreducible two variable polynomial $f(x,y)\in \mathbb{Q}[x,y]$ such that it has only four roots $(0,1),(1,0),(0,-1),(-1,0)$ on the unit circle.

Prove that the graph of the polynomial $P(x)$ is symmetric in respect to point $A(a,b)$ if and only if there exists a polynomial $Q(x)$ such that: $P(x) = b + (x-a)Q((x-a)^2)).$