$p(x)$ is the cubic $x^3 - 3x^2 + 5x$. If $h$ is a real root of $p(x) = 1$ and $k$ is a real root of $p(x) = 5$, find $h + k$.

For real numbers $x_i$, the statement \[ x_1 + x_2 + x_3 = 0 \Rightarrow x_1x_2 + x_2x_3 + x_3x_1 \leq 0\] is always true. (Prove!) For which $n\geq 4$ integers, the statement \[x_1 + x_2 + \dots + x_n = 0 \Rightarrow x_1x_2 + x_2x_3 + \dots + x_{n-1}x_n + x_nx_1 \leq 0\] is always true. Justify your answer.

$P(x)$ is a nonconstant polynomial with real coefficients and its all roots are real numbers. If there exist a $Q(x)$ polynomial with real coefficients that holds the equality for all $x$ real numbers $(P(x))^{2}=P(Q(x))$, then prove that all the roots of $P(x)$ are same.

How many pairs of $2007$-digit numbers $\underline{a_1a_2}\cdots\underline{a_{2007}}$ and $\underline{b_1b_2}\cdots\underline{b_{2007}}$ are there such that $a_1b_1+a_2b_2+\cdots+a_{2007}b_{2007}$ is even? Express your answer as $a \** b^c + d \** e^f$ for integers $a$, $b$, $c$, $d$, $e$, and $f$ with $a \nmid b$ and $d \nmid e$.

Let $P (x)$ be a non constant integer polynomial and positive integer $n$. The sequence $a_0, a_1, ...$ is defined by $a_0 = n$ and $a_k = P (a_{k-1})$ for $k \ge 1$. Given that for each positive integer $b$, the sequence contains a $b$-th power of some positive integer greater than $1$. Prove that deg $P = 1$

Prove that the equation $ x^{5} \plus{} 31 \equal{} y^{2}$ has no integer solution.

Let $A$ be a set of polynomials with real coefficients and let them satisfy the following conditions: [b](i)[/b] if $f \in A$ and $\deg( f ) \leq 1$, then $f(x) = x - 1$; [b](ii)[/b] if $f \in A$ and $\deg( f ) \geq 2$, then either there exists $g \in A$ such that $f(x) = x^{2+\deg(g)} + xg(x) -1$ or there exist $g, h \in A$ such that $f(x) = x^{1+\deg(g)}g(x) + h(x)$; [b](iii)[/b] for every $g, h \in A$, both $x^{2+\deg(g)} + xg(x) -1$ and $x^{1+\deg(g)}g(x) + h(x)$ belong to $A.$ Let $R_n(f)$ be the remainder of the Euclidean division of the polynomial $f(x)$ by $x^n$. Prove that for all $f \in A$ and for all natural numbers $n \geq 1$ we have $R_n(f)(1) \leq 0$, and that if $R_n(f)(1) = 0$ then $R_n(f) \in A$.

Let $\mathcal{A}$ denote the set of all polynomials in three variables $x, y, z$ with integer coefficients. Let $\mathcal{B}$ denote the subset of $\mathcal{A}$ formed by all polynomials which can be expressed as \begin{align*} (x + y + z)P(x, y, z) + (xy + yz + zx)Q(x, y, z) + xyzR(x, y, z) \end{align*} with $P, Q, R \in \mathcal{A}$. Find the smallest non-negative integer $n$ such that $x^i y^j z^k \in \mathcal{B}$ for all non-negative integers $i, j, k$ satisfying $i + j + k \geq n$.

Consider the equation $ x^4 \minus{} 4x^3 \plus{} 4x^2 \plus{} ax \plus{} b \equal{} 0$, where $ a,b\in\mathbb{R}$. Determine the largest value $ a \plus{} b$ can take, so that the given equation has two distinct positive roots $ x_1,x_2$ so that $ x_1 \plus{} x_2 \equal{} 2x_1x_2$.

Sum of the roots in the range $\left(-\frac{\pi}{2},\frac{\pi}{2} \right)$ of the equation $\sin x\tan x=x^2$ is [list=1] [*] $\frac{\pi}{2}$ [*] 0 [*] 1 [*] None of these [/list]

Consider all polynomials $P(x)$ with real coefficients that have the following property: for any two real numbers $x$ and $y$ one has \[|y^2-P(x)|\le 2|x|\quad\text{if and only if}\quad |x^2-P(y)|\le 2|y|.\] Determine all possible values of $P(0)$. [i]Proposed by Belgium[/i]

