The sequence $S_0,S_1,S_2,\ldots$ is defined by[list][*]$S_n=1$ for $0\le n\le 2011$, and [*]$S_{n+2012}=S_{n+2011}+S_n$ for $n\ge 0$.[/list]Prove that $S_{2011a}-S_a$ is a multiple of $2011$ for all nonnegative integers $a$.

Find all $f(x)\in \mathbb Z (x)$ that satisfies the following condition, with the lowest degree. [b]Condition[/b]: There exists $g(x),h(x)\in \mathbb Z (x)$ such that $$f(x)^4+2f(x)+2=(x^4+2x^2+2)g(x)+3h(x)$$.

Determine all polynomials $P (x)$ with real coefficients that apply $P (x^2) + 2P (x) = P (x)^2 + 2$.

Let $P(x)$ be a quadratic polynomial with nonnegative coeficients. Show that for any real numbers $x$ and $y$, we have the inequality $P(xy)^2 \leqslant P(x^2)P(y^2)$. [i]E. Malinnikova[/i]

For a polynomials $ P\in \mathbb{R}[x]$, denote $f(P)=n$ if $n$ is the smallest positive integer for which is valid $$(\forall x\in \mathbb{R})(\underbrace{P(P(\ldots P}_{n}(x))\ldots )>0),$$ and $f(P)=0$ if such n doeas not exist. Exists polyomial $P\in \mathbb{R}[x]$ of degree $2014^{2015}$ such that $f(P)=2015$? (Serbia)

Two players alternately replace the stars in the expression \[*x^{2000}+*x^{1999}+...+*x+1 \] by real numbers. The player who makes the last move loses if the resulting polynomial has a real root $t$ with $|t| < 1$, and wins otherwise. Give a winning strategy for one of the players.

Find all positive integers $n$ with $n \ge 2$ such that the polynomial \[ P(a_1, a_2, ..., a_n) = a_1^n+a_2^n + ... + a_n^n - n a_1 a_2 ... a_n \] in the $n$ variables $a_1$, $a_2$, $\dots$, $a_n$ is irreducible over the real numbers, i.e. it cannot be factored as the product of two nonconstant polynomials with real coefficients. [i]Proposed by Yang Liu[/i]

The following figure shows a [i]walk[/i] of length 6: [asy] unitsize(20); for (int x = -5; x <= 5; ++x) for (int y = 0; y <= 5; ++y) dot((x, y)); label("$O$", (0, 0), S); draw((0, 0) -- (1, 0) -- (1, 1) -- (0, 1) -- (-1, 1) -- (-1, 2) -- (-1, 3)); [/asy] This walk has three interesting properties: [list] [*] It starts at the origin, labelled $O$. [*] Each step is 1 unit north, east, or west. There are no south steps. [*] The walk never comes back to a point it has been to.[/list] Let's call a walk with these three properties a [i]northern walk[/i]. There are 3 northern walks of length 1 and 7 northern walks of length 2. How many northern walks of length 6 are there?

A set $S$ is constructed as follows. To begin, $S=\{0,10\}$. Repeatedly, as long as possible, if $x$ is an integer root of some polynomial $a_nx^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0$ for some $n\geq 1$, all of whose coefficients $a_i$ are elements of $S$, then $x$ is put into $S$. When no more elements can be added to $S$, how many elements does $S$ have? $\textbf{(A) } 4 \qquad \textbf{(B) } 5 \qquad \textbf{(C) } 7 \qquad \textbf{(D) } 9 \qquad \textbf{(E) } 11$

Determine all nonempty finite sets of positive integers $\{a_1, \dots, a_n\}$ such that $a_1 \cdots a_n$ divides $(x + a_1) \cdots (x + a_n)$ for every positive integer $x$. [i]Proposed by Ankan Bhattacharya[/i]

Let $f$ be a monic cubic polynomial such that the sum of the coefficients of $f$ is $5$ and such that the sum of the roots of $f$ is $1$. Find the absolute value of the sum of the cubes of the roots of $f$.

Suppose that $n>1$ and $P_n(x)$ is a polynomial of degree $n$. For $k =1,2, . . . ,n$ we have $P_n(k)=k(k+1)$. Also $P_n(0) = 1$. For all $n$ there exists an integer $m > n$ such that $P_n(m) = P_{n+2}(m)$. Find the value of $m$ for $n = 10$.

Suppose that $\xi \ne 1$ is a root of the polynomial $f(x) = x^{167} -1$. Compute $$\left|\sum_{0<a<b<167} \xi^{a^2+b^2} \right|.$$ In the above summation $a,b$ are integers

Let $$P(x)=1+2 x+7 x^{2}+13 x^{3}~,\qquad x \in \mathbb{R} .$$ Calculate for all $x \in \mathbb{R},$ $$\lim _{n \rightarrow \infty}\left(P\left(\frac{x}{n}\right)\right)^{n}$$

Let $f(x)$ be a polynomial of degree $n$ such that $f(x)^{p}$ is divisible by $f'(x)^{q}$ for some positive integers $p,q$. Prove that $f(x)$ is divisible by $f'(x)$ and that $f(x)$ has a single root of multiplicity $n$.