Given a polynomial $p(x)$ with real coefficients, we denote by $S(p)$ the sum of the squares of its coefficients. For example $S(20x+ 21)=20^2+21^2=841$. Prove that if $f(x)$, $g(x)$, and $h(x)$ are polynomials with real coefficients satisfying the indentity $f(x) \cdot g(x)=h(x)^ 2$, then $$S(f) \cdot S(g) \ge S(h)^2$$ [i]Proposed by Bhavya Tiwari[/i]

Find one real value of $x$ satisfying $\frac{x^7}{7}=1+\sqrt[7]{10}x\left(x^2-\sqrt[7]{10}\right)^2$.

The monic polynomial $f$ has rational coefficients and is irreducible over the rational numbers. If $f(\sqrt5 +\sqrt2)= 0$, compute $f(f(\sqrt5 -\sqrt2))$. (A polynomial is [i]monic [/i] if its leading coefficient is $1$. A polynomial is [i]irreducible [/i] over the rational numbers if it cannot be expressed as a product of two polynomials with rational coefficients of positive degree. For example, $x^2 - 2$ is irreducible, but $x^2 - 1 = (x + 1)(x - 1)$ is not.)

Determine all polynomials $P$ with real coeffients such that $1 + P(x) = \frac12 (P(x -1) + P(x + 1))$ for all real $x$.

Let $a$, $b$, $c$, $d$ be real numbers such that $b-d \ge 5$ and all zeros $x_1, x_2, x_3,$ and $x_4$ of the polynomial $P(x)=x^4+ax^3+bx^2+cx+d$ are real. Find the smallest value the product $(x_1^2+1)(x_2^2+1)(x_3^2+1)(x_4^2+1)$ can take.

You are given $n$ different primes $p_1, p_2,..., p_n$. Consider the polynomial $$x^n + a_1x^{n -1} + a_2x^{n - 2} + ...+ a_{n - 1}x + a_n$$, where $a_i$ is the product of the first $i$ given prime numbers. For what $n$ can it have an integer root?

Let $a, b, c, d$ be integers. Prove that for any positive integer $n$, there are at least $\left \lfloor{\frac{n}{4}}\right \rfloor $ positive integers $m \leq n$ such that $m^5 + dm^4 + cm^3 + bm^2 + 2023m + a$ is not a perfect square. [i]Proposed by Ilir Snopce[/i]

Let $n$ be a positive integer and $p$ be a prime number of the form $8k+5$. A polynomial $Q$ of degree at most $2023$ and nonnegative integer coefficients less than or equal to $n$ will be called "cool" if \[p\mid Q(2)\cdot Q(3) \cdot \ldots \cdot Q(p-2)-1.\] Prove that the number of cool polynomials is even.

For every non-negative integer $k$ let $S(k)$ denote the sum of decimal digits of $k$. Let $P(x)$ and $Q(x)$ be polynomials with non-negative integer coecients such that $S(P(n)) = S(Q(n))$ for all non-negative integers $n$. Prove that there exists an integer $t$ such that $P(x) - 10^tQ(x)$ is a constant polynomial.

Let $n$ be a positive integer. Find all polynomials $P$ with real coefficients such that $$P(x^2+x-n^2)=P(x)^2+P(x)$$ for all real numbers $x$.

Let $P(x)$ be a quadratic polynomial with nonnegative coeficients. Show that for any real numbers $x$ and $y$, we have the inequality $P(xy)^2 \leqslant P(x^2)P(y^2)$. [i]E. Malinnikova[/i]

Prove the following inequality: \[\prod^k_{i=1} x_i \cdot \sum^k_{i=1} x^{n-1}_i \leq \sum^k_{i=1} x^{n+k-1}_i,\] where $x_i > 0,$ $k \in \mathbb{N}, n \in \mathbb{N}.$

Given a polynomial with integer coefficients $$P(x) = x^{20} + a_{19}x^{19} +... + a_1x + a_0,$$ having $20$ different real roots. Determine the maximum number of roots such a polynomial $P$ can have in the interval $(99, 100)$.

