Found problems: 3597
For every natural number $ n$, find all polynomials $ x^2\plus{}ax\plus{}b$, where $ a^2 \ge 4b$, that divide $ x^{2n}\plus{}ax^n\plus{}b$.
Let $a_0$ be a positive integer and $a_n=5a_{n-1}+4$ for all $n\ge 1$. Can $a_0$ be chosen so that $a_{54}$ is a multiple of $2013$?
Let $P(x)$ be a polynomial with integer coefficients of degree $n \ge 3$.
If $x_1,...,x_m$ ($n\ge m\ge3$) are different integers such that $P(x_1) = P(x_2) = ... = P(x_m) = 1$, prove that $P$ cannot have integer roots$.
Given $a,b,c \in\mathbb{R}^+$, and that $a^2+b^2+c^2=3$. Prove that
\[ \frac{1}{a^3+2}+\frac{1}{b^3+2}+\frac{1}{c^3+2}\ge 1 \]
Suppose that $g$ and $h$ are polynomials of degree $10$ with integer coefficients such that $g(2) < h(2)$ and
\[ g(x) h(x)
= \sum_{k=0}^{10} \left( \binom{k+11}{k} x^{20-k} - \binom{21-k}{11} x^{k-1} + \binom{21}{11}x^{k-1} \right) \]
holds for all nonzero real numbers $x$. Find $g(2)$.
[i]Proposed by Yang Liu[/i]
Find all polynomials of the form $$P_n(x)=n!x^n+a_{n-1}x^{n-1}+\dots+a_1x+(-1)^n(n+1)$$ with integer coefficients, having $n$ real roots $x_1,\dots,x_n$ satisfying $k \leq x_k \leq k+1$ for $k=1, \dots,n$.
For any real number$m$, the equation $$x^2+(m-2)x- (m+3)=0$$ has two solutions, denoted $x_1 $and $ x_2$. Determine $m$ such that $x_1^2+x_2^2$ is the minimum possible.
Let $P(x)$ be a polynomial with degree $n$ and real coefficients. For all $0 \le y \le 1$ holds $\mid p(y) \mid \le 1$. Prove that $p(-\frac{1}{n}) \le 2^{n+1} -1$
Let $n$ be an integer. Prove that the polynomial $f(x)$ has at most one zero, where \[ f(x) = x^4 - 1994 x^3 + (1993+n)x^2 - 11x + n . \]
[i]Greece[/i]
The polynomial $-400x^5+2660x^4-3602x^3+1510x^2+18x-90$ has five rational roots. Suppose you guess a rational number which could possibly be a root (according to the rational root theorem). What is the probability that it actually is a root?
It is known that for quadratic polynomials $P(x)=x^2+ax+b$ and $Q(x)=x^2+cx+d$ the equation $P(Q(x))=Q(P(x))$ does not have real roots. Prove that $b \neq d$.
Prove that polynomial $x^8+98x^4+1$ can be factorized in $Z[X]$.
Let $n\ge 2$ be a positive integer. For any integer $a$, let $P_a(x)$ denote the polynomial $x^n+ax$. Let $p$ be a prime number and define the set $S_a$ as the set of residues mod $p$ that $P_a(x)$ attains. That is, $$S_a=\{b\mid 0\le b\le p-1,\text{ and there is }c\text{ such that }P_a(c)\equiv b \pmod{p}\}.$$Show that the expression $\frac{1}{p-1}\sum\limits_{a=1}^{p-1}|S_a|$ is an integer.
[i]Proposed by fattypiggy123[/i]
Given is a natural number $n \geq 3$. What is the smallest possible value of $k$ if the following statements are true?
For every $n$ points $ A_i = (x_i, y_i) $ on a plane, where no three points are collinear, and for any real numbers $ c_i$ ($1 \le i \le n$) there exists such polynomial $P(x, y)$, the degree of which is no more than $k$, where $ P(x_i, y_i) = c_i $ for every $i = 1, \dots, n$.
(The degree of a nonzero monomial $ a_{i,j} x^{i}y^{j} $ is $i+j$, while the degree of polynomial $P(x, y)$ is the greatest degree of the degrees of its monomials.)
Find all real polynomials $ f$ with $ x,y \in \mathbb{R}$ such that
\[ 2 y f(x \plus{} y) \plus{} (x \minus{} y)(f(x) \plus{} f(y)) \geq 0.
\]
Consider a $ 7\times 7$ numbers table $ a_{ij} \equal{} (i^2 \plus{} j)(i \plus{} j^2), 1\le i,j\le 7.$ When we add arbitrarily each term of an arithmetical progression consisting of $ 7$ integers to corresponding to term of certain row (or column) in turn, call it an operation. Determine whether such that each row of numbers table is an arithmetical progression, after a finite number of operations.
Let $\mathbb{Z}$ denote the set of all integers. Find all polynomials $P(x)$ with integer coefficients that satisfy the following property:
For any infinite sequence $a_1$, $a_2$, $\dotsc$ of integers in which each integer in $\mathbb{Z}$ appears exactly once, there exist indices $i < j$ and an integer $k$ such that $a_i +a_{i+1} +\dotsb +a_j = P(k)$.
Consider the sequence $(x_n)_{n\ge 1}$ where $x_1=1,x_2=2011$ and $x_{n+2}=4022x_{n+1}-x_n$ for all $n\in\mathbb{N}$. Prove that $\frac{x_{2012}+1}{2012}$ is a perfect square.
$(GBR 1)$ The polynomial $P(x) = a_0x^k + a_1x^{k-1} + \cdots + a_k$, where $a_0,\cdots, a_k$ are integers, is said to be divisible by an integer $m$ if $P(x)$ is a multiple of $m$ for every integral value of $x$. Show that if $P(x)$ is divisible by $m$, then $a_0 \cdot k!$ is a multiple of $m$. Also prove that if $a, k,m$ are positive integers such that $ak!$ is a multiple of $m$, then a polynomial $P(x)$ with leading term $ax^k$can be found that is divisible by $m.$
Let $ p$ be a prime and let \[ l_k(x,y)\equal{}a_kx\plus{}b_ky \;(k\equal{}1,2,...,p^2)\ .\] be homogeneous linear polynomials with integral coefficients. Suppose that for every pair $ (\xi,\eta)$ of integers, not both divisible by $ p$, the values $ l_k(\xi,\eta), \;1\leq k\leq p^2 $, represent every residue class $ \textrm{mod} \;p$ exactly $ p$ times. Prove that the set of pairs $ \{(a_k,b_k): 1\leq k \leq p^2 \}$ is identical $ \textrm{mod} \;p$ with the set $ \{(m,n): 0\leq m,n \leq p\minus{}1 \}.$
$N $ different numbers are written on blackboard and one of these numbers is equal to $0$.One may take any polynomial such that each of its coefficients is equal to one of written numbers ( there may be some equal coefficients ) and write all its roots on blackboard.After some of these operations all integers between $-2016$ and $2016$ were written on blackboard(and some other numbers maybe). Find the smallest possible value of $N $.
For all natural numbers $n$, consider the polynomial $P_n(x) = x^{n+2}-2x+1$.
(a) Show that the equation $P_n(x)=0$ has exactly one root $c_n$ in the open interval $(0,1)$.
(b) Find $lim_{n \to \infty}c_n$.
Let $\alpha$ be a root of $x^6-x-1$, and call two polynomials $p$ and $q$ with integer coefficients $\textit{equivalent}$ if $p(\alpha)\equiv q(\alpha)\pmod3$. It is known that every such polynomial is equivalent to exactly one of $0,1,x,x^2,\ldots,x^{727}$. Find the largest integer $n<728$ for which there exists a polynomial $p$ such that $p^3-p-x^n$ is equivalent to $0$.
Equation $$x^n + a_1x^{n-1} + a_2x^{n-2} +...+ a_{n-1}x + a_n = 0$$ with integer non-zero coefficients $a_1$, $a_2$, $...$ , $a_n$ has $n$ different integer roots. Prove that if any two roots are relatively prime, then the numbers $a_{n-1}$ and $a_n$ are coprime.
A game involves jumping to the right on the real number line. If $ a$ and $ b$ are real numbers and $ b>a,$ the cost of jumping from $ a$ to $ b$ is $ b^3\minus{}ab^2.$ For what real numbers $ c$ can one travel from $ 0$ to $ 1$ in a finite number of jumps with total cost exactly $ c?$