Let $P,Q,R$ be the polynomials with real or complex coefficients such that at least one of them is not constant. If $P^n+Q^n+R^n = 0$, prove that $n < 3.$

Prove that if a quadratic equation $$ ax^2 + bx + c = 0$$ with integer coefficients has a rational root, then at least one of the numbers $ a $, $ b $, $ c $ is even.

Let $p(z)$ be a polynomial of degree $n>0$ with complex coefficients. Prove that there are at least $n+1$ complex numbers $z$ for which $p(z)\in \{0,1\}$.

Find all polynomials $P$ with integer coefficients such that for all positive integers $x,y$, $$\frac{P(x)-P(y)}{x^2+y^2}$$ evaluates to an integer (in particular, it can be zero).

Let $f: \mathbb{Z}^2\to \mathbb{R}$ be a function. It is known that for any integer $C$ the four functions of $x$ \[f(x,C), f(C,x), f(x,x+C), f(x, C-x)\] are polynomials of degree at most $100$. Prove that $f$ is equal to a polynomial in two variables and find its maximal possible degree. [i]Remark: The degree of a bivariate polynomial $P(x,y)$ is defined as the maximal value of $i+j$ over all monomials $x^iy^j$ appearing in $P$ with a non-zero coefficient.[/i]

A sphere is inscribed in a truncated right circular cone as shown. The volume of the truncated cone is twice that of the sphere. What is the ratio of the radius of the bottom base of the truncated cone to the radius of the top base of the truncated cone? [asy] real r=(3+sqrt(5))/2; real s=sqrt(r); real Brad=r; real brad=1; real Fht = 2*s; import graph3; import solids; currentprojection=orthographic(1,0,.2); currentlight=(10,10,5); revolution sph=sphere((0,0,Fht/2),Fht/2); //draw(surface(sph),green+white+opacity(0.5)); //triple f(pair t) {return (t.x*cos(t.y),t.x*sin(t.y),t.x^(1/n)*sin(t.y/n));} triple f(pair t) { triple v0 = Brad*(cos(t.x),sin(t.x),0); triple v1 = brad*(cos(t.x),sin(t.x),0)+(0,0,Fht); return (v0 + t.y*(v1-v0)); } triple g(pair t) { return (t.y*cos(t.x),t.y*sin(t.x),0); } surface sback=surface(f,(3pi/4,0),(7pi/4,1),80,2); surface sfront=surface(f,(7pi/4,0),(11pi/4,1),80,2); surface base = surface(g,(0,0),(2pi,Brad),80,2); draw(sback,rgb(0,1,0)); draw(sfront,rgb(.3,1,.3)); draw(base,rgb(.4,1,.4)); draw(surface(sph),rgb(.3,1,.3)); [/asy] $ \textbf {(A) } \dfrac {3}{2} \qquad \textbf {(B) } \dfrac {1+\sqrt{5}}{2} \qquad \textbf {(C) } \sqrt{3} \qquad \textbf {(D) } 2 \qquad \textbf {(E) } \dfrac {3+\sqrt{5}}{2} $

Find all fourth degree polynomial $ p(x)$ such that the following four conditions are satisfied: (i) $ p(x)\equal{}p(\minus{}x)$ for all $ x$, (ii) $ p(x)\ge0$ for all $ x$, (iii) $ p(0)\equal{}1$ (iv) $ p(x)$ has exactly two local minimum points $ x_1$ and $ x_2$ such that $ |x_1\minus{}x_2|\equal{}2$.

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

Let $p(x)$ be a polynomial with rational coefficients, of degree at least $2$. Suppose that a sequence $(r_{n})$ of rational numbers satisfies $r_{n}= p(r_{n+1})$ for every $n\geq 1$. Prove that the sequence $(r_{n})$ is periodic.

Determine all polynomials $P(x)$ with integer coefficients such that $P(n)$ is divisible by $\sigma(n)$ for all positive integers $n$. (As usual, $\sigma(n)$ denotes the sum of all positive divisors of $n$.)

$P(x)$ is a nonzero polynomial with integer coefficients. Prove that there exists infinitely many prime numbers $q$ such that for some natural number $n$, $q|2^n+P(n)$. [i]Proposed by Mohammad Gharakhani[/i]

