Prove that if $F(x)$ and $G(x)$ are polynomials with coefficients $0$ and $1$ such that $$F(x)G(x) = 1 +x + x^2 +...+ x^{n-1}$$ holds for some $n > 1$, then one of them can be represented in the form $$ (1 +x + x^2 +...+ x^{k-1}) T(x)$$ for some $k > 1$ where $T(x)$ is a polynomial with coefficients $0$ and $1$. (V Senderov, M Vialiy)

Given is the polynomial $P(x)$ and the numbers $a_1,a_2,a_3,b_1,b_2,b_3$ such that $a_1a_2a_3\not=0$. Suppose that for every $x$, we have \[P(a_1x+b_1)+P(a_2x+b_2)=P(a_3x+b_3)\] Prove that the polynomial $P(x)$ has at least one real root.

Find all pairs $(a, b)$ of real numbers such that the roots of polynomials $6x^2 -24x -4a$ and $x^3 + ax^2 + bx - 8$ are all non-negative real numbers.

Determine the real numbers $a$ such that the equation $a 3^x + 3^{-x} = 3$ has exactly one solution $x.$

Let $P(x)$ be a polynomial with integer coefficients. We will denote the set of all prime numbers by $\mathbb P$. Show that the set $\mathbb S := \{p\in\mathbb P : \exists\text{ }n \text{ s.t. }p\mid P(n)\}$ is finite if and only if $P(x)$ is a non-zero constant polynomial.

19) Each cell of a $2$ × $5$ grid of unit squares is to be colored white or black. Compute the number of such colorings for which no $2$ × $2$ square is a single color. 20) Let $n$ be a three-digit integer with nonzero digits, not all of which are the same. Define $f(n)$ to be the greatest common divisor of the six integers formed by any permutation of $n$s digits. For example, $f(123) = 3$, because $gcd(123, 132, 213, 231, 312, 321) = 3$. Let the maximum possible value of $f(n)$ be $k$. Find the sum of all $n$ for which $f(n) = k$. 21) Consider a $2$ × $2$ grid of squares. Each of the squares will be colored with one of $10$ colors, and two colorings are considered equivalent if one can be rotated to form the other. How many distinct colorings are there? 22) Find all the roots of the polynomial $x^5 - 5x^4 + 11x^3 -13x^2+9x-3$ 23) Compute the smallest positive integer $n$ for which $0 < \sqrt[4]{n} - \left \lfloor{\sqrt[4]{n}}\right \rfloor < \dfrac{1}{2015}$. 24) Three ants begin on three different vertices of a tetrahedron. Every second, they choose one of the three edges connecting to the vertex they are on with equal probability and travel to the other vertex on that edge. They all stop when any two ants reach the same vertex at the same time. What is the probability that all three ants are at the same vertex when they stop? 25) Let $ABC$ be a triangle that satisfies $AB = 13$, $BC = 14$, $AC = 15$. Given a point $P$ in the plane, let $PA$, $PB$, $PC$ be the reflections of $A$, $B$, $C$ across $P$. Call $P$ [i]good[/i] if the circumcircle of $P_A P_B P_C$ intersects the circumcircle of $ABC$ at exactly 1 point. The locus of good points $P$ encloses a region $S$. Find the area of $S$. 26. Let $f : \mathbb{R}^+ \rightarrow \mathbb{R}$ be a continuous function satisfying $f(xy) = f(x) + f(y) + 1$ for all positive reals ${x,y}$. If $f(2) = 0$, compute $f(2015)$. 27) Let $ABCD$ be a quadrilateral with $A = (3,4)$, $B=(9,-40)$, $C = (-5,-12)$, $D = (-7,24)$. Let $P$ be a point in the plane (not necessarily inside the quadrilateral). Find the minimum possible value of $\overline{AP} + \overline{BP} + \overline{CP} + \overline{DP}$.

$(1+x^2)(1-x^3)$ equals $ \text{(A)}\ 1 - x^5\qquad\text{(B)}\ 1 - x^6\qquad\text{(C)}\ 1+ x^2 -x^3\qquad \\ \text{(D)}\ 1+x^2-x^3-x^5\qquad \text{(E)}\ 1+x^2-x^3-x^6 $

