Let $f(x)$ be a polynomial. Prove that if $\int_0^1 f(x)g_n(x)\ dx=0\ (n=0,\ 1,\ 2,\ \cdots)$, then all coefficients of $f(x)$ are 0 for each case as follows. (1) $g_n(x)=(1+x)^n$ (2) $g_n(x)=\sin n\pi x$ (3) $g_n(x)=e^{nx}$

If the remainder is $2013$ when a polynomial with coefficients from the set $\{0,1,2,3,4,5\}$ is divided by $x-6$, what is the least possible value of the coefficient of $x$ in this polynomial? $ \textbf{(A)}\ 5 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 2 \qquad\textbf{(E)}\ 1 $

Find all real solutions to the following system of equations: \[\begin{cases} x+y+z+t=5\\xy+yz+zt+tx=4\\xyz+yzt+ztx+txy=3\\xyzt=-1\end{cases}\]

For a given natural number $k > 1$, find all functions $f:\mathbb{R} \to \mathbb{R}$ such that for all $x, y \in \mathbb{R}$, $f[x^k + f(y)] = y +[f(x)]^k$.

Let $P_1(x) = ax^2 - bx - c$, $P_2(x) = bx^2 - cx - a$, $P_3(x) = cx^2 - ax - b$ be three quadratic polynomials. Suppose there exists a real number $\alpha$ such that $P_1(\alpha) = P_2(\alpha) = P_3(\alpha)$. Prove that $a = b = c$.

Let $x+y=a$ and $xy=b$. The expression $x^6+y^6$ can be written as a polynomial in terms of $a$ and $b$. What is this polynomial?

Find all polynomials $ f\in\mathbb Z[x]$ such that for each $ a,b,x\in\mathbb N$ \[ a\plus{}b\plus{}c|f(a)\plus{}f(b)\plus{}f(c)\]

Let $\tau(n)$ denote the number of positive integer divisors of a positive integer $n$ (for example, $\tau(2022) = 8$). Given a polynomial $P(X)$ with integer coefficients, we define a sequence $a_1, a_2,\ldots$ of nonnegative integers by setting \[a_n =\begin{cases}\gcd(P(n), \tau (P(n)))&\text{if }P(n) > 0\\0 &\text{if }P(n) \leq0\end{cases}\] for each positive integer $n$. We then say the sequence [i]has limit infinity[/i] if every integer occurs in this sequence only finitely many times (possibly not at all). Does there exist a choice of $P(X)$ for which the sequence $a_1$, $a_2$, . . . has limit infinity? [i]Jovan Vuković[/i]

Let $P,Q,R$ be polynomials with real coefficients, satisfying $P^4+Q^4 = R^2$. Prove that there exist real numbers $p, q, r$ and a polynomial $S$ such that $P = pS, Q = qS$ and $R = rS^2$. [hide="Variants"]Variants. (1) $P^4 + Q^4 = R^4$; (2) $\gcd(P,Q) = 1$ ; (3) $\pm P^4 + Q^4 = R^2$ or $R^4.$[/hide]

For certain real values of $a, b, c,$ and $d,$ the equation $x^4+ax^3+bx^2+cx+d=0$ has four non-real roots. The product of two of these roots is $13+i$ and the sum of the other two roots is $3+4i,$ where $i=\sqrt{-1}.$ Find $b.$

Given the polynomial $ P(x) = \frac{1}{2} - \frac{1}{3}x + \frac{1}{6}x^2 $. Let $ Q(x) = \sum_{k=0}^{m} b_k x^k $ be a polynomial given by $$ Q(x) = P(x) \cdot P(x^3) \cdot P(x^9) \cdot P(x^{27}) \cdot P(x^{81}). $$ Calculate $ \sum_{k=0}^m |b_k| $.

Let $ a$, $ b$, $ c$ be three real numbers. For each positive integer number $ n$, $ a^n \plus{} b^n \plus{} c^n$ is an integer number. Prove that there exist three integers $ p$, $ q$, $ r$ such that $ a$, $ b$, $ c$ are the roots of the equation $ x^3 \plus{} px^2 \plus{} qx \plus{} r \equal{} 0$.

Find all polynomials $p(x)$ satisfying the condition: $$p(x^2-2x)=p(x-2)^2.$$

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]

Real constants $ a, b, c$ are such that there is exactly one square all of whose vertices lie on the cubic curve $ y \equal{} x^3 \plus{} ax^2 \plus{} bx \plus{} c.$ Prove that the square has sides of length $ \sqrt[4]{72}.$

$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$

$(GBR 5)$ Let us define $u_0 = 0, u_1 = 1$ and for $n\ge 0, u_{n+2} = au_{n+1}+bu_n, a$ and $b$ being positive integers. Express $u_n$ as a polynomial in $a$ and $b.$ Prove the result. Given that $b$ is prime, prove that $b$ divides $a(u_b -1).$

Can the graphs of a polynomial of degree 20 and the function $\displaystyle y={1\over x^{40}}$ have exactly 30 points of intersection? [i]Proposed by K. Kokhas[/i]

Let $P(x)$ and $Q(x)$ be two polynomials with integer coefficients, such that no nonconstant polynomial with rational coefficients divides both $P(x)$ and $Q(x).$ Suppose that for every positive integer $n$ the integers $P(n)$ and $Q(n)$ are positive, and $2^{Q(n)}-1$ divides $3^{P(n)}-1.$ Prove that $Q(x)$ is a constant polynomial. [i]Proposed by Oleksiy Klurman, Ukraine[/i]

Let be two (not necessarily distinct) roots of two rational polynoms (respectively) that are irreducible over the rationals. Prove that these polynoms have the same degree if the sum of those two roots is rational. [i]Bogdan Enescu[/i]

Prove that the polynomial equation $x^{8}-x^{7}+x^{2}-x+15=0$ has no real solution.

Consider a quadratic polynomial $ax^2+bx+c$ with real coefficients satisfying $a\ge 2$, $b\ge 2$, $c\ge 2$. Adam and Boris play the following game. They alternately take turns with Adam first. On Adam’s turn, he can choose one of the polynomial’s coefficients and replace it with the sum of the other two coefficients. On Boris’s turn, he can choose one of the polynomial’s coefficients and replace it with the product of the other two coefficients. The winner is the player who first produces a polynomial with two distinct real roots. Depending on the values of $a$, $b$ and $c$, determine who has a winning strategy.

The two polynomials $(x) =x^4+ax^3+bx^2+cx+d$ and $Q(x) = x^2+px+q$ take negative values on an interval $I$ of length greater than $2$, and nonnegative values outside of $I$. Prove that there exists $x_0 \in \mathbb R$ such that $P(x_0) < Q(x_0)$.

Let $K$ be a finite field, $n \ge 2$ an integer, $f \in K[X]$ an irreducible polynomial of degree $n,$ and $g$ the product of all the nonconstant polynomials in $K[X]$ of degree at most $n-1.$ Prove that $f$ divides $g-1.$

Let coefficients of the polynomial$ P (x) = a_dx^d + ... + a_2x^2 + a_0$ where $d \ge 2$, are positive integers. The sequences $(b_n)$ is defined by $b_1 = a_0$ and $b_{n+1} = P (b_n)$ for $n \ge 1$. Prove that for any $n \ge 2$, there exists a prime number $p$ such that $p|b_n$ but it does not divide $b_1, b_2, ..., b_{n-1}$.