How many polynomials of degree exactly $5$ with real coefficients send the set $\{1, 2, 3, 4, 5, 6\}$ to a permutation of itself?

For certain real numbers $a$, $b$, and $c$, the polynomial \[g(x) = x^3 + ax^2 + x + 10\] has three distinct roots, and each root of $g(x)$ is also a root of the polynomial \[f(x) = x^4 + x^3 + bx^2 + 100x + c.\] What is $f(1)$? $\textbf{(A)}\ -9009 \qquad\textbf{(B)}\ -8008 \qquad\textbf{(C)}\ -7007 \qquad\textbf{(D)}\ -6006 \qquad\textbf{(E)}\ -5005$

Find all pairs of integers $a,b$ for which there exists a polynomial $P(x) \in \mathbb{Z}[X]$ such that product $(x^2+ax+b)\cdot P(x)$ is a polynomial of a form \[ x^n+c_{n-1}x^{n-1}+\cdots+c_1x+c_0 \] where each of $c_0,c_1,\ldots,c_{n-1}$ is equal to $1$ or $-1$.

$ p(x)$ is a polynomial in $ \mathbb{Z}[x]$ such that for each $ m,n\in \mathbb{N}$ there is an integer $ a$ such that $ n\mid p(a^m)$. Prove that $0$ or $1$ is a root of $ p(x)$.

Let $n$ be a positive integer. Ilya and Sasha both choose a pair of different polynomials of degree $n$ with real coefficients. Lenya knows $n$, his goal is to find out whether Ilya and Sasha have the same pair of polynomials. Lenya selects a set of $k$ real numbers $x_1<x_2<\dots<x_k$ and reports these numbers. Then Ilya fills out a $2 \times k$ table: For each $i=1,2,\dots,k$ he writes a pair of numbers $P(x_i),Q(x_i)$ (in any of the two possible orders) intwo the two cells of the $i$-th column, where $P$ and $Q$ are his polynomials. Sasha fills out a similar table. What is the minimal $k$ such that Lenya can surely achieve the goal by looking at the tables? [i]Proposed by L. Shatunov[/i]

Elmo calls a monic polynomial with real coefficients [i]tasty[/i] if all of its coefficients are in the range $[-1,1]$. A monic polynomial $P$ with real coefficients and complex roots $\chi_1,\cdots,\chi_m$ (counted with multiplicity) is given to Elmo, and he discovers that there does not exist a monic polynomial $Q$ with real coefficients such that $PQ$ is tasty. Find all possible values of $\max\left(|\chi_1|,\cdots,|\chi_m|\right)$. [i]Proposed by Carl Schildkraut[/i]

Find all polynomials $P(x)$ of odd degree $d$ and with integer coefficients satisfying the following property: for each positive integer $n$, there exists $n$ positive integers $x_1, x_2, \ldots, x_n$ such that $\frac12 < \frac{P(x_i)}{P(x_j)} < 2$ and $\frac{P(x_i)}{P(x_j)}$ is the $d$-th power of a rational number for every pair of indices $i$ and $j$ with $1 \leq i, j \leq n$.

Let $P(x) = x^3 - 2x + 1$ and let $Q(x) = x^3 - 4x^2 + 4x - 1$. Show that if $P(r) = 0$ then $Q(r^2) = 0$.

Suppose you are given a fair coin and a sheet of paper with the polynomial $x^m$ written on it. Now for each toss of the coin, if heads show up, you must erase the polynomial $x^r$ (where $r$ is going to change with time - initially it is $m$) written on the paper and replace it with $x^{r-1}$. If tails show up, replace it with $x^{r+1}$. What is the expected value of the polynomial I get after $m$ such tosses? (Note: this is a different concept from the most probable value)

Let $ n$ be a positive integer and $ a_{1}, \ldots, a_{n}$ be arbitrary integers. Suppose that a function $ f: \mathbb{Z}\to \mathbb{R}$ satisfies $ \sum_{i=1}^{n}f(k+a_{i}l) = 0$ whenever $ k$ and $ l$ are integers and $ l \ne 0$. Prove that $ f = 0$.

Prove that $1280000401$ is composite.

Let $p$ be a prime number and let $\mathbb{F}_p$ be the finite field with $p$ elements. Consider an automorphism $\tau$ of the polynomial ring $\mathbb{F}_p[x]$ given by \[\tau(f)(x)=f(x+1).\] Let $R$ denote the subring of $\mathbb{F}_p[x]$ consisting of those polynomials $f$ with $\tau(f)=f$. Find a polynomial $g \in \mathbb{F}_p[x]$ such that $\mathbb{F}_p[x]$ is a free module over $R$ with basis $g,\tau(g),\dots,\tau^{p-1}(g)$.