$29$ quadratic polynomials $f_1(x), \ldots, f_{29}(x)$ and $15$ real numbers $x_1<x_2<\ldots<x_{15}$ are given. Prove that for some two given polynomials $f_i(x)$ and $f_j(x)$ the following inequality holds: $$\sum_{k=1}^{14} (f_i(x_{k+1})-f_i(x_k))(f_j(x_{k+1})-f_j(x_k))>0$$ [i]A. Voidelevich[/i]

Let $p$ be a prime and $k$ a positive integer such that $k \le p$. We know that $f(x)$ is a polynomial in $\mathbb Z[x]$ such that for all $x \in \mathbb{Z}$ we have $p^k | f(x)$. [b](a)[/b] Prove that there exist polynomials $A_0(x),\ldots,A_k(x)$ all in $\mathbb Z[x]$ such that \[ f(x)=\sum_{i=0}^{k} (x^p-x)^ip^{k-i}A_i(x),\] [b](b)[/b] Find a counter example for each prime $p$ and each $k > p$.

Let $P(x, y)$ be a non-constant homogeneous polynomial with real coefficients such that $P(\sin t, \cos t) = 1$ for every real number $t$. Prove that there exists a positive integer $k$ such that $P(x, y) = (x^2 + y^2)^k$.

If $3a=1+\sqrt 2$, what is the largest integer not exceeding $9a^4-6a^3+8a^2-6a+9$? $ \textbf{(A)}\ 8 \qquad\textbf{(B)}\ 9 \qquad\textbf{(C)}\ 10 \qquad\textbf{(D)}\ 12 \qquad\textbf{(E)}\ \text{None of the preceding} $

Denote by $ \mathcal{H}$ a set of sequences $ S\equal{}\{s_n\}_{n\equal{}1}^{\infty}$ of real numbers having the following properties: (i) If $ S\equal{}\{s_n\}_{n\equal{}1}^{\infty}\in \mathcal{H}$, then $ S'\equal{}\{s_n\}_{n\equal{}2}^{\infty}\in \mathcal{H}$; (ii) If $ S\equal{}\{s_n\}_{n\equal{}1}^{\infty}\in \mathcal{H}$ and $ T\equal{}\{t_n\}_{n\equal{}1}^{\infty}$, then $ S\plus{}T\equal{}\{s_n\plus{}t_n\}_{n\equal{}1}^{\infty}\in \mathcal{H}$ and $ ST\equal{}\{s_nt_n\}_{n\equal{}1}^{\infty}\in \mathcal{H}$; (iii) $ \{\minus{}1,\minus{}1,\dots,\minus{}1,\dots\}\in \mathcal{H}$. A real valued function $ f(S)$ defined on $ \mathcal{H}$ is called a quasi-limit of $ S$ if it has the following properties: If $ S\equal{}{c,c,\dots,c,\dots}$, then $ f(S)\equal{}c$; If $ s_i\geq 0$, then $ f(S)\geq 0$; $ f(S\plus{}T)\equal{}f(S)\plus{}f(T)$; $ f(ST)\equal{}f(S)f(T)$, $ f(S')\equal{}f(S)$ Prove that for every $ S$, the quasi-limit $ f(S)$ is an accumulation point of $ S$.

Let $a_1, a_2, \dots, a_{2019}$ be positive integers and $P$ a polynomial with integer coefficients such that, for every positive integer $n$, $$P(n) \text{ divides } a_1^n+a_2^n+\dots+a_{2019}^n.$$ Prove that $P$ is a constant polynomial.

Let $P (n)$ and $Q (n)$ be two polynomials (not constant) whose coefficients are integers not negative. For each positive integer $n$, define $x_n = 2016^{P (n)} + Q (n)$. Prove that there exist infinite primes $p$ for which there is a positive integer $m$, squarefree, such that $p | x_m$. Clarification: A positive integer is squarefree if it is not divisible by the square of any prime number.

Prove that there is a polynomial $P(x)$ with integer coefficients such that for all $x$ in the interval $\left[ \frac{1}{10} , \frac{9}{10}\right]$ we have $$\left|P(x) -\frac12 \right| < \frac{ 1}{1000 }.$$