Find all injective $f:\mathbb{Z}\ge0 \to \mathbb{Z}\ge0 $ that for every natural number $n$ and real numbers $a_0,a_1,...,a_n$ (not everyone equal to $0$), polynomial $\sum_{i=0}^{n}{a_i x^i}$ have real root if and only if $\sum_{i=0}^{n}{a_i x^{f(i)}}$ have real root. [i]Proposed by Hesam Rajabzadeh [/i]

Find all polynomials $f$ that satisfy the equation \[\frac{f(3x)}{f(x)} = \frac{729 (x-3)}{x-243}\] for infinitely many real values of $x$.

For any positive integer $k$, denote the sum of digits of $k$ in its decimal representation by $S(k)$. Find all polynomials $P(x)$ with integer coefficients such that for any positive integer $n \geq 2016$, the integer $P(n)$ is positive and $$S(P(n)) = P(S(n)).$$ [i]Proposed by Warut Suksompong, Thailand[/i]

Let $P(x)$ be a polynomial of degree $n \le 10$ with integral coefficients such that for every $k \in \{1, 2, \dots, 10\}$ there is an integer $m$ with $P(m) = k$. Furthermore, it is given that $|P(10) - P(0)| < 1000$. Prove that for every integer $k$ there is an integer $m$ such that $P(m) = k.$

[b]Problem 3[/b] Let $ P(x) = x^{2015} -2x^{2014}+1$ and $ Q(x) = x^{2015} -2x^{2014}-1$. Determine for each of the polynomials $P$ and $Q$ whether it is a divisor of some nonzero polynomial $c_0 + c_{1}x +\ldots + c_{n}x^n$ n whose coefficients $c_i$ are all in the set $ \{ -1, 1\}$.

Find all nonzero polynomials $P(x)$ with integers coefficients that satisfy the following property: whenever $a$ and $b$ are relatively prime integers, then $P(a)$ and $P(b)$ are relatively prime as well. Prove that your answer is correct. (Two integers are [b]relatively prime[/b] if they have no common prime factors. For example, $-70$ and $99$ are relatively prime, while $-70$ and $15$ are not relatively prime.)

The Young Scientist and the Old Scientist play the following game, taking turns in an alternating fashion, with the Young Scientist starting first. The player on turn fills in one of the stars in the equation \[ x^4 + *x^3 + *x^2 + *x + * = 0 \] with a positive real number. Who has a winning strategy if the goals of the players are: a) the Young Scientist - to make the resulting equation have no real roots, and the Old Scientist -- to make it have real roots? b) the Young Scientist - to make the resulting equation have real roots, and the Old Scientist -- to make it have none?

Given a prime $p$, show that there exist two integers $a, b$ which satisfies the following. For all integers $m$, $m^3+ 2017am+b$ is not a multiple of $p$.

Let $$P(x)=a_0x^n+a_1x^{n-1}+\ldots+a_n$$ where $a_0,\ldots,a_n$ are integers. Show that if $P$ takes the value $2020$ for four distinct integral values of $x$, then $P$ cannot take the value $2001$ for any integral value of $x$. [i]Proposed by Ángel Plaza[/i]

The graph of the degree $2021$ polynomial $P(x)$, which has real coefficients and leading coefficient $1$, meets the $x$-axis at the points $(1,0),\, (2,0),\,(3,0),\dots,\, (2020,0)$ and nowhere else. The mean of all possible values of $P(2021)$ can be written in the form $a!/b$, where $a$ and $b$ are positive integers and $a$ is as small as possible. Compute $a+b$.

Find all integer pairs $(a,b)$ such that $a\cdot b$ divides $a^2+b^2+3$.

[b]a.)[/b] For which $n>2$ is there a set of $n$ consecutive positive integers such that the largest number in the set is a divisor of the least common multiple of the remaining $n-1$ numbers? [b]b.)[/b] For which $n>2$ is there exactly one set having this property?

Let $f(x)= x^2-C$ where $C$ is a rational constant. Show that exists only finitely many rationals $x$ such that $\{x,f(x),f(f(x)),\ldots\}$ is finite

Determine all polynomials $P(x)$ with degree $n\geq 1$ and integer coefficients so that for every real number $x$ the following condition is satisfied $$P(x)=(x-P(0))(x-P(1))(x-P(2))\cdots (x-P(n-1))$$

