Find all polynomials $P(x)$ with real coefficients such that \[(x-2010)P(x+67)=xP(x) \] for every integer $x$.

Show that for every polynomial $W$ in three variables there exist polynomials $U$ and $V$ such that: $$W(x,y,z) = U(x,y,z)+V(x,y,z),$$ $$U(x,y,z) = U(y,x,z),$$ $$V(x,y,z) = -V(x,z,y).$$

Let $P,Q,R,S$ be non constant polynomials with real coefficients, such that $P(Q(x))=R(S(x)) $ and the degree of $P$ is multiple of the degree of $R. $ Prove that there exists a polynomial $T$ with real coefficients such that $$\displaystyle P(x)=R(T(x))$$

Is it possible to find a set $A$ of eleven positive integers such that no six elements of $A$ have a sum which is divisible by $6$?

If $p(x)=a_{0}+a_{1} x+\cdots+a_{m} x^{m}$ is a polynomial with real coefficients $a_{i},$ then set $$ \Gamma(p(x))=a_{0}^{2}+a_{1}^{2}+\cdots+a_{m}^{2}. $$ Let $F(x)=3 x^{2}+7 x+2 .$ Find, with proof, a polynomial $g(x)$ with real coefficients such that (i) $g(0)=1,$ and (ii) $\Gamma\left(f(x)^{n}\right)=\Gamma\left(g(x)^{n}\right)$ for every integer $n \geq 1.$

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

Prove that for $ n > 0$ and $ a\neq0$ the polynomial $ p(z) \equal{} az^{2n \plus{} 1} \plus{} bz^{2n} \plus{} \bar bz \plus{} \bar a$ has a root on unit circle

Determine all positive integers $n$ for which there exists a polynomial $p(x)$ of degree $n$ with integer coefficients such that it takes the value $n$ in $n$ distinct integer points and takes the value $0$ at point $0$.

For all positive numbers $x,y,z$ the product $(x+y+z)^{-1}(x^{-1}+y^{-1}+z^{-1})(xy+yz+xz)^{-1}[(xy)^{-1}+(yz)^{-1}+(xz)^{-1}]$ equals $\text{(A)}\ x^{-2}y^{-2}z^{-2} \qquad \text{(B)}\ x^{-2}+y^{-2}+z^{-2} \qquad \text{(C)}\ (x+y+z)^{-1}$ $\text{(D)}\ \frac{1}{xyz} \qquad \text{(E)}\ \frac{1}{xy+yz+xz}$

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

a) $P(x),R(x)$ are polynomials with rational coefficients and $P(x)$ is not the zero polynomial. Prove that there exist a non-zero polynomial $Q(x)\in\mathbb Q[x]$ that \[P(x)\mid Q(R(x)).\] b) $P,R$ are polynomial with integer coefficients and $P$ is monic. Prove that there exist a monic polynomial $Q(x)\in\mathbb Z[x]$ that \[P(x)\mid Q(R(x)).\]

The roots of the equation $x^2+4x-5 = 0$ are also the roots of the equation $2x^3+9x^2-6x-5 = 0$. What is the third root of the second equation?

Consider all polynomials of a complex variable, $P(z)=4z^4+az^3+bz^2+cz+d$, where $a, b, c$ and $d$ are integers, $0 \le d \le c \le b \le a \le 4$, and the polynomial has a zero $z_0$ with $|z_0|=1$. What is the sum of all values $P(1)$ over all the polynomials with these properties? $ \textbf{(A)}\ 84\qquad\textbf{(B)}\ 92\qquad\textbf{(C)}\ 100\qquad\textbf{(D)}\ 108 \qquad\textbf{(E)}\ 120 $

Show that no one $n$-th root of a rational (for $n$ a positive integer) can be a root of the polynomial $x^5 - x^4 - 4x^3 + 4x^2 + 2$.

Let $a$, $b$, $c$ be real numbers greater than or equal to $1$. Prove that \[ \min \left(\frac{10a^2-5a+1}{b^2-5b+10},\frac{10b^2-5b+1}{c^2-5c+10},\frac{10c^2-5c+1}{a^2-5a+10}\right )\leq abc. \]

