Found problems: 3597
Let be given three quadratic polynomials:
$P_1(x) = x^2 + p_1x+q_1, P_2(x) = x^2+ p_2x+q_2, P_3(x) = x^2 + p_3x+q_3$.
Prove that the equation $|P_1(x)|+|P_2(x)| = |P_3(x)|$ has at most eight real roots.
Given the polynomial $p(x) = x^2 + x - 70$, do there exist integers $0<m<n$, so that $p(m)$ is divisible by $n$ and $p(m+1)$ is divisible by $n+1$?
[i]Proposed by Nairy Sedrakyan[/i]
Let $P(x)=x^n +a_1x^{n-1}+a_2x^{n-2}+\ldots+a_{n-1}x+a_n$ be a polynomial of degree $n$ and $n$ real roots, all of them in the interval $(0,1)$. Prove that for all $k=\overline{1,n}$ the following inequality holds:
\[(-1)^k(a_k+a_{k+1}+\ldots+a_n)>0.\]
[i]Proposed by N. Safaei (Iran)[/i]
The polynomial $ x^3\minus{}2004x^2\plus{}mx\plus{}n$ has integer coefficients and three distinct positive zeros. Exactly one of these is an integer, and it is the sum of the other two. How many values of $ n$ are possible?
$ \textbf{(A)}\ 250,\!000 \qquad
\textbf{(B)}\ 250,\!250 \qquad
\textbf{(C)}\ 250,\!500 \qquad
\textbf{(D)}\ 250,\!750 \qquad
\textbf{(E)}\ 251,\!000$
Do there exist polynomials $p(x)$ and $q(x)$ with real coefficients such that $p^3(x)-q^2(x)$ is linear but not constant?
Let $f(x)$ be a polynomial with integer coefficients such that $f(15) f(21) f(35) - 10$ is divisible by $105$. Given $f(-34) = 2014$ and $f(0) \ge 0$, find the smallest possible value of $f(0)$.
[i]Proposed by Michael Kural and Evan Chen[/i]
Prove:
(a) There are infinitely many triples of positive integers $m, n, p$ such that $4mn - m- n = p^2 - 1.$
(b) There are no positive integers $m, n, p$ such that $4mn - m- n = p^2.$
Assuming that the roots of $x^3 + p \cdot x^2 + q \cdot x + r = 0$ are real and positive, find a relation between $p,q$ and $r$ which gives a necessary condition for the roots to be exactly the cosines of the three angles of a triangle.
Test whether equation $$\frac{1}{x - a} + \frac{1}{x - b} + \frac{1}{x - c} = 0,$$ where $ a $, $ b $, $ c $ denote the given real numbers, has real roots.
Consider the multiplicative group $ \left\{ \left.A_k:=\left(\begin{matrix} 2^k& 2^k\\2^k& 2^k\end{matrix}\right)\right| k\in\mathbb{Z} \right\} . $
[b]a)[/b] Prove that $A_xA_y=A_{x+y+1} , $ for all integers $ x,y. $
[b]b)[/b] Show that, for all integers $ t, $ the multiplicative group $ \left\{ A_{jt-1}|j\in\mathbb{Z} \right\} $ is a subgroup of $ G. $
[b]c)[/b] Determine the linear integer polynomials $ P $ for which it exists an isomorphism $ \left(
G,\cdot \right)\stackrel{\eta}{\cong}\left( \mathbb{Z} ,+ \right) $ such that $ \eta\left( A_k \right) =P(k). $
Prove that if $A$ is a commutative finite ring with at least two elements and $n$ is a positive integer, then there exists a polynomial of degree $n$ with coefficients in $A$ which does not have any roots in $A$.
Find all nonconstant polynomials $P(z)$ with complex coefficients for which all complex roots of the polynomials $P(z)$ and $P(z) - 1$ have absolute value 1.
[i]Ankan Bhattacharya[/i]
Let $1<t<2$ be a real number. Prove that for all sufficiently large positive integers like $d$, there is a monic polynomial $P(x)$ of degree $d$, such that all of its coefficients are either $+1$ or $-1$ and
$$\left|P(t)-2019\right| <1.$$
[i]Proposed by Navid Safaei[/i]
$P(x)$ is a nonzero polynomial with integer coefficients. Prove that there exists infinitely many prime numbers $q$ such that for some natural number $n$, $q|2^n+P(n)$.
[i]Proposed by Mohammad Gharakhani[/i]
$n>1$ and distinct positive integers $a_1,a_2,\ldots,a_{n+1}$ are given. Does there exist a polynomial $p(x)\in\Bbb{Z}[x]$ of degree $\le n$ that satisfies the following conditions?
a. $\forall_{1\le i < j\le n+1}: \gcd(p(a_i),p(a_j))>1 $
b. $\forall_{1\le i < j < k\le n+1}: \gcd(p(a_i),p(a_j),p(a_k))=1 $
[i]Proposed by Mojtaba Zare[/i]
Given two real numbers $a, b$ with $a \neq 0$, find all polynomials $P(x)$ which satisfy
\[xP(x - a) = (x - b)P(x).\]
Determine all positive integers $n$ for which there exists a polynomial $p(x)$ of degree $n$ with integer coefficients such that it takes the value $n$ in $n$ distinct integer points and takes the value $0$ at point $0$.
Find the magnitude of the product of all complex numbers $c$ such that the recurrence defined by $x_1 = 1$, $x_2 = c^2 - 4c + 7$, and $x_{n+1} = (c^2 - 2c)^2 x_n x_{n-1} + 2x_n - x_{n-1}$ also satisfies $x_{1006} = 2011$.
[i]Author: Alex Zhu[/i]
Let be the polynomial $ f=X^4+X^2\in\mathbb{Z}_2[X] $ Find:
a) its degree..
b) the splitting field of $ f $
c) the Galois group of $ f $ (Galois group of its splitting field)
Let $f(x),g(x)$ be two polynomials with integer coefficients. It is known that for infinitely many prime $p$, there exist integer $m_p$ such that
$$f(a) \equiv g(a+m_p) \pmod p$$
holds for all $a \in \mathbb{Z}.$ Prove that there exists a rational number $r$ such that
$$f(x)=g(x+r).$$
Find at least one polynomial $P(x)$ of degree 2001 such that $P(x)+P(1- x)=1$ holds for all real numbers $x$.
For a given natural number $k > 1$, find all functions $f:\mathbb{R} \to \mathbb{R}$ such that for all $x, y \in \mathbb{R}$, $f[x^k + f(y)] = y +[f(x)]^k$.
Let $f^{(n)}(x)$ denote the $n^{\text{th}}$ iterate of function $f$, i.e $f^{(1)}(x)=f(x)$, $f^{(n+1)}(x)=f(f^{(n)}(x))$.
Let $p(n)$ be a given polynomial with integer coefficients, which maps the positive integers into the positive integers. Is it possible that the functional equation $f^{(n)}(n)=p(n)$ has exactly one solution $f$ that maps the positive integers into the positive integers?
[i]Submitted by Dávid Matolcsi and Kristóf Szabó, Budapest[/i]
If $ p(x)$ is a polynomial, denote by $ p^n(x)$ the polynomial $ p(p(...(p(x))..)$, where $ p$ is iterated $ n$ times. Prove that the polynomial $ p^{2003}(x)\minus{}2p^{2002}(x)\plus{}p^{2001}(x)$ is divisible by $ p(x)\minus{}x$
Let the function $f:N^*\to N^*$ such that
[b](1)[/b] $(f(m),f(n))\le (m,n)^{2014} , \forall m,n\in N^*$;
[b](2)[/b] $n\le f(n)\le n+2014 , \forall n\in N^*$
Show that: there exists the positive integers $N$ such that $ f(n)=n $, for each integer $n \ge N$.
(High School Affiliated to Nanjing Normal University )