Found problems: 3597
$f(x) = x^3-ax+1$ , $a \in R$ has three different zeros in $R$. Prove that for the zero $x_o$ with the smallest absolute value holds: $\frac{1}{a}< x_0 < \frac{2}{a}$
$p$ is a prime. Let $K_p$ be the set of all polynomials with coefficients from the set $\{0,1,\dots ,p-1\}$ and degree less than $p$. Assume that for all pairs of polynomials $P,Q\in K_p$ such that $P(Q(n))\equiv n\pmod p$ for all integers $n$, the degrees of $P$ and $Q$ are equal. Determine all primes $p$ with this condition.
Let $P(x)$ be a polynomial whose coefficients are positive integers. If $P(n)$ divides $P(P(n)-2015)$ for every natural number $n$, prove that $P(-2015)=0$.
[hide]One additional condition must be given that $P$ is non-constant, which even though is understood.[/hide]
Find all non-constant polynomials $P(x)$ and $Q(x)$ with real coefficients satisfying the equality $P(Q(x))=P(x)Q(x)-P(x)$.
[i](I. Voronovich)[/i]
Let $p(x)$ be a cubic polynomial with integer coefficients with leading coefficient $1$ and with one of its roots equal to the product of the other two. Show that $2p(-1)$ is a multiple of $p(1)+p(-1)-2(1+p(0)).$
For an integer $m\geq 4,$ let $T_{m}$ denote the number of sequences $a_{1},\dots,a_{m}$ such that the following conditions hold:
(1) For all $i=1,2,\dots,m$ we have $a_{i}\in \{1,2,3,4\}$
(2) $a_{1} = a_{m} = 1$ and $a_{2}\neq 1$
(3) For all $i=3,4\cdots, m, a_{i}\neq a_{i-1}, a_{i}\neq a_{i-2}.$
Prove that there exists a geometric sequence of positive integers $\{g_{n}\}$ such that for $n\geq 4$ we have that \[ g_{n} - 2\sqrt{g_{n}} < T_{n} < g_{n} + 2\sqrt{g_{n}}.\]
Let $n$ be a positive integer, $n \geq 2$, and consider the polynomial equation
\[x^n - x^{n-2} - x + 2 = 0.\]
For each $n,$ determine all complex numbers $x$ that satisfy the equation and have modulus $|x| = 1.$
Let $ p,q,r$ be distinct real numbers that satisfy: $ q\equal{}p(4\minus{}p), \, r\equal{}q(4\minus{}q), \, p\equal{}r(4\minus{}r).$ Find all possible values of $ p\plus{}q\plus{}r$.
Determine the number of real roots of the equation
${x^8 -x^7 + 2x^6- 2x^5 + 3x^4 - 3x^3 + 4x^2 - 4x + \frac{5}{2}= 0}$
Find all polynomials $ P(x,y)$ such that for all reals $ x$ and $y$,
\[P(x^{2},y^{2}) =P\left(\frac {(x + y)^{2}}{2},\frac {(x - y)^{2}}{2}\right).\]
We say that a prime $p$ is $\textit{philé}$ if there is a polynomial $P$ of non-negative integer coefficients smaller than $p$ and with degree $3$, that is, $P(x) = ax^3 + bx^2 + cx + d$ where $a, b, c, d < p$, such that $$\{P(n) | 1 \leq n \leq p\}$$ is a complete residue system modulo $p$. Find all $\textit{philé}$ primes.
Note: A set $A$ is a complete residue system modulo $p$ if for every integer $k$, with $0 \leq k \leq p - 1$, there exists an element $a \in A$ such that $$p | a-k.$$
Determine the maximum value of $m^2+n^2$, where $m$ and $n$ are integers in the range $1,2,\ldots,1981$ satisfying $(n^2-mn-m^2)^2=1$.
Do there exist two polynomials $P$ and $Q$ with integer coefficient such that
i) both $P$ and $Q$ have a coefficient with absolute value bigger than $2021$,
ii) all coefficients of $P \cdot Q$ by absolute value are at most $1$.
Suppose $a_1, a_2, ..., a_r$ are integers with $a_i \geq 2$ for all $i$ such that $a_1 + a_2 + ... + a_r = 2010$.
Prove that the set $\{1,2,3,...,2010\}$ can be partitioned in $r$ subsets $A_1, A_2, ..., A_r$ each with $a_1, a_2, ..., a_r$ elements respectively, such that the sum of the numbers on each subset is divisible by $2011$.
Decide whether this property still holds if we replace $2010$ by $2011$ and $2011$ by $2012$ (that is, if the set to be partitioned is $\{1,2,3,...,2011\}$).
Let us consider every third degree polynomial $P(x)$ with coefficients as nonnegative positive integers such that $P(1)=20$. Among them determine polynomial for which is:
$a)$ Minimal value of $P(4)$
$b)$ Maximal value of $P(3)/P(2)$
Prove that for all $ n\geq 2,$ there exists $ n$-degree polynomial $ f(x) \equal{} x^n \plus{} a_{1}x^{n \minus{} 1} \plus{} \cdots \plus{} a_{n}$ such that
(1) $ a_{1},a_{2},\cdots, a_{n}$ all are unequal to $ 0$;
(2) $ f(x)$ can't be factorized into the product of two polynomials having integer coefficients and positive degrees;
(3) for any integers $ x, |f(x)|$ isn't prime numbers.
For each positive integer $n$, determine the smallest possible value of the polynomial
$$
W_n(x)=x^{2n}+2x^{2n-1}+3x^{2n-2}+\ldots + (2n-1)x^2+2nx.
$$
Six members of the team of Fatalia for the International Mathematical Olympiad are selected from $13$ candidates. At the TST the candidates got $a_1,a_2, \ldots, a_{13}$ points with $a_i \neq a_j$ if $i \neq j$.
The team leader has already $6$ candidates and now wants to see them and nobody other in the team. With that end in view he constructs a polynomial $P(x)$ and finds the creative potential of each candidate by the formula $c_i = P(a_i)$.
For what minimum $n$ can he always find a polynomial $P(x)$ of degree not exceeding $n$ such that the creative potential of all $6$ candidates is strictly more than that of the $7$ others?
[i]Proposed by F. Petrov, K. Sukhov[/i]
Let $b$ and $c$ be real numbers and define the polynomial $P(x)=x^2+bx+c$. Suppose that $P(P(1))=P(P(2))=0$, and that $P(1) \neq P(2)$. Find $P(0)$.
Let $P(x)=a_d x^d+\dots+a_1 x+a_0$ be a non-constant polynomial with non-negative integer coefficients having $d$ rational roots.Prove that $$\text{lcm} \left(P(m),P(m+1),\dots,P(n) \right)\geq m \dbinom{n}{m}$$ for all $n>m$
[i](Navid Safaei, Iran)[/i]
Find all polynomials $P$ with real coefficients which satisfy
\[P(x)P(x+1)=P(x^2-x+3) \quad \forall x \in \mathbb{R}\]
The graph of $y=f(x)$, where $f(x)$ is a polynomial of degree $3$, contains points $A(2,4)$, $B(3,9)$, and $C(4,16)$. Lines $AB$, $AC$, and $BC$ intersect the graph again at points $D$, $E$, and $F$, respectively, and the sum of the $x$-coordinates of $D$, $E$, and $F$ is $24$. What is $f(0)$?
$\textbf{(A) } -2 \qquad \textbf{(B) } 0 \qquad \textbf{(C) } 2 \qquad \textbf{(D) } \frac{24}{5} \qquad \textbf{(E) } 8$
For $n\geq 1$ let $M$ be an $n\times n$ complex array with distinct eigenvalues $\lambda_1,\lambda_2,\ldots,\lambda_k$, with multiplicities $m_1,m_2,\ldots,m_k$ respectively. Consider the linear operator $L_M$ defined by $L_MX=MX+XM^T$, for any complex $n\times n$ array $X$. Find its eigenvalues and their multiplicities. ($M^T$ denotes the transpose matrix of $M$).
A polynomial $p(x)$ has remainder three when divided by $x-1$ and remainder five when divided by $x-3$. The remainder when $p(x)$ is divided by $(x-1)(x-3)$ is
$\textbf{(A) }x-2\qquad\textbf{(B) }x+2\qquad\textbf{(C) }2\qquad\textbf{(D) }8\qquad \textbf{(E) }15$
Let $a_1(x), a_2(x)$, and $a_3(x)$ be three polynomials with integer coefficients such that every polynomial with integer coefficients can be written in the form $p_1(x)a_1(x) + p_2(x)a_2(x) + p_3(x)a_3(x)$ for some polynomials $p_1(x), p_2(x), p_3(x)$ with integer coefficients. Show that every polynomial is of the form $p_1(x)a_1(x)^2 + p_2(x)a_2(x)^2 + p_3(x)a_3(x)^2$ for some polynomials $p_1(x), p_2(x), p_3(x)$ with integer coefficients.