Prove that $ \forall n > 1, n \in \mathbb{N}$ the equation \[ \sum^n_{k\equal{}1} \frac{x^k}{k!} \plus{} 1 \equal{} 0\] has no rational roots.

Find all polynomials $P$ with real coefficients such that $$\frac{P(x)}{yz}+\frac{P(y)}{zx}+\frac{P(z)}{xy}=P(x-y)+P(y-z)+P(z-x)$$ holds for all nonzero real numbers $x,y,z$ satisfying $2xyz=x+y+z$. [i]Proposed by Titu Andreescu and Gabriel Dospinescu[/i]

Let $A=\left( \begin{array}{ccc} 1 & 1& 0 \\ 0 & 1& 0 \\ 0 &0 & 2 \end{array} \right),\ B=\left( \begin{array}{ccc} a & 1& 0 \\ b & 2& c \\ 0 &0 & a+1 \end{array} \right)\ (a,\ b,\ c\in{\mathbb{C}}).$ (1) Find the condition for $a,\ b,\ c$ such that ${\text{rank} (AB-BA})\leq 1.$ (2) Under the condition of (1), find the condition for $a,\ b,\ c$ such that $B$ is diagonalizable.

The sequence $a_n$ is defined by $a_0=a_1=1$ and $a_{n+1}=14a_n-a_{n-1}-4$,for all positive integers $n$. Prove that all terms of this sequence are perfect squares.

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]

Let $p$ be a prime number. Let $\mathbb F_p$ denote the integers modulo $p$, and let $\mathbb F_p[x]$ be the set of polynomials with coefficients in $\mathbb F_p$. Define $\Psi : \mathbb F_p[x] \to \mathbb F_p[x]$ by \[ \Psi\left( \sum_{i=0}^n a_i x^i \right) = \sum_{i=0}^n a_i x^{p^i}. \] Prove that for nonzero polynomials $F,G \in \mathbb F_p[x]$, \[ \Psi(\gcd(F,G)) = \gcd(\Psi(F), \Psi(G)). \] Here, a polynomial $Q$ divides $P$ if there exists $R \in \mathbb F_p[x]$ such that $P(x) - Q(x) R(x)$ is the polynomial with all coefficients $0$ (with all addition and multiplication in the coefficients taken modulo $p$), and the gcd of two polynomials is the highest degree polynomial with leading coefficient $1$ which divides both of them. A non-zero polynomial is a polynomial with not all coefficients $0$. As an example of multiplication, $(x+1)(x+2)(x+3) = x^3+x^2+x+1$ in $\mathbb F_5[x]$. [i]Proposed by Mark Sellke[/i]

Let define $P_{n}(x)=x^{n-1}+x^{n-2}+x^{n-3}+ \dots +x+1$ for every positive integer $n$. Prove that for every positive integer $a$ one can find a positive integer $n$ and polynomials $R(x)$ and $Q(x)$ with integer coefficients such that \[P_{n}(x)= [1+ax+x^{2}R(x)] Q(x).\]

Let $P(z)= z^n + c_1 z^{n-1} + c_2 z^{n-2} + \cdots + c_n$ be a polynomial in the complex variable $z$, with real coefficients $c_k$. Suppose that $|P(i)| < 1$. Prove that there exist real numbers $a$ and $b$ such that $P(a + bi) = 0$ and $(a^2 + b^2 + 1)^2 < 4 b^2 + 1$.

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}$.