A triplet of polynomials $u,v,w \in \mathbb{R}[x,y,z]$ is called [i]smart[/i] if there exists polynomials $P,Q,R\in \mathbb{R}[x,y,z]$ such that the following polynomial identity holds :$$u^{2019}P +v^{2019 }Q+w^{2019} R=2019$$ a) Is the triplet of polynomials $$u=x+2y+3 , \;\;\;\; v=y+z+2, \;\;\;\;\;w=x+y+z$$ [i]smart[/i]? b) Is the triplet of polynomials $$u=x+2y+3 , \;\;\;\; v=y+z+2, \;\;\;\;\;w=x+y-z$$ [i]smart[/i]? [i]Proposed by Arturas Dubickas (Vilnius University). [/i]

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?

Let $P(x)$ be a polynomial of degree $n$ such that $P(x)=Q(x)P^{\prime\prime}(x)$, where $Q(x)$ is a quadratic polynomial and $P^{\prime\prime}(x)$ is the second derivative of $P(x)$. Show that if $P(x)$ has at least two distinct roots then it must have $n$ distinct roots.

Find all polynomials $Q(x)= ax^2+bx+c$ with integer coefficients for which there exist three different prime numbers $p_1, p_2, p_3$ such that $|Q(p_1)| = |Q(p_2)| = |Q(p_3)| = 11$.

Let $P(x)=x^{2000}-x^{1000}+1$. Prove that there don't exist 8002 distinct positive integers $a_1,\dots,a_{8002}$ such that $a_ia_ja_k|P(a_i)P(a_j)P(a_k)$ for all $i\neq j\neq k$. [I]Proposed by A. Baranov[/i]

Let $n > 1$ be an integer. In a circular arrangement of $n$ lamps $L_0, \ldots, L_{n-1},$ each of of which can either ON or OFF, we start with the situation where all lamps are ON, and then carry out a sequence of steps, $Step_0, Step_1, \ldots .$ If $L_{j-1}$ ($j$ is taken mod $n$) is ON then $Step_j$ changes the state of $L_j$ (it goes from ON to OFF or from OFF to ON) but does not change the state of any of the other lamps. If $L_{j-1}$ is OFF then $Step_j$ does not change anything at all. Show that: (i) There is a positive integer $M(n)$ such that after $M(n)$ steps all lamps are ON again, (ii) If $n$ has the form $2^k$ then all the lamps are ON after $n^2-1$ steps, (iii) If $n$ has the form $2^k + 1$ then all lamps are ON after $n^2 - n + 1$ steps.

Does there exist functions $ f,g: \mathbb{R}\to\mathbb{R}$ such that $ f(g(x)) \equal{} x^2$ and $ g(f(x)) \equal{} x^k$ for all real numbers $ x$ a) if $ k \equal{} 3$? b) if $ k \equal{} 4$?

A polynomial $P(x,y)$ with integer coefficients satisfies two following conditions: 1. for every integer $a$ there exists exactly one integer $y$, such that $P(a,y)=0$ 2. for every integer $b$ there exists exactly one integer $x$, such that $P(x,b)=0$ a) Prove that if the degree of $P$ is $2$, then it is divisible by either $x-y+C$ for some integer $C$, or $x+y+C$ for some integer $C$ b) Is there a polynomial $P$ that isn't divisible by any of $x-y+C$ or $x+y+C$ for integers $C$?

Determine if there exist four polynomials such that the sum of any three of them has a real root while the sum of any two of them does not.

Denote by $P(n)$ the greatest prime divisor of $n$. Find all integers $n\geq 2$ for which \[P(n)+\lfloor\sqrt{n}\rfloor=P(n+1)+\lfloor\sqrt{n+1}\rfloor\]

Suppose that $x^3-x+10^{-6}=0$. Suppose that $x_1<x_2<x_3$ are the solutions for $x$. Find the integers $(a,b,c)$ closest to $10^8x_1$, $10^8x_2$, and $10^8x_3$ respectively.

Let $p$ and $q$ be integers. Show that there exists an interval $I$ of length $1/q$ and a polynomial $P$ with integral coefficients such that \[ \left|P(x)-\frac pq \right| < \frac{1}{q^2}\]for all $x \in I.$

