Found problems: 3597
Find the roots of $6x^4+17x^3+7x^2-8x-4$
Let $ f$ be a polynomial with integer coefficients. Assume that there exists integers $ a$ and $ b$ such that $ f(a)\equal{}41$ and $ f(b)\equal{}49$. Prove that there exists an integer $ c$ such that $ 2009$ divides $ f(c)$.
[i]Nanang Susyanto, Jogjakarta[/i]
Let $f$ be a polynomial with real coefficients of degree $n$. Suppose that $\displaystyle \frac{f(x)-f(y)}{x-y}$ is an integer for all $0 \leq x<y \leq n$. Prove that $a-b | f(a)-f(b)$ for all distinct integers $a,b$.
We say that a set $S$ of integers is [i]rootiful[/i] if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $b$.
Assume $\Omega(n),\omega(n)$ be the biggest and smallest prime factors of $n$ respectively . Alireza and Amin decided to play a game. First Alireza chooses $1400$ polynomials with integer coefficients. Now Amin chooses $700$ of them, the set of polynomials of Alireza and Amin are $B,A$ respectively . Amin wins if for all $n$ we have :
$$\max_{P \in A}(\Omega(P(n))) \ge \min_{P \in B}(\omega(P(n)))$$
Who has the winning strategy.
Proposed by [i]Alireza Haghi[/i]
Find all non-negative integers $m,n,p,q$ such that \[ p^mq^n = (p+q)^2 +1 . \]
A magician intends to perform the following trick. She announces a positive integer $n$, along with $2n$ real numbers $x_1 < \dots < x_{2n}$, to the audience. A member of the audience then secretly chooses a polynomial $P(x)$ of degree $n$ with real coefficients, computes the $2n$ values $P(x_1), \dots , P(x_{2n})$, and writes down these $2n$ values on the blackboard in non-decreasing order. After that the magician announces the secret polynomial to the audience. Can the magician find a strategy to perform such a trick?
Find all real numbers $a$ for which the equation $x^2a- 2x + 1 = 3 |x|$ has exactly three distinct real solutions in $x$.
Let $n\ge 3$ be a positive integer. Prove that a polynomial of the form
\[x^n+a_{n-3}x^{n-3}+a_{n-4}x^{n-4}+\ldots +a_1x+a_0,\]
where at least one of the real coefficients $a_0,a_1,\ldots ,a_{n-3}$ is nonzero, cannot have all real roots.
Determine all real values of the parameter $a$ for which the equation
\[16x^4 -ax^3 + (2a + 17)x^2 -ax + 16 = 0\]
has exactly four distinct real roots that form a geometric progression.
How many real roots does the polynomial $x^5 + x^4 - x^3 - x^2 - 2x - 2$ have?
$
\textbf{a)}\ 1
\qquad\textbf{b)}\ 2
\qquad\textbf{c)}\ 3
\qquad\textbf{d)}\ 4
\qquad\textbf{e)}\ \text{None of above}
$
Find all pairs of polynomials $(p, q)$ with integer coefficients that satisfy the equation $$p(x^2) + q(x^2) = p(x)q(x)$$ such that $p$ is of degree $n$ and has $n$ nonnegative real roots (with multiplicity).
Polynomial $P(x)$ with degree $n \geq 3$ has $n$ real roots $x_1 < x_2 < x_3 <...< x_n$, such that $x_2-x_1<x_3-x_2<....<x_n-x_{n-1}$. Prove that the maximum of the function $y=|P(x)|$ where $x$ is on the interval $[ x_1, x_n ]$, is in the interval $[x_n-1, x_n]$.
Let
\[f = X^{n}+a_{n-1}X^{n-1}+\ldots+a_{1}X+a_{0}\]
be an integer polynomial of degree $n \geq 3$ such that $a_{k}+a_{n-k}$ is even for all $k \in \overline{1,n-1}$ and $a_{0}$ is even.
Suppose that $f = gh$, where $g,h$ are integer polynomials and $\deg g \leq \deg h$ and all the coefficients of $h$ are odd.
Prove that $f$ has an integer root.
Find all real numbers $k$ such that $r^4+kr^3+r^2+4kr+16=0$ is true for exactly one real number $r$.
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.$
Show that for every prime $p$ and integer $n$, there is an irreducible polynomial of degree $n$ in $\mathbb{Z}_p[x]$ and use that to show there is a field of size $p^n$.
Let $n$ be a positive integer and $\mathcal{P}_n$ be the set of integer polynomials of the form $a_0+a_1x+\ldots +a_nx^n$ where $|a_i|\le 2$ for $i=0,1,\ldots ,n$. Find, for each positive integer $k$, the number of elements of the set $A_n(k)=\{f(k)|f\in \mathcal{P}_n \}$.
[i]Marian Andronache[/i]
Determine all positive integers $n$ satisfying the following condition: for every monic polynomial $P$ of degree at most $n$ with integer coefficients, there exists a positive integer $k\le n$ and $k+1$ distinct integers $x_1,x_2,\cdots ,x_{k+1}$ such that \[P(x_1)+P(x_2)+\cdots +P(x_k)=P(x_{k+1})\].
[i]Note.[/i] A polynomial is [i]monic[/i] if the coefficient of the highest power is one.
Two polynomials $P(x)=x^4+ax^3+bx^2+cx+d$ and $Q(x)=x^2+px+q$ have real coefficients, and $I$ is an interval on the real line of length greater than $2$. Suppose $P(x)$ and $Q(x)$ take negative values on $I$, and they take non-negative values outside $I$. Prove that there exists a real number $x_0$ such that $P(x_0)<Q(x_0)$.
$(CZS 3)$ Let $a$ and $b$ be two positive real numbers. If $x$ is a real solution of the equation $x^2 + px + q = 0$ with real coefficients $p$ and $q$ such that $|p| \le a, |q| \le b,$ prove that $|x| \le \frac{1}{2}(a +\sqrt{a^2 + 4b})$ Conversely, if $x$ satisfies the above inequality, prove that there exist real numbers $p$ and
$q$ with $|p|\le a, |q|\le b$ such that $x$ is one of the roots of the equation $x^2+px+ q = 0.$
Find all real numbers $p$ for which the equation $x^3+3px^2+(4p-1)x+p=0$ has two real roots with difference $1$.
For a positive integer $n$, does there exist a permutation of all its positive integer divisors $(d_1 , d_2 , \ldots, d_k)$ such that the equation $d_kx^{k-1} + \ldots + d_2x + d_1 = 0$ has a rational root, if:
a) $n = 2024$;
b) $n = 2025$?
[i]Proposed by Mykyta Kharin[/i]
Let $P(x)$ be a polynomial of degree $n > 1$ with integer coefficients and let $k$ be a positive integer. Consider the polynomial $Q(x) = P(P(\ldots P(P(x)) \ldots ))$, where $P$ occurs $k$ times. Prove that there are at most $n$ integers $t$ such that $Q(t) = t$.
Let $P(x)$ be a polynomial with integer coefficients. We denote $\deg(P)$ its degree which is $\geq 1.$ Let $n(P)$ be the number of all the integers $k$ for which we have $(P(k))^{2}=1.$ Prove that $n(P)- \deg(P) \leq 2.$