Let $P(x)$ be a polynomial with rational coefficients such that $P(n)$ is integer for all integers $n$. Moreover: $gcd(P(1), \ldots , P(k), \ldots) = 1$. Prove that every integer $k$ can be represented in infinitely many ways of the form $\pm P(1) \pm P(2) \pm \ldots \pm P(m)$, for some positive integer $m$ and certain choices of $\pm$.

The polynomial of seven variables $$ Q(x_1,x_2,\ldots,x_7)=(x_1+x_2+\ldots+x_7)^2+2(x_1^2+x_2^2+\ldots+x_7^2) $$ is represented as the sum of seven squares of the polynomials with nonnegative integer coefficients: $$ Q(x_1,\ldots,x_7)=P_1(x_1,\ldots,x_7)^2+P_2(x_1,\ldots,x_7)^2+\ldots+P_7(x_1,\ldots,x_7)^2. $$ Find all possible values of $P_1(1,1,\ldots,1)$. [i](A. Yuran)[/i]

Given a real number $A$ and an integer $n$ with $2 \leq n \leq 19$, find all polynomials $P(x)$ with real coefficients such that $P(P(P(x))) = Ax^n +19x+99$.

Is there a triangle with angles in ratio of $ 1: 2: 4$ and the length of its sides are integers with at least one of them is a prime number? [i]Nanang Susyanto, Jogjakarta[/i]

The polynomial $P(X)$ is defined by $P(X)=(X+2X^{2}+\ldots +nX^{n})^{2}=a_{0}+a_{1}X+\ldots +a_{2n}X^{2n}$. Prove that $a_{n+1}+a_{n+2}+\ldots +a_{2n}=\frac{n(n+1)(5n^{2}+5n+2)}{24}$.

Let $a_1, a_2, \cdots, a_k$ be natural numbers. Let $S(n)$ be the number of solutions in nonnegative integers to $a_1x_1 + a_2x_2 + \cdots + a_kx_k = n$. Suppose $S(n) \neq 0$ for all big enough $n$. Show that for all sufficiently large $n$, we have $S(n+1) < 2S(n)$.

Find all polynomials $f$ such that $f$ has non-negative integer coefficients, $f(1)=7$ and $f(2)=2017$.

If $f$ is a polynomial, and $f(-2)=3$, $f(-1)=-3=f(1)$, $f(2)=6$, and $f(3)=5$, then what is the minimum possible degree of $f$?

Let the real numbers be $a, b, c, d$ with $a \ge b$ and $c \ge d$. Prove that the equation $$(x + a) (x + d) + (x + b) (x + c) = 0$$ has real roots.

Let $W(x)$ be a polynomial of integer coefficients such that for any pair of different rational number $r_1$, $r_2$ dependence $W(r_1) \neq W(r_2)$ is true. Decide, whether the assuptions imply that for any pair of different real numbers $t_1$, $t_2$ dependence $W(t_1) \neq W(t_2)$ is true.

Let $A_1A_2A_3A_4$ be a non-cyclic quadrilateral. Let $O_1$ and $r_1$ be the circumcentre and the circumradius of the triangle $A_2A_3A_4$. Define $O_2,O_3,O_4$ and $r_2,r_3,r_4$ in a similar way. Prove that \[\frac{1}{O_1A_1^2-r_1^2}+\frac{1}{O_2A_2^2-r_2^2}+\frac{1}{O_3A_3^2-r_3^2}+\frac{1}{O_4A_4^2-r_4^2}=0.\] [i]Proposed by Alexey Gladkich, Israel[/i]

Real numbers $x_1, x_2, x_3, x_4$ are roots of the fourth degree polynomial $W (x)$ with integer coefficients. Prove that if $x_3 + x_4$ is a rational number and $x_3x_4$ is a irrational number, then $x_1 + x_2 = x_3 + x_4$.

Let $n, \in \mathbb {N^*} , n\ge 3$ a) Prove that the polynomial $f (x)=\frac {X^{2^n-1}-1}{X-1}-X^n $ has a divisor of form $X^p +1$ where $p\in\mathbb {N^*} $ b) Show that for $n=7$ the polynomial $f (X) $ has three divisors with integer coefficients .

$x$ and $y$ are positive and relatively prime and $z$ is an integer. They satisfy $(5z-4x)(5z-4y)=25xy$. Show that at least one of $10z+x+y$ or quotient of this number divided by $3$ is a square number (i.e. prove that $10z+x+y$ or integer part of $\frac{10z+x+y}{3}$ is a square number).