Consider $n$ lamps clockwise numbered from $1$ to $n$ on a circle. Let $\xi$ to be a configuration where $0 \le \ell \le n$ random lamps are turned on. A [i]cool procedure[/i] consists in perform, simultaneously, the following operations: for each one of the $\ell$ lamps which are turned on, we verify the number of the lamp; if $i$ is turned on, a [i]signal[/i] of range $i$ is sent by this lamp, and it will be received only by the next $i$ lamps which follow $i$, turned on or turned off, also considered clockwise. At the end of the operations we verify, for each lamp, turned on or turned off, how many signals it has received. If it was reached by an even number of signals, it remains on the same state(that is, if it was turned on, it will be turned on; if it was turned off, it will be turned off). Otherwise, it's state will be changed. The example in attachment, for $n=4$, ilustrates a configuration where lamps $2$ and $4$ are initially turned on. Lamp $2$ sends signal only for the lamps $3$ e $4$, while lamp $4$ sends signal for lamps $1$, $2$, $3$ e $4$. Therefore, we verify that lamps $1$ e $2$ received only one signal, while lamps $3$ e $4$ received two signals. Therefore, in the next configuration, lamps $1$ e $4$ will be turned on, while lamps $2$ e $3$ will be turned off. Let $\Psi$ to be the set of all $2^n$ possible configurations, where $0 \le \ell \le n$ random lamps are turned on. We define a function $f: \Psi \rightarrow \Psi$ where, if $\xi$ is a configuration of lamps, then $f(\xi)$ is the configurations obtained after we perform the [i]cool procedure[/i] described above. Determine all values of $n$ for which $f$ is bijective.

Is it true that for any polynomial $P(x)$ with real coefficients of degree $2023$, there exists a natural number $n$ such that the equation $P(x) = n^{-100}$ has no rational root?

[b]7.[/b] Let $V$ be a finite-dimensional subspace of $C[0,1]$ such that every nonzero $f\in V$ attains positive value at some point. Prove that there exists a polynomial $P$ that is strictly positive on $[0,1]$ and orthogonal to $V$, that is, for every $f \in V$, $\int_{0}^{1} f(x)P(x)dx =0$ ([b]F.39[/b]) [A. Pinkus, V. Totik]

Let $p=4k+3$ be a prime. Prove that if \[\dfrac {1} {0^2+1}+\dfrac{1}{1^2+1}+\cdots+\dfrac{1}{(p-1)^2+1}=\dfrac{m} {n}\] (where the fraction $\dfrac {m} {n}$ is in reduced terms), then $p \mid 2m-n$. [i]Proposed by A. Golovanov[/i]

If $R_n=\frac{1}{2}(a^n+b^n)$ where $a=3+2\sqrt{2}$, $b=3-2\sqrt{2}$, and $n=0,1,2, ...,$ then $R_{12345}$ is an integer. Its units digit is $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 9 $

Math teacher wrote in a table a polynomial $P(x)$ with integer coefficients and he said: "Today my daughter have a birthday.If in polynomial $P(x)$ we have $x=a$ where $a$ is the age of my daughter we have $P(a)=a$ and $P(0)=p$ where $p$ is a prime number such that $p>a$." How old is the daughter of math teacher?

Prove that the polynomial $ x^3 + x + 1 $ is a factor of the polynomial $ P_n(x) = x^{n + 2} + (x+1)^{2n+1} $ for every integer $ n \geq 0 $.

Prove that the polynomial $x^{200} y^{200} +1$ cannot be represented in the form $f(x)g(y)$, where $f$ and $g$ are polynomials of only $x$ and $y$, respectively.

Let $ p$ be a prime number and $ f$ an integer polynomial of degree $ d$ such that $ f(0) = 0,f(1) = 1$ and $ f(n)$ is congruent to $ 0$ or $ 1$ modulo $ p$ for every integer $ n$. Prove that $ d\geq p - 1$.

For each positive integer $n$, define $H_n(x)=(-1)^ne^{x^2}\frac{d^n}{dx^n}e^{-x^2}.$ (1) Find $H_1(x),\ H_2(x),\ H_3(x)$. (2) Express $\frac{d}{dx}H_n(x)$ interms of $H_n(x),\ H_{n+1}(x).$ Then prove that $H_n(x)$ is a polynpmial with degree $n$ by induction. (3) Let $a$ be real number. For $n\geq 3$, express $S_n(a)=\int_0^a xH_n(x)e^{-x^2}dx$ in terms of $H_{n-1}(a),\ H_{n-2}(a),\ H_{n-2}(0)$. (4) Find $\lim_{a\to\infty} S_6(a)$. If necessary, you may use $\lim_{x\to\infty}x^ke^{-x^2}=0$ for a positive integer $k$.

Is it true that for $\forall$ prime number $p$, there exist non-constant polynomials $P$ and $Q$ with $P,Q\in \mathbb{Z} [x]$ for which the remainder modulo $p$ of the coefficient in front of $x^n$ in the product $PQ$ is 1 for $n=0$ and $n=4$; $p-2$ for $n=2$ and is 0 for all other $n\geq 0$?

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

Find all polynomials $P\in \mathbb C[X]$ such that \[P(X^{2})=P(X)^{2}+2P(X)\]