A monic quadratic polynomial $f$ with integer coefficients attains prime values at three consecutive integer points.show that it attains a prime value at some other integer point as well.

Consider the set $ M = \{1,2, \ldots ,2008\}$. Paint every number in the set $ M$ with one of the three colors blue, yellow, red such that each color is utilized to paint at least one number. Define two sets: $ S_1=\{(x,y,z)\in M^3\ \mid\ x,y,z\text{ have the same color and }2008 | (x + y + z)\}$; $ S_2=\{(x,y,z)\in M^3\ \mid\ x,y,z\text{ have three pairwisely different colors and }2008 | (x + y + z)\}$. Prove that $ 2|S_1| > |S_2|$ (where $ |X|$ denotes the number of elements in a set $ X$).

For which quadratic polynomials $f(x)$ does there exist a quadratic polynomial $g(x)$ such that the equations $g(f(x)) = 0$ and $f(x)g(x) = 0$ have the same roots, which are mutually distinct and form an arithmetic progression?

Suppose $x_1, x_2, x_3$ are the roots of polynomial $P(x) = x^3 - 6x^2 + 5x + 12$ The sum $|x_1| + |x_2| + |x_3|$ is (A): $4$ (B): $6$ (C): $8$ (D): $14$ (E): None of the above.

Let $a,b,c,d$ real numbers such that $a+b+c+d=19$ and $a^2+b^2+c^2+d^2=91$. Find the maximum value of \[ \frac{1}{a} +\frac{1}{b} +\frac{1}{c} +\frac{1}{d} \]

Let $n\ge 2$ be an even integer and $a,b$ real numbers such that $b^n=3a+1$. Show that the polynomial $P(X)=(X^2+X+1)^n-X^n-a$ is divisible by $Q(X)=X^3+X^2+X+b$ if and only if $b=1$.

Polynomial $w(x)$ of second degree with integer coefficients takes for integer arguments values, which are squares of integers. Prove that polynomial $w(x)$ is a square of a polynomial.

Prove that the polynomial $P (x) = (x^2- 8x + 25) (x^2 - 16x + 100) ... (x^2 - 8nx + 25n^2)- 1$, $n \in N^*$, cannot be written as the product of two polynomials with integer coefficients of degree greater or equal to $1$.

Let $ S$ be a finite set of points in the plane such that no three of them are on a line. For each convex polygon $ P$ whose vertices are in $ S$, let $ a(P)$ be the number of vertices of $ P$, and let $ b(P)$ be the number of points of $ S$ which are outside $ P$. A line segment, a point, and the empty set are considered as convex polygons of $ 2$, $ 1$, and $ 0$ vertices respectively. Prove that for every real number $ x$ \[\sum_{P}{x^{a(P)}(1 \minus{} x)^{b(P)}} \equal{} 1,\] where the sum is taken over all convex polygons with vertices in $ S$. [i]Alternative formulation[/i]: Let $ M$ be a finite point set in the plane and no three points are collinear. A subset $ A$ of $ M$ will be called round if its elements is the set of vertices of a convex $ A \minus{}$gon $ V(A).$ For each round subset let $ r(A)$ be the number of points from $ M$ which are exterior from the convex $ A \minus{}$gon $ V(A).$ Subsets with $ 0,1$ and 2 elements are always round, its corresponding polygons are the empty set, a point or a segment, respectively (for which all other points that are not vertices of the polygon are exterior). For each round subset $ A$ of $ M$ construct the polynomial \[ P_A(x) \equal{} x^{|A|}(1 \minus{} x)^{r(A)}. \] Show that the sum of polynomials for all round subsets is exactly the polynomial $ P(x) \equal{} 1.$ [i]Proposed by Federico Ardila, Colombia[/i]

For any positive integer $ n$, prove that there exists a polynomial $ P$ of degree $ n$ such that all coeffients of this polynomial $ P$ are integers, and such that the numbers $ P\left(0\right)$, $ P\left(1\right)$, $ P\left(2\right)$, ..., $ P\left(n\right)$ are pairwisely distinct powers of $ 2$.