Let $P(x)$ be a nonzero polynomial of degree $n>1$ with nonnegative coefficients such that function $y=P(x)$ is odd. Is that possible thet for some pairwise distinct points $A_{1}, A_{2}, \dots A_{n}$ on the graph $G: y = P(x)$ the following conditions hold: tangent to $G$ at $A_{1}$ passes through $A_{2}$, tangent to $G$ at $A_{2}$ passes through $A_{3}$, $\dots$, tangent to $G$ at $A_{n}$ passes through $A_{1}$?

Find all polynomilals $P$ with real coefficients, such that $(x+1)P(x-1)+(x-1)P(x+1)=2xP(x)$

Consider the set of all polynomials of degree less than or equal to $4$ with rational coefficients. a) Prove that it has a vector space structure over the field of numbers rational. b) Prove that the polynomials $1, x - 2, (x -2)^2, (x - 2)^3$ and $(x -2)^4$ form a base of this space. c) Express the polynomial $7 + 2x - 45x^2 + 3x^4$ in the previous base.

Assume that every root of polynomial $P(x) = x^d - a_1x^{d-1} + ... + (-1)^{d-k}a_d$ is in $[0,1]$. Show that for every $k = 1,2,...,d$ the following inequality holds: $ a_k - a_{k+1} + ... + (-1)^{d-k}a_d \geq 0 $

Prove that for all $n \in \mathbb N$ the following is true: \[2^n \prod_{k=1}^n \sin \frac{k \pi}{2n+1} = \sqrt{2n+1}\]

Find all polynomials $P(x)$ and $Q(x)$ with real coefficients such that $$P(Q(x))=P(x)^{2017}$$ for all real numbers $x$.

Let $n \geq 3$ be a positive integer. A [i]chipped $n$-board[/i] is a $2 \times n$ checkerboard with the bottom left square removed. Lino wants to tile a chipped $n$-board and is allowed to use the following types of tiles: [list] [*] Type 1: any $1 \times k$ board where $1 \leq k \leq n$ [*] Type 2: any chipped $k$-board where $1 \leq k \leq n$ that must cover the left-most tile of the $2 \times n$ checkerboard. [/list] Two tilings $T_1$ and $T_2$ are considered the same if there is a set of consecutive Type 1 tiles in both rows of $T_1$ that can be vertically swapped to obtain the tiling $T_2$. For example, the following three tilings of a chipped $7$-board are the same: [img]http://i.imgur.com/8QaSgc0.png[/img] For any positive integer $n$ and any positive integer $1 \leq m \leq 2n - 1$, let $c_{m,n}$ be the number of distinct tilings of a chipped $n$-board using exactly $m$ tiles (any combination of tile types may be used), and define the polynomial $$P_n(x) = \sum^{2n-1}_{m=1} c_{m,n}x^m.$$ Find, with justification, polynomials $f(x)$ and $g(x)$ such that $$P_n(x) = f(x)P_{n-1}(x) + g(x)P_{n-2}(x)$$ for all $n \geq 3$.

Prove there exist two relatively prime polynomials $P(x),Q(x)$ having integer coefficients and a real number $u>0$ such that if for positive integers $a,b,c,d$ we have: $$|\frac{a}{c}-1|^{2021} \le \frac{u}{|d||c|^{1010}}$$ $$| (\frac{a}{c})^{2020}-\frac{b}{d}| \le \frac{u}{|d||c|^{1010}}$$ Then we have : $$bP(\frac{a}{c})=dQ(\frac{a}{c})$$ (Two polynomials are relatively prime if they don't have a common root) Proposed by [i]Navid Safaii[/i] and [i]Alireza Haghi[/i]

Find all polynomials $ P $ with integer coefficients that have the property that for any natural number $ n $ the polynomial $ P-n $ has at least a root whose square is integer.

Find at least one polynomial $P(x)$ of degree 2001 such that $P(x)+P(1- x)=1$ holds for all real numbers $x$.

$f:\mathbb{R}\rightarrow \mathbb{R}$ satisfies the equation \[f(x)f(y)-af(xy)=x+y\] , for every real numbers $x,y$. Find all possible real values of $a$.

The polynomial $P(x)=a_0+a_1x+a_2x^2+...+a_8x^8+2009x^9$ has the property that $P(\tfrac{1}{k})=\tfrac{1}{k}$ for $k=1,2,3,4,5,6,7,8,9$. There are relatively prime positive integers $m$ and $n$ such that $P(\tfrac{1}{10})=\tfrac{m}{n}$. Find $n-10m$.