Let $ P (x) $ and $ Q (x) $ be polynomials with real coefficients such that $ P (0)> 0 $ and all coefficients of the polynomial $ S (x) = P (x) \cdot Q (x) $ are integers. Prove that for any positive $ x $ the inequality holds: $$S ({{x} ^ {2}}) - {{S} ^ {2}} (x) \le \frac {1} {4} ({{P} ^ {2}} ({{ x} ^ {3}}) + Q ({{x} ^ {3}})). $$

Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.

Let $n$ be the number of polynomial functions from the integers modulo $2010$ to the integers modulo $2010$. $n$ can be written as $n = p_1 p_2 \cdots p_k$, where the $p_i$s are (not necessarily distinct) primes. Find $p_1 + p_2 + \cdots + p_n$.

For each $n \ge 2$ define the polynomial $$f_n(x)=x^n-x^{n-1}-\dots-x-1.$$ Prove that (a) For each $n \ge 2$, $f_n(x)=0$ has a unique positive real root $\alpha_n$; (b) $(\alpha_n)_n$ is a strictly increasing sequence; (c) $\lim_{n \rightarrow \infty} \alpha_n=2.$

Assume that the polynomial $\left(x+1\right)^n-1$ is divisible by some polynomial $P\left(x\right)=x^k+c_{k-1}x^{k-1}+c_{k-2}x^{k-2}+...+c_1x+c_0$, whose degree $k$ is even and whose coefficients $c_{k-1}$, $c_{k-2}$, ..., $c_1$, $c_0$ all are odd integers. Show that $k+1\mid n$.

For a non-constant polynomial $P(x)=a_{n} x^{n}+a_{n-1} x^{n-1}+\ldots+a_{1} x+a_{0} \in \mathbb{R}[x], a_{n} \neq 0, n \in \mathbb{N}$, we say that $P$ is symmetric if $a_{k}=a_{n-k}$ for every $k=0,1, \ldots,\left\lceil\frac{n}{2}\right\rceil$. We define the weight of a non-constant polynomial $P \in \mathbb{R}[x]$, denoted by $t(P)$, as the multiplicity of its zero with the highest multiplicity. a) Prove that there exist non-constant, monic, pairwise distinct polynomials $P_{1}, P_{2}, \ldots, P_{2021} \in \mathbb{R}[x]$, none of which is symmetric, such that the product of any two (distinct) polynomials is symmetric. b) What is the smallest possible value of $t\left(P_{1} \cdot P_{2} \cdot \ldots \cdot P_{2021}\right)$, if $P_{1}, P_{2}, \ldots, P_{2021} \in \mathbb{R}[x]$ are non-constant, monic, pairwise distinct polynomials, none of which is symmetric, and the product of any two (distinct) polynomials is symmetric?

Let $P$ be a polynomial of degree $n$ with only real zeros and real coefficients. Prove that for every real $x$ we have $(n-1)(P'(x))^2\ge nP(x)P''(x)$. When does equality occur?

On Christmas Eve, 1983, Dean Jixon, the famous seer who had made startling predictions of the events of the preceding year that the volcanic and seismic activities of $1980$ and $1981$ were connected with mathematics. The diminishing of this geological activity depended upon the existence of an elementary proof of the irreducibility of the polynomial \[P(x)=x^{1981}+x^{1980}+12x^{2}+24x+1983.\] Is there such a proof?

Determine the pairs of sets $X,Y\subset\mathbb{R}$ for which the following is true: if $f(x, y)$ is a function on $X\times Y{}$ such that for every $x\in X$ it is equal to a polynomial in $y$ on $Y$ and for every $y\in Y$ it is equal to a polynomial in $x$ on $X$ then $f$ is a bivariate polynomial on $X\times Y.$

Find all pairs of real numbers $(a,b)$ so that there exists a polynomial $P(x)$ with real coefficients and $P(P(x))=x^4-8x^3+ax^2+bx+40$.

Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.

Let $f(x)$ and $g(x)$ be two polynomials with real coefficients such that for infinitely many rational values of $x$, the fraction $\frac{f(x)}{g(x)}$ is rational. Prove that $\frac{f(x)}{g(x)}$ can be written as the ratio of two polynomials with rational coefficients.

The polynomial $ P(x)\equal{}x^3\plus{}ax^2\plus{}bx\plus{}d$ has three distinct real roots. The polynomial $ P(Q(x))$, where $ Q(x)\equal{}x^2\plus{}x\plus{}2001$, has no real roots. Prove that $ P(2001)>\frac{1}{64}$.

Determine all polynomials $P(x)$ with real coefficients and which satisfy the following properties: i) $P(0) = 1$ ii) for any real numbers $x$ and $y,$ \[|y^2-P(x)|\le 2|x|\quad\text{if and only if}\quad |x^2-P(y)|\le 2|y|.\]