Found problems: 4275
A polynomial $P$ is called [i]level[/i] if it has integer coefficients and satisfies $P\left(0\right)=P\left(2\right)=P\left(5\right)=P\left(6\right)=30$. What is the largest positive integer $d$ such that for any level polynomial $P$, $d$ is a divisor of $P\left(n\right)$ for all integers $n$?
$\text{(A) }1\qquad\text{(B) }2\qquad\text{(C) }3\qquad\text{(D) }6\qquad\text{(E) }10$
Find the number of degree $8$ polynomials $f (x)$ with nonnegative integer coefficients satisfying both $f (1) = 16$ and $f (-1) = 8$.
For what integers $a$ does $x^2 -x+a$ divide $x^{13}+ x +90$ ?
Let $ f(x,y,z)$ be the polynomial with integer coefficients. Suppose that for all reals $ x,y,z$ the following equation holds:
\[ f(x,y,z) \equal{} \minus{} f(x,z,y) \equal{} \minus{} f(y,x,z) \equal{} \minus{} f(z,y,x)
\]
Prove that if $ a,b,c\in\mathbb{Z}$ then $ f(a,b,c)$ takes an even value
Determine all pairs of polynomials $f,g\in\mathbb{C}[x]$ with complex coefficients such that the following equalities hold for all $x\in\mathbb{C}$:
$f(f(x))-g(g(x))=1+i$
$f(g(x))-g(f(x))=1-i$
Let $P$ be a cubic monic polynomial with roots $a$, $b$, and $c$. If $P(1)=91$ and $P(-1)=-121$, compute the maximum possible value of \[\dfrac{ab+bc+ca}{abc+a+b+c}.\]
[i]Proposed by David Altizio[/i]
Let $p$ be an odd prime number. Let $S$ be the sum of all primitive roots modulo $p$. Show that if $p-1$ isn't squarefree (i. e., if there exist integers $k$ and $m$ with $k>1$ and $p-1=k^2m$), then $S \equiv 0 \mod p$.
If not, then what is $S$ congruent to $\mod p$ ?
Find all polynomials whose coefficients are all $\pm1$ and whose roots are all real.
A positive integer is called [i]downhill[/i] if the digits in its decimal representation form a nonstrictly decreasing sequence from left to right. Suppose that a polynomial $P(x)$ with rational coefficients takes on an integer value for each downhill positive integer $x$. Is it necessarily true that $P(x)$ takes on an integer value for each integer $x$?
Show that for each non-negative integer $n$ there are unique non-negative integers $x$ and $y$ such that we have
\[n=\frac{(x+y)^2+3x+y}{2}.\]
One day, Ivan was imprisoned by an evil king. The evil king said : "If you can correctly determine the
polynomial that I'm thinking of, you'll be free. If after $2014$ tries, you can't guess it, you'll be executed."
Ivan answered : "Are there any clues?" The evil king replied : "I can tell you that the polynomial has
real coefficients and is monic. Furthermore, all roots are positive real numbers." That night, a kind
wizard, told him the polynomial. The conversation was heard by the king who was visiting Ivan. He
killed the wizard. The next day, Ivan forgot the polynomial, except that the coefficients of $x^{2013}$ is $2014$,
and that the constant term is $1$. Can Ivan guarantee freedom? And if so, in how many tries? (Assume
that Ivan is very unlucky so any random guess fails.)
Let $a_1,a_2,\ldots ,a_9$ be any non-negative numbers such that $a_1=a_9=0$ and at least one of the numbers is non-zero. Prove that for some $i$, $2\le i\le 8$, the inequality $a_{i-1}+a_{i+1}<2a_i$ holds. Will the statement remain true if we change the number $2$ in the last inequality to $1.9$?
[b]a)[/b] Prove that for every natural numbers $n$ and $k$, we have monic polynomials of degree $n$, with integer coefficients like $A=\{P_1(x),.....,P_k(x)\}$ such that no two of them have a common factor and for every subset of $A$, the sum of elements of $A$ has all its roots real.
[b]b)[/b] Are there infinitely many monic polynomial of degree $n$ with integer coefficients like $P_1(x),P_2(x),....$ such that no two of them have a common factor and the sum of a finite number of them has all it's roots real?
[i]proposed by Mohammad Mansouri[/i]
Prove that if the roots of the equation $ x^3 + ax^2 + bx + c = 0 $, with real coefficients, are real, then the roots of the equation $ 3x^2 + 2ax + b = 0 $ are also real.
Let $P(x)$ be a polynomial whose coefficients are all either $0$ or $1$. Suppose that $P(x)$ can be written as the product of two nonconstant polynomials with integer coefficients. Does it follow that $P(2)$ is a composite integer?
Let $S$ be a set of integers with the property that any integer root of any non-zero polynomial with coefficients in $S$ also belongs to $S$. If $0$ and $1000$ are elements of $S$, prove that $-2$ is also an element of $S$.
Let \[f(n)=\dfrac{5+3\sqrt{5}}{10}\left(\dfrac{1+\sqrt{5}}{2}\right)^n+\dfrac{5-3\sqrt{5}}{10}\left(\dfrac{1-\sqrt{5}}{2}\right)^n.\] Then $f(n+1)-f(n-1)$, expressed in terms of $f(n)$, equals:
$\textbf{(A)}\ \dfrac{1}{2}f(n) \qquad
\textbf{(B)}\ f(n)\qquad
\textbf{(C)}\ 2f(n)+1 \qquad
\textbf{(D)}\ f^2(n) \qquad
\textbf{(E)}\ \dfrac{1}{2}(f^2(n)-1)$
Does there exist an infinite sequence of integers \(a_0\), \(a_1\), \(a_2\), \(\ldots\) such that \(a_0\ne0\) and, for any integer \(n\ge0\), the polynomial \[P_n(x)=\sum_{k=0}^na_kx^k\] has \(n\) distinct real roots?
[i]Proposed by Amol Rama and Espen Slettnes[/i]
Let be a natural number $ n. $ Prove that there is a polynomial $ P\in\mathbb{Z} [X,Y] $ such that $ a+b+c=0 $ implies
$$ a^{2n+1}+b^{2n+1}+c^{2n+1}=abc\left( P(a,b)+P(b,c)+P(c,a)\right) $$
[i]Dan Brânzei[/i]
Let $k$ be a positive integer and $u, v$ be real numbers. Consider $P(x) = (x - u^k) (x - uv) (x -v^k) = x^3 + ax^2 + bx + c$.
(a) For $k = 2$ prove that if $a, b, c$ are rational then so is $uv$.
(b) Is that also true for $k = 3$?
For a prime $p$, let $\mathbb{F}_p$ denote the integers modulo $p$, and let $\mathbb{F}_p[x]$ be the set of polynomials with coefficients in $\mathbb{F}_p$. Find all $p$ for which there exists a quartic polynomial $P(x) \in \mathbb{F}_p[x]$ such that for all integers $k$, there exists some integer $\ell$ such that $P(\ell) \equiv k \pmod p$. (Note that there are $p^4(p-1)$ quartic polynomials in $\mathbb{F}_p[x]$ in total.)
[i]Aprameya Tripathy[/i]
Let $\mathcal{A}$ denote the set of all polynomials in three variables $x, y, z$ with integer coefficients. Let $\mathcal{B}$ denote the subset of $\mathcal{A}$ formed by all polynomials which can be expressed as
\begin{align*}
(x + y + z)P(x, y, z) + (xy + yz + zx)Q(x, y, z) + xyzR(x, y, z)
\end{align*}
with $P, Q, R \in \mathcal{A}$. Find the smallest non-negative integer $n$ such that $x^i y^j z^k \in \mathcal{B}$ for all non-negative integers $i, j, k$ satisfying $i + j + k \geq n$.
Suppose $a$ and $b$ are real numbers such that the polynomial $x^3+ax^2+bx+15$ has a factor of $x^2-2$. Find the value of $a^2b^2$.
Let $P,Q,R$ be polynomials and let $S(x) = P(x^3) + xQ(x^3) + x^2R(x^3)$ be a polynomial of degree $n$ whose roots $x_1,\ldots, x_n$ are distinct. Construct with the aid of the polynomials $P,Q,R$ a polynomial $T$ of degree $n$ that has the roots $x_1^3 , x_2^3 , \ldots, x_n^3.$
Let $\displaystyle \mathcal K$ be a finite field. Prove that the following statements are equivalent:
(a) $\displaystyle 1+1=0$;
(b) for all $\displaystyle f \in \mathcal K \left[ X \right]$ with $\displaystyle \textrm{deg} \, f \geq 1$, $\displaystyle f \left( X^2 \right)$ is reducible.