Determine all integers $n$ for which the polynomial $P(x) = 3x^3-nx-n-2$ can be written as the product of two non-constant polynomials with integer coeffcients.

Find all integers $n \ge 2$ for which there exists an integer $m$ and a polynomial $P(x)$ with integer coefficients satisfying the following three conditions: [list] [*]$m > 1$ and $\gcd(m,n) = 1$; [*]the numbers $P(0)$, $P^2(0)$, $\ldots$, $P^{m-1}(0)$ are not divisible by $n$; and [*]$P^m(0)$ is divisible by $n$. [/list] Here $P^k$ means $P$ applied $k$ times, so $P^1(0) = P(0)$, $P^2(0) = P(P(0))$, etc. [i]Carl Schildkraut[/i]

Let $p(x)$ be a polynomial with integer coefficients, and let $a, b$ and $c$ be three distinct integers. Show that it is not possible to have $p(a) = b$, $p(b) = c$, and $p(c) = a$.

Let $p(x)$ and $q(x)$ be non-constant polynomial functions with integer coeffcients. It is known that the polynomial $p(x)q(x) - 2015$ has at least $33$ different integer roots. Prove that neither $p(x)$ nor $q(x)$ can be a polynomial of degree less than three.

Let $f$ be a polynomial with integer coefficients. Define $$a_1 = f(0)~,~a_2 = f(a_1) = f(f(0))~,$$ and $~a_n = f(a_{n-1})$ for $n \geqslant 3$. If there exists a natural number $k \geqslant 3$ such that $a_k = 0$, then prove that either $a_1=0$ or $a_2=0$.

Find all natural numbers $n \ge 1$ such that there is a polynomial $p(x)$ with integer coefficients for which $p (1) = p (2) = 0$ and where $p (n)$ is a prime number .

$n>1$ and distinct positive integers $a_1,a_2,\ldots,a_{n+1}$ are  given. Does there exist a polynomial $p(x)\in\Bbb{Z}[x]$ of degree  $\le n$ that satisfies the following conditions? a. $\forall_{1\le i < j\le n+1}: \gcd(p(a_i),p(a_j))>1 $ b. $\forall_{1\le i < j < k\le n+1}: \gcd(p(a_i),p(a_j),p(a_k))=1 $ [i]Proposed by Mojtaba Zare[/i]

Let $P$ be an odd-degree integer-coefficient polynomial. Suppose that $xP(x)=yP(y)$ for infinitely many pairs $x,y$ of integers with $x\ne y$. Prove that the equation $P(x)=0$ has an integer root. [i]Victor Wang[/i]

The following expression $x^{30} + *x^{29} +...+ *x+8 = 0$ is written on a blackboard. Two players $A$ and $B$ play the following game. $A$ starts the game. He replaces all the asterisks by the natural numbers from $1$ to $30$ (using each of them exactly once). Then player $B$ replace some of" $+$ "by ” $-$ "(by his own choice). The goal of $A$ is to get the equation having a real root greater than $10$, while the goal of $B$ is to get the equation having a real root less that or equal to $10$. If both of the players achieve their goals or nobody of them achieves his goal, then the result of the game is a draw. Otherwise, the player achieving his goal is a winner. Who of the players wins if both of them play to win? (I.Bliznets)

Suppose a real number $a$ is a root of a polynomial with integer coefficients $P(x)=a_nx^n+a_{n-1}x^{n-1}+...+a_1x+a_0$. Let $G=|a_n|+|a_{n-1}|+...+|a_1|+|a_0|$. We say that $G$ is a [i]gingado [/i] of $a$. For example, as $2$ is root of $P(x)=x^2-x-2$, $G=|1|+|-1|+|-2|=4$, we say that $4$ is a [i]gingado[/i] of $2$. What is the fourth largest real number $a$ such that $3$ is a [i]gingado [/i] of $a$?

Let $P(x)$ be a polynomial whose coefficients are positive integers. If $P(n)$ divides $P(P(n)-2015)$ for every natural number $n$, prove that $P(-2015)=0$. [hide]One additional condition must be given that $P$ is non-constant, which even though is understood.[/hide]

Consider a polynomial $f(x) = x^4 +ax^3 +bx^2 +cx+d$ with integer coefficients. Prove that if $f(x)$ has exactly one real root, then it can be factored into nonconstant polynomials with rational coefficients

Let $$P(x)=a_0x^n+a_1x^{n-1}+\ldots+a_n$$ where $a_0,\ldots,a_n$ are integers. Show that if $P$ takes the value $2020$ for four distinct integral values of $x$, then $P$ cannot take the value $2001$ for any integral value of $x$. [i]Proposed by Ángel Plaza[/i]

A polynomial $P(x)$ with integer coefficients takes odd values at $x = 0$ and $x = 1$. Prove that $P(x)$ has no integer roots.

Let $p_1,p_2,p_3,p_4$ be four distinct primes. Prove that there is no polynomial $Q(x) = ax^3 + bx^2 + cx + d$ with integer coefficients such that $|Q(p_1)| =|Q(p_2)| = |Q(p_3)|= |Q(p_4 )| = 3$.