Prove that there are infinitely many positive integers $ n$ for which all the prime divisors of $ n^{2}\plus{}n\plus{}1$ are not more then $ \sqrt{n}$. [hide] Stronger one. Prove that there are infinitely many positive integers $ n$ for which all the prime divisors of $ n^{3}\minus{}1$ are not more then $ \sqrt{n}$.[/hide]

The function $f(x) = x^2+ax+b$ has two distinct zeros. If $f(x^2+2x-1)=0$ has four distinct zeros $x_1<x_2<x_3<x_4$ that form an arithmetic sequence, compute the range of $a-b$. [i](Source: China National High School Mathematics League 2021, Zhejiang Province, Problem 11)[/i]

For integer $n > 1$, consider $n$ cube polynomials $P_1(x), ..., P_n(x)$ such that each polynomial has $3$ distinct real roots. Denote $S$ as the set of roots of following equation $P_1(x)P_2(x)P_3(x)... P_n(x) = 0$. It is also known that for each $1 \le i < j \le n, P_i(x)P_j(x) = 0$ has $5$ distinct real roots. 1. Prove that if for each $a, b \in S$, there is exactly one $i \in\{1,2, 3,..., n\}$ such that $P_i(a) = P_i(b) = 0$ then $n = 7$. 2. Prove that if $n > 7$ then $|S| = 2n + 1$.

Let $x_1\leq x_2\leq x_3\leq x_4$ be real numbers. Prove that there exist polynomials of degree two $P(x)$ and $Q(x)$ with real coefficients such that $x_1$, $x_2$, $x_3$ and $x_4$ are the roots of $P(Q(x))$ if and only if $x_1+x_4=x_2+x_3$.

Let $ \varphi(x)$ be a cubic polynomial with integer coefficients. Given that $ \varphi(x)$ has have 3 distinct real roots $u,v,w $ and $u,v,w $ are not rational number. there are integers $ a, b,c$ such that $u=av^2+bv+c$. Prove that $b^2 -2b -4ac - 7$ is a square number .

Prove that for all sufficiently large positive integers $d{}$, at least $99\%$ of the polynomials of the form \[\sum_{i\leqslant d}\sum_{j\leqslant d}\pm x^iy^j\]are irreducible over the integers.

Let $f$ be a polynomial of degree $98$, such that $f (k) =\frac{1}{k}$ for $k=1,2,3,\ldots,99$. Determine $f(100)$.

What quadratic polynomial whose coefficient of $x^2$ is $1$ has roots which are the complex conjugates of the solutions of $x^2 -6x+ 11 = 2xi-10i$? (Note that the complex conjugate of $a+bi$ is $a-bi$, where a and b are real numbers.)

Let $n > 1$ be an integer and let $f(x) = x^n + 5 \cdot x^{n-1} + 3.$ Prove that there do not exist polynomials $g(x),h(x),$ each having integer coefficients and degree at least one, such that $f(x) = g(x) \cdot h(x).$

Let $f: \mathbb {R} \to \mathbb {R}$ be a concave function and $g: \mathbb {R} \to \mathbb {R}$ be a continuous function . If $$ f (x + y) + f (x-y) -2f (x) = g (x) y^2 $$for all $x, y \in \mathbb {R}, $ prove that $f $ is a second degree polynomial.

The polynomial $ W(x) = x^4 + ax^3 + bx + cx + d $ is given. Prove that if the equation $ W(x) = 0 $ has four real roots, then for there to exist $ m $ such that $ W(x+m) = x^4+px^2+q $, it is necessary and it is enough that the sum of certain two roots of the equation $ W(x) = 0 $ equals the sum of the remaining ones.

Let $n \geq 2$ be a fixed positive integer and let $a_{0},a_{1},...,a_{n-1}$ be real numbers. Assume that all of the roots of the polynomial $P(x) = x^n+a_{n-1}x^{n-1}+a_{n-2}x^{n-2}+...+a_{1}x+a_{0}$ are strictly positive real numbers. Determine the smallest possible value of $\frac{a_{n-1}^{2}}{a_{n-2}}$ over all such polynomials. [i]Proposed by Nikola Velov[/i]

Let $P(n)$ be a polynomial of degree $m$ with integer coefficients, where $m \le 10$. Suppose that $P(0)=0$, $P(n)$ has $m$ distinct integer roots, and $P(n)+1$ can be factored as the product of two nonconstant polynomials with integer coefficients. Find the sum of all possible values of $P(2)$. [i]Proposed by Evan Chen[/i]