Found problems: 4275
Let $S$ be the set of all real polynomials $f(x) = ax^3 + bx^2 + cx + d$ such that $|f(x)| \le 1$ for all $ -1 \le x \le 1$. Show that the set of possible $|a|$ for $f$ in $S$ is bounded above and find the smallest upper bound.
Let $ n_1<n_2<n_3<\cdots <n_k$ be a set of positive integers. Prove that the polynomial $ 1\plus{}z^{n_1}\plus{}z^{n_2}\plus{}\cdots \plus{}z^{n_k}$ has no roots inside the circle $ |z|<\frac{\sqrt{5}\minus{}1}{2}$.
Let $f(x)$ be a non-constant polynomial with integer coefficients such that $f(1) \neq 1$. For a positive integer $n$, define $\text{divs}(n)$ to be the set of positive divisors of $n$.
A positive integer $m$ is $f$-cool if there exists a positive integer $n$ for which $$f[\text{divs}(m)]=\text{divs}(n).$$
Prove that for any such $f$, there are finitely many $f$-cool integers.
(The notation $f[S]$ for some set $S$ denotes the set $\{f(s):s \in S\}$.)
Find all real polynomials $ g(x)$ of degree at most $ n \minus{} 3$, $ n\geq 3$, knowing that all the roots of the polynomial $ f(x) \equal{} x^n \plus{} nx^{n \minus{} 1} \plus{} \frac {n(n \minus{} 1)}2 x^{n \minus{} 2} \plus{} g(x)$ are real.
Let $a$, $b$, $c$ be the three roots of the equation $x^3-(k+1)x^2+kx+12=0$, where $k$ is a real number. If $(a-2)^3+(b-2)^3+(c-2)^3=-18$, find the value of $k$.
A prime $p$ has decimal digits $p_{n}p_{n-1} \cdots p_0$ with $p_{n}>1$. Show that the polynomial $p_{n}x^{n} + p_{n-1}x^{n-1}+\cdots+ p_{1}x + p_0$ cannot be represented as a product of two nonconstant polynomials with integer coefficients
For any positive integer $ n$, prove that there exists a polynomial $ P$ of degree $ n$ such that all coeffients of this polynomial $ P$ are integers, and such that the numbers $ P\left(0\right)$, $ P\left(1\right)$, $ P\left(2\right)$, ..., $ P\left(n\right)$ are pairwisely distinct powers of $ 2$.
Real numbers $r$ and $s$ are roots of $p(x)=x^3+ax+b$, and $r+4$ and $s-3$ are roots of $q(x)=x^3+ax+b+240$. Find the sum of all possible values of $|b|$.
For $\forall$ $m\in \mathbb{N}$ with $\pi (m)$ we denote the number of prime numbers that are no bigger than $m$. Find all pairs of natural numbers $(a,b)$ for which there exist polynomials $P,Q\in \mathbb{Z}[x]$ so that for
$\forall$ $n\in \mathbb{N}$ the following equation is true:
$\frac{\pi (an)}{\pi (bn)} =\frac{P(n)}{Q(n)}$.
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]
Let $p(x)$ be a polynomial with integer coefficients and let $n$ be an integer. Suppose that there is a positive integer $k$ for which $f^{(k)}(n) = n$, where $f^{(k)}(x)$ is the polynomial obtained as the composition of $k$ polynomials $f$. Prove that $p(p(n)) = n$.
If $r_1$, $r_2$, and $r_3$ are the solutions to the equation $x^3 - 5x^2 + 6x - 1 = 0$, then what is the value of $r_1^2 + r_2^2 + r_3^2$?
[i]Proposed by Eugene Chen[/i]
Suppose that the rational numbers $a, b$ and $c$ are the roots of the equation $x^3+ax^2 + bx + c = 0$. Find all such rational numbers $a, b$ and $c$. Justify your answer
If $f(x)$ is a monic quartic polynomial such that $f(-1)=-1$, $f(2)=-4$, $f(-3)=-9$, and $f(4)=-16$, find $f(1)$.
Let $a=-\sqrt{3}+\sqrt{5}+\sqrt{7}, b=\sqrt{3}-\sqrt{5}+\sqrt{7}, c=\sqrt{3}+\sqrt{5}-\sqrt{7}$. Evaluate \[\frac{a^4}{(a-b)(a-c)}+\frac{b^4}{(b-c)(b-a)}+\frac{c^4}{(c-a)(c-b)}.\]
Let $n$ be a positive integer. Find all polynomials $Q(x)$ with integer coefficients so that the degree of $Q(x)$ is less than $n$ and there exists an integer $m\geq 1$ for which
\[x^n-1\mid Q(x)^m-1\]
Prove that the equation $x^{19} + x^{17} = x^{16 }+ x^7 + a$ for any $a \in R$ has at least two imaginary roots
Suppose that the function $ g : (0,1) \rightarrow \mathbb{R}$ can be uniformly approximated by polynomials with nonnegative coefficients. Prove that $ g$ must be analytic. Is the statement also true for the interval $ (\minus{}1,0)$ instead of $ (0,1)$?
[i]J. Kalina, L. Lempert[/i]
Polynomial $P(x)=c_{2006}x^{2006}+c_{2005}x^{2005}+\ldots+c_1x+c_0$ has roots $r_1,r_2,\ldots,r_{2006}$. The coefficients satisfy $2i\tfrac{c_i}{c_{2006}-i}=2j\tfrac{c_j}{c_{2006}-j}$ for all pairs of integers $0\le i,j\le2006$. Given that $\sum_{i\ne j,i=1,j=1}^{2006} \tfrac{r_i}{r_j}=42$, determine $\sum_{i=1}^{2006} (r_1+r_2+\ldots+r_{2006})$.
Let $ k$ and $ s$ be positive integers. For sets of real numbers $ \{\alpha_1, \alpha_2, \ldots , \alpha_s\}$ and $ \{\beta_1, \beta_2, \ldots, \beta_s\}$ that satisfy
\[ \sum^s_{i\equal{}1} \alpha^j_i \equal{} \sum^s_{i\equal{}1} \beta^j_i \quad \forall j \equal{} \{1,2 \ldots, k\}\]
we write \[ \{\alpha_1, \alpha_2, \ldots , \alpha_s\} \overset{k}{\equal{}} \{\beta_1, \beta_2, \ldots , \beta_s\}.\]
Prove that if \[ \{\alpha_1, \alpha_2, \ldots , \alpha_s\} \overset{k}{\equal{}} \{\beta_1, \beta_2, \ldots , \beta_s\}\] and $ s \leq k,$ then there exists a permutation $ \pi$ of $ \{1, 2, \ldots , s\}$ such that
\[ \beta_i \equal{} \alpha_{\pi(i)} \quad \forall i \equal{} 1,2, \ldots, s.\]
We call a two-variable polynomial $P(x, y)$ [i]secretly one-variable,[/i] if there exist polynomials $Q(x)$ and $R(x, y)$ such that $\deg(Q) \ge 2$ and $P(x, y) = Q(R(x, y))$ (e.g. $x^2 + 1$ and $x^2y^2 +1$ are [i]secretly one-variable[/i], but $xy + 1$ is not).
Prove or disprove the following statement: If $P(x, y)$ is a polynomial such that both $P(x, y)$ and $P(x, y) + 1$ can be written as the product of two non-constant polynomials, then $P$ is [i]secretly one-variable[/i].
[i]Note: All polynomials are assumed to have real coefficients. [/i]
(a) Does there exist a polynomial $ P(x)$ with coefficients in integers, such that $ P(d) \equal{} \frac{2008}{d}$ holds for all positive divisors of $ 2008$?
(b) For which positive integers $ n$ does a polynomial $ P(x)$ with coefficients in integers exists, such that $ P(d) \equal{} \frac{n}{d}$ holds for all positive divisors of $ n$?
Find all functions $f: \mathbb{N}\to \mathbb{N}$ such that for all $n\in \mathbb{N}$: \[f(f(f(n)))+f(f(n))+f(n)=3n.\]
Find all polynomials $P(x)$ with integer coefficients, such that for all positive integers $m, n$, $$m+n \mid P^{(m)}(n)-P^{(n)}(m).$$
[i]Proposed by Navid Safaei, Iran[/i]
Let $n \ge 2$ be a fixed even integer. We consider polynomials of the form
\[P(x) = x^n + a_{n-1}x^{n-1} + \cdots + a_1x + 1\]
with real coefficients, having at least one real roots. Find the least possible value of $a^2_1 + a^2_2 + \cdots + a^2_{n-1}$.