Found problems: 3597
We say that an integer $m$ is a perfect power if there are $a\in\mathbf{Z}$, $b\in\mathbf{N}$ with $b > 1$ such that $m = a^b$.
Find all polynomials $P\in\mathbf{Z}[x]$ such that $P(n)$ is a perfect power for every $n\in\mathbf{N}$.
Let $ n$ be a positive integer. Find the number of odd coefficients of the polynomial
\[ u_n(x) \equal{} (x^2 \plus{} x \plus{} 1)^n.
\]
Find all pairs $(a, b)$ of real numbers such that the roots of polynomials $6x^2 -24x -4a$ and $x^3 + ax^2 + bx - 8$ are all non-negative real numbers.
find all polynomials with integer coefficients that $P(\mathbb{Z})= ${$p(a):a\in \mathbb{Z}$} has a Geometric progression.
Let $p,q\in \mathbb{R}[x]$ such that $p(z)q(\overline{z})$ is always a real number for every complex number $z$. Prove that $p(x)=kq(x)$ for some constant $k \in \mathbb{R}$ or $q(x)=0$.
[i]Proposed by Mohammad Ahmadi[/i]
Let $a,b,c$ be real numbers with $a$ non-zero. It is known that the real numbers $x_1,x_2,\ldots,x_n$ satisfy the $n$ equations:
\[ ax_1^2+bx_1+c = x_{2} \]\[ ax_2^2+bx_2 +c = x_3\]\[ \ldots \quad \ldots \quad \ldots \quad \ldots\]\[ ax_n^2+bx_n+c = x_1 \] Prove that the system has [b]zero[/b], [u]one[/u] or [i]more than one[/i] real solutions if $(b-1)^2-4ac$ is [b]negative[/b], equal to [u]zero[/u] or [i]positive[/i] respectively.
[color=darkred] Let $m$ and $n$ be two nonzero natural numbers. Determine the minimum number of distinct complex roots of the polynomial $\prod_{k=1}^m\, (f+k)$ , when $f$ covers the set of $n^{\text{th}}$ - degree polynomials with complex coefficients.
[/color]
Let $P(x)$ be a real polynomial with $P(x) \ge 0$ for $0 \le x \le 1$. Show that there exist polynomials $P_i (x) (i = 0, 1,2)$ with $P_i (x) \ge 0$ for all real x such that $P (x) = P_0 (x) + xP_1 (x)( 1- x)P_2 (x)$.
Let $p$ be a prime and let $f(x)$ be a polynomial of degree $d$ with integer coefficients. Assume that the numbers $f(1),f(2),\dots,f(p)$ leave exactly $k$ distinct remainders when divided by $p$, and $1<k<p$. Prove that
\[ \frac{p-1}{d}\leq k-1\leq (p-1)\left(1-\frac1d \right) .\]
[i] Dániel Domán, Gauls Károlyi, and Emil Kiss [/i]
Suppose that the real numbers $a_{1},a_{2},...,a_{2002}$ satisfying
$\frac{a_{1}}{2}+\frac{a_{2}}{3}+...+\frac{a_{2002}}{2003}=\frac{4}{3}$
$\frac{a_{1}}{3}+\frac{a_{2}}{4}+...+\frac{a_{2002}}{2004}=\frac{4}{5}$
$...$
$\frac{a_{1}}{2003}+\frac{a_{2}}{2004}+...+\frac{a_{2002}}{4004}=\frac{4}{4005}$
Evaluate the sum $\frac{a_{1}}{3}+\frac{a_{2}}{5}+...+\frac{a_{2002}}{4005}$.
Let the roots $a,b,c$ of
$$f(x)=x^3 +p x^2 + qx+r$$
be real, and let $a\leq b\leq c$. Prove that $f'(x)$ has a root in the interval $\left[\frac{b+c}{2}, \frac{b+2c}{3}\right]$. What will be the form of $f(x)$ if the root in question falls at either end of the interval?
Let $\displaystyle \mathcal K$ be a finite field such that the polynomial $\displaystyle X^2-5$ is irreducible over $\displaystyle \mathcal K$. Prove that:
(a) $1+1 \neq 0$;
(b) for all $\displaystyle a \in \mathcal K$, the polynomial $\displaystyle X^5+a$ is reducible over $\displaystyle \mathcal K$.
[i]Marian Andronache[/i]
[Edit $1^\circ$] I wanted to post it in "Superior Algebra - Groups, Fields, Rings, Ideals", but I accidentally put it here :blush: Can any mod move it? I'd be very grateful.
[Edit $2^\circ$] OK, thanks.
Find all the polynomials $P(x)$ of a degree $\leq n$ with real non-negative coefficients such that $P(x) \cdot P(\frac{1}{x}) \leq [P(1)]^2$ , $ \forall x>0$.
Let $f$ be an irreducible monic polynomial with integer coefficients such that $f(0)$ is
not equal to $1$. Let $z$ be a complex number that is a root of $f$. Show that if $w$ is another complex
root of $f$, then $\frac{z}{w}$ cannot be a positive integer greater than $1$.
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.$
Determine all polynomials $p(x)$ with non-negative integer coefficients such that $p (1) = 7$ and $p (10) = 2014$.
Let $f \in Z[X]$, $f = X^2 + aX + b$, be a quadratic polynomial. Prove that $f$ has integer zeros if and only if for each positive integer $n$ there is an integer $u_n$ such that $n | f(u_n)$.
Prove that the equation $x^6 - 100x+1 = 0$ has two roots, and both of these roots are positive.
a) Find the first non-zero digit in the decimal notation of the lesser root of this equation.
b) Find the first two non-zero digits in the decimal notation of the lesser root of this equation.
Find all monic polynomials $f(x)$ in $\mathbb Z[x]$ such that $f(\mathbb Z)$ is closed under multiplication.
[i]By Mohsen Jamali[/i]
The function $f(n)$ satisfies $f(0)=0$, $f(n)=n-f \left( f(n-1) \right)$, $n=1,2,3 \cdots$. Find all polynomials $g(x)$ with real coefficient such that
\[ f(n)= [ g(n) ], \qquad n=0,1,2 \cdots \]
Where $[ g(n) ]$ denote the greatest integer that does not exceed $g(n)$.
Let $P(x)$ and $Q(x)$ be polynomials of degree $p$ and $q$ respectively such that every coefficient is $1$ or $2023$. If $P(x)$ divides $Q(x)$, prove that $p+1$ divides $q+1$.
For integers $a$ and $b$ with $0 \leq a,b < {2010}^{18}$ let $S$ be the set of all polynomials in the form of $P(x)=ax^2+bx.$ For a polynomial $P$ in $S,$ if for all integers n with $0 \leq n <{2010}^{18}$ there exists a polynomial $Q$ in $S$ satisfying $Q(P(n)) \equiv n \pmod {2010^{18}},$ then we call $P$ as a [i]good polynomial.[/i]
Find the number of [i]good polynomials.[/i]
Consider the sequence of polynomials $P_0(x) = 2$, $P_1(x) = x$ and $P_n(x) = xP_{n-1}(x) - P_{n-2}(x)$ for $n \geq 2$. Let $x_n$ be the greatest zero of $P_n$ in the the interval $|x| \leq 2$. Show that $$\lim \limits_{n \to \infty}n^2\left(4-2\pi +n^2\int \limits_{x_n}^2P_n(x)dx\right)=2\pi - 4-\frac{\pi^3}{12}$$
Let $P(x)$ be a polynomial with integer coefficients. It is known that the number $\sqrt2+\sqrt3$ is its root. Prove that the number $\sqrt2-\sqrt3$ is also its root.
A polynomial $P(x,y)$ with integer coefficients satisfies two following conditions:
1. for every integer $a$ there exists exactly one integer $y$, such that $P(a,y)=0$
2. for every integer $b$ there exists exactly one integer $x$, such that $P(x,b)=0$
a) Prove that if the degree of $P$ is $2$, then it is divisible by either $x-y+C$ for some integer $C$, or $x+y+C$ for some integer $C$
b) Is there a polynomial $P$ that isn't divisible by any of $x-y+C$ or $x+y+C$ for integers $C$?