Found problems: 3597
Polynomial $w(x)$ of second degree with integer coefficients takes for integer arguments values, which are squares of integers. Prove that polynomial $w(x)$ is a square of a polynomial.
Prove that if $ c, d $ are integers with $ c \neq d $, $ d > 0 $ then the equation $$ x^3 - 3cx^2 - dx + c = 0$$
has no more than one rational root.
Given a natural number $n,$ find all polynomials $P(x)$ of degree less than $n$ satisfying the following condition \[ \sum^n_{i=0} P(i) \cdot (-1)^i \cdot \binom{n}{i} = 0. \]
Determine all non-constant polynomials $X^n+a_{n-1}X^{n-1}+\cdots +a_1X+a_0$ with integer coefficients for which the roots are exactly the numbers $a_0,a_1,\ldots ,a_{n-1}$ (with multiplicity).
Let $P,Q$ be the polynomials:
$$x^3-4x^2+39x-46, x^3+3x^2+4x-3,$$
respectively.
1. Prove that each of $P, Q$ has an unique real root. Let them be $\alpha,\beta$, respectively.
2. Prove that $\{ \alpha\}>\{ \beta\} ^2$, where $\{ x\}=x-\lfloor x\rfloor$ is the fractional part of $x$.
Let $n$ be a positive integer and $a_1, a_2, \dots , a_{2n}$ mutually distinct integers. Find all integers $x$ satisfying
\[(x - a_1) \cdot (x - a_2) \cdots (x - a_{2n}) = (-1)^n(n!)^2.\]
Let $q{}$ be an arbitrary polynomial with complex coefficients which is not identically $0$ and $\Gamma_q =\{z : |q(z)| = 1\}$ be its contour line. Prove that for every point $z_0\in\Gamma_q$ there is a polynomial $p{}$ for which $|p(z_0)| = 1$ and $|p(z)|<1$ for any $z\in\Gamma_q\setminus\{z_0\}.$
Find all integers $n \ge 3$ for which the polynomial
\[W(x) = x^n - 3x^{n-1} + 2x^{n-2} + 6\]
can be written as a product of two non-constant polynomials with integer coefficients.
Let $p$ be a polynomial with integer coefficients and let $a_1<a_2<\cdots <a_k$ be integers. Given that $p(a_i)\ne 0\forall\; i=1,2,\cdots, k$.
[list]
(a) Prove $\exists\; a\in \mathbb{Z}$ such that
\[ p(a_i)\mid p(a)\;\;\forall i=1,2,\dots ,k \]
(b) Does there exist $a\in \mathbb{Z}$ such that
\[ \prod_{i=1}^{k}p(a_i)\mid p(a) \][/list]
Let $P(x_1,\dots,x_n)$ denote a polynomial with real coefficients in the variables $x_1,\dots,x_n,$ and suppose that
(a) $\left(\frac{\partial^2}{\partial x_1^2}+\cdots+\frac{\partial^2}{\partial x_n^2} \right)P(x_1,\dots,x_n)=0$ (identically)
and that
(b) $x_1^2+\cdots+x_n^2$ divides $P(x_1,\dots,x_n).$
Show that $P=0$ identically.
How many ordered four-tuples of integers $(a,b,c,d)$ with $0 < a < b < c < d < 500$ satisfy $a + d = b + c$ and $bc - ad = 93$?
Find all polynomials $P(x)$ with real coefficients that satisfy \[P(x\sqrt{2})=P(x+\sqrt{1-x^2})\]for all real $x$ with $|x|\le 1$.
Determine all pairs of polynomials $f$ and $g$ with real coefficients such that \[ x^2 \cdot g(x) = f(g(x)). \]
Find all rational numbers $k$ such that $0 \le k \le \frac{1}{2}$ and $\cos k \pi$ is rational.
For all positive numbers $x,y,z$ the product $(x+y+z)^{-1}(x^{-1}+y^{-1}+z^{-1})(xy+yz+xz)^{-1}[(xy)^{-1}+(yz)^{-1}+(xz)^{-1}]$ equals
$\text{(A)}\ x^{-2}y^{-2}z^{-2} \qquad \text{(B)}\ x^{-2}+y^{-2}+z^{-2} \qquad \text{(C)}\ (x+y+z)^{-1}$
$\text{(D)}\ \frac{1}{xyz} \qquad \text{(E)}\ \frac{1}{xy+yz+xz}$
Determine the number of polynomials of degree $ 3 $ that are irreducible over the field of integers modulo a prime.
For any function $f(x)$, define $f^1(x) = f(x)$ and $f^n (x) = f(f^{n-1}(x))$ for any integer $n \ge 2$. Does there exist a quadratic polynomial $f(x)$ such that the equation $f^n(x) = 0$ has exactly $2^n$ distinct real roots for every positive integer $n$?
[i](6 points)[/i]
Find the number of positive integers $m$ for which there exist nonnegative integers $x_0,x_1,\ldots,x_{2011}$ such that \[ m^{x_0}=\sum_{k=1}^{2011}m^{x_k}. \]
Find four distinct positive integers, $a$, $b$, $c$, and $d$, such that each of the four sums $a+b+c$, $a+b+d$,$a+c+d$, and $b+c+d$ is the square of an integer. Show that infinitely many quadruples $(a,b,c,d)$ with this property can be created.
If a polynomial $f(x)$ is divided by $(x-a)^{2} (x-b)$, where $a\ne b$, derive a formula for the remainder.
Let $n=p_1p_2\cdots p_s$, where $p_1,\ldots,p_s$ are distinct odd prime numbers.
(a) Prove that the expression
$$F_n(x)=\prod\left(x^{\frac n{p_{i_1}\cdots p_{i_k}}}-1\right)^{(-1)^k},$$where the product goes over all subsets $\{p_{i_1},\ldots,p_{i_k}\}$ or $\{p_1,\ldots,p_s\}$ (including itself and the empty set), can be written as a polynomial in $x$ with integer coefficients.
(b) Prove that if $p$ is a prime divisor of $F_n(2)$, then either $p\mid n$ or $n\mid p-1$.
Let $n$ be a positive integer. Ilya and Sasha both choose a pair of different polynomials of degree $n$ with real coefficients. Lenya knows $n$, his goal is to find out whether Ilya and Sasha have the same pair of polynomials. Lenya selects a set of $k$ real numbers $x_1<x_2<\dots<x_k$ and reports these numbers. Then Ilya fills out a $2 \times k$ table: For each $i=1,2,\dots,k$ he writes a pair of numbers $P(x_i),Q(x_i)$ (in any of the two possible orders) intwo the two cells of the $i$-th column, where $P$ and $Q$ are his polynomials. Sasha fills out a similar table. What is the minimal $k$ such that Lenya can surely achieve the goal by looking at the tables?
[i]Proposed by L. Shatunov[/i]
For each positive integer $p$, let $b(p)$ denote the unique positive integer $k$ such that $|k-\sqrt{p}|<\frac{1}{2}$. For example, $b(6) = 2$ and $b(23)=5$. If $S = \textstyle\sum_{p=1}^{2007}b(p)$, find the remainder when S is divided by 1000.
$p(x)$ is a polynomial such that $p(y^2+1) = 6y^4 - y^2 + 5$. Find $p(y^2-1)$.
Find all triples $(x,y,z)$ of positive rationals such that $x + y + z$, $\dfrac{1}{x} + \dfrac{1}{y} + \dfrac{1}{z}$ and $xyz$ are all integers.