Let $R[x]$ be the whole set of real coefficient polynomials, and define the mapping $T: R[x] \to R[x]$ as follows: For $$f (x) = a_nx^{n} + a_{n-1}x^{n- 1} +...+ a_1x + a_0,$$ let $$T(f(x))=a_{n}x^{n+1} + a_{n-1}x^{n} + (a_n+a_{n-2})x^{n-1 } + (a_{n-1}+a_{n-3})x^{n-2}+...+(a_2+a_0)x+a_1.$$ Assume $P_0(x)= 1$, $P_n(x) = T(P_{n-1}(x))$ ( $n=1,2,...$), find the constant term of $P_n(x)$.

Find all Polynomial $P(x)$ and $Q(x)$ with Integer Coefficients satisfied the equation: \[Q(a+b) = \frac{P(a) - P(b)}{a - b}\] $\forall a, b \in \mathbb{Z}^+$ and $a>b$

show that the polynomial $x^4+3x^3+6x^2+9x+12$ cannot be written as the product of 2 polynomials of degree 2 with integer coefficients.

Prove that the equation $x^{19} + x^{17} = x^{16 }+ x^7 + a$ for any $a \in R$ has at least two imaginary roots

Let $p(x)$ be the monic cubic polynomial with roots $\sin^2(1^{\circ})$, $\sin^2(3^{\circ})$, and $\sin^2(9^{\circ})$. Suppose that $p\left(\frac{1}{4}\right)=\frac{\sin(a^{\circ})}{n\sin(b^{\circ})}$, where $0 <a,b \le 90$ and $a,b,n$ are positive integers. What is $a+b+n$? [i]Proposed by Andrew Yuan[/i]

A sequence of polynomials $P_m(x, y, z), m = 0, 1, 2, \cdots$, in $x, y$, and $z$ is defined by $P_0(x, y, z) = 1$ and by \[P_m(x, y, z) = (x + z)(y + z)P_{m-1}(x, y, z + 1) - z^2P_{m-1}(x, y, z)\] for $m > 0$. Prove that each $P_m(x, y, z)$ is symmetric, in other words, is unaltered by any permutation of $x, y, z.$

If $a(x), b(x), c(x)$ and $d(x)$ are polynomials in $ x$, show that $$ \int_{1}^{x} a(x) c(x)\; dx\; \cdot \int_{1}^{x} b(x) d(x) \; dx - \int_{1}^{x} a(x) d(x)\; dx\; \cdot \int_{1}^{x} b(x) c(x)\; dx$$ is divisible by $(x-1)^4.$

Initially, a non-constant polynomial $S(x)$ with real coefficients is written down on a board. Whenever the board contains a polynomial $P(x)$, not necessarily alone, one can write down on the board any polynomial of the form $P(C + x)$ or $C + P(x)$ where $C$ is a real constant. Moreover, if the board contains two (not necessarily distinct) polynomials $P(x)$ and $Q(x)$, one can write $P(Q(x))$ and $P(x) + Q(x)$ down on the board. No polynomial is ever erased from the board. Given two sets of real numbers, $A = \{ a_1, a_2, \dots, a_n \}$ and $B = \{ b_1, \dots, b_n \}$, a polynomial $f(x)$ with real coefficients is $(A,B)$-[i]nice[/i] if $f(A) = B$, where $f(A) = \{ f(a_i) : i = 1, 2, \dots, n \}$. Determine all polynomials $S(x)$ that can initially be written down on the board such that, for any two finite sets $A$ and $B$ of real numbers, with $|A| = |B|$, one can produce an $(A,B)$-[i]nice[/i] polynomial in a finite number of steps. [i]Proposed by Navid Safaei, Iran[/i]

Let $a_1 < a_2 < \cdots < a_k$ denote the sequence of all positive integers between $1$ and $91$ which are relatively prime to $91$, and set $\omega = e^{2\pi i/91}$. Define \[S = \prod_{1\leq q < p\leq k}\left(\omega^{a_p} - \omega^{a_q}\right).\] Given that $S$ is a positive integer, compute the number of positive divisors of $S$.

Let $k$ be a positive integer and $u, v$ be real numbers. Consider $P(x) = (x - u^k) (x - uv) (x -v^k) = x^3 + ax^2 + bx + c$. (a) For $k = 2$ prove that if $a, b, c$ are rational then so is $uv$. (b) Is that also true for $k = 3$?

Find a method by which one can compute the coefficients of $P(x) = x^6 + a_1x^5 + \cdots+ a_6$ from the roots of $P(x) = 0$ by performing not more than $15$ additions and $15$ multiplications.