Found problems: 3597
Prove that there is no non-constant polynomial $P(x)$ with integer coefficients such that $P(n)$ is a prime number for all positive integers $n$.
For what polynomials $P(n)$ with integer coefficients can a positive integer be assigned to every lattice point in $\mathbb{R}^3$ so that for every integer $n \ge 1$, the sum of the $n^3$ integers assigned to any $n \times n \times n$ grid of lattice points is divisible by $P(n)$?
[i]Proposed by Andre Arslan[/i]
Let $\alpha$ and $\beta$ be the roots of $x^{2} - qx + 1$, where $q$ is a rational number larger than $2$. Let $s_1 = \alpha + \beta$, $t_1 = 1$, and for all integers $n \geq 2$:
$s_n = \alpha^n + \beta^n$
$t_n = s_{n-1} + 2s_{n-2} + \cdot \cdot \cdot + (n - 1)s_{1} + n$
Prove that, for all odd integers $n$, $t_n$ is the square of a rational number.
Consider all polynomials $P(x)$ with real coefficients that have the following property: for any two real numbers $x$ and $y$ one has \[|y^2-P(x)|\le 2|x|\quad\text{if and only if}\quad |x^2-P(y)|\le 2|y|.\] Determine all possible values of $P(0)$.
[i]Proposed by Belgium[/i]
Find all positive integers $ k$ with the following property: There exists an integer $ a$ so that $ (a\plus{}k)^{3}\minus{}a^{3}$ is a multiple of $ 2007$.
Prove that if the polynomial $ f(x) = ax^3 + bx^2 + cx + d $ with integer coefficients takes odd values for $ x = 0 $ and $ x = 1 $, then the equation $ f(x) = 0 $ has no integer roots.
$n$ is a product of some two consecutive primes. $s(n)$ denotes the sum of the divisors of $n$ and $p(n)$ denotes the number of relatively prime positive integers not exceeding $n$. Express $s(n)p(n)$ as a polynomial of $n$.
For each positive integer $n$, show that the polynomial: $$P_n(x)=\sum _{k=0}^n2^k\binom{2n}{2k}x^k(x-1)^{n-k}$$ has $n$ real roots.
Given a ring $\left( A,+,\cdot \right)$ that meets both of the following conditions:
(1) $A$ is not a field, and
(2) For every non-invertible element $x$ of $ A$, there is an integer $m>1$ (depending on $x$) such that $x=x^2+x^3+\ldots+x^{2^m}$.
Show that
(a) $x+x=0$ for every $x \in A$, and
(b) $x^2=x$ for every non-invertible $x\in A$.
(a) For given complex numbers $a_1,a_2,a_3,a_4$, we define a function $P:\mathbb C\to\mathbb C$ by $P(z)=z^5+a_4z^4+a_3z^3+a_2z^2+a_1z$. Let $w_k=e^{2ki\pi/5}$, where $k=0,\ldots,4$. Prove that
$$P(w_0)+P(w_1)+P(w_2)+P(w_3)+P(w_4)=5.$$(b) Let $A_1,A_2,A_3,A_4,A_5$ be five points in the plane. A pentagon is inscribed in the circle with center $A_1$ and radius $R$. Prove that there is a vertex $S$ of the pentagon for which
$$SA_1\cdot SA_2\cdot SA_3\cdot SA_4\cdot SA_5\ge R^5.$$
[b]i.)[/b] Let $g(x) = x^5 + x^4 + x^3 + x^2 + x + 1.$ What is the remainder when the polynomial $g(x^{12}$ is divided by the polynomial $g(x)$?
[b]ii.)[/b] If $k$ is a positive number and $f$ is a function such that, for every positive number $x, f(x^2 + 1 )^{\sqrt{x}} = k.$ Find the value of
\[ f( \frac{9 +y^2}{y^2})^{\sqrt{ \frac{12}{y} }} \] for every positive number $y.$
[b]iii.)[/b] The function $f$ satisfies the functional equation $f(x) + f(y) = f(x+y) - x \cdot y - 1$ for every pair $x,y$ of real numbers. If $f(1) = 1,$ then find the numbers of integers $n,$ for which $f(n) = n.$
The polynomial $1-x+x^2-x^3+\cdots+x^{16}-x^{17}$ may be written in the form $a_0+a_1y+a_2y^2+\cdots +a_{16}y^{16}+a_{17}y^{17}$, where $y=x+1$ and thet $a_i$'s are constants. Find the value of $a_2$.
Polynomial P(x) with integer coefficient is called [i]cube-presented[/i] if it can be represented as sum of several cube of polynomials with integer coefficients.
Examples: $3x + 3x^2$ is cube-represented because $3x + 3x^2 = (x + 1)^3 +(-x)^3 + (-1)^3$.
a) Is $3x^2$ a cube-represented polynomial?
b). How many quadratic polynomial P(x) with integer coefficients belong to the set $\{1,2, 3, ...,2017\}$ which is cube-represented?
Let $P(x)$ be a monic polynomial of degree $n$ with nonnegative coefficients and the free term equal to $1$. Prove that if all the roots of $P(x)$ are real, then $P(x) \geq (x+1)^{n}$ holds for every $x \geq 0$.
Let $ a,b,c$ be positive integers. If $ 30|a\plus{}b\plus{}c$, prove that $ 30|a^5\plus{}b^5\plus{}c^5$.
Let $a$, $b$, $c$ be real numbers greater than or equal to $1$. Prove that
\[ \min \left(\frac{10a^2-5a+1}{b^2-5b+10},\frac{10b^2-5b+1}{c^2-5c+10},\frac{10c^2-5c+1}{a^2-5a+10}\right )\leq abc. \]
Determine the set of integers $n$ for which $n^2+19n+92$ is a square.
Let $a$ be a real number. Let $(f_n(x))_{n\ge 0}$ be a sequence of polynomials such that $f_0(x)=1$ and $f_{n+1}(x)=xf_n(x)+f_n(ax)$ for all non-negative integers $n$.
a) Prove that $f_n(x)=x^nf_n\left(x^{-1}\right)$ for all non-negative integers $n$.
b) Find an explicit expression for $f_n(x)$.
Let $P(x)$ be a polynomial of degree $5$ and suppose that a and b are real numbers different from zero. Suppose the remainder when $P(x)$ is divided by $x^3 + ax + b$ equals the remainder when $P(x)$ is divided by $x^3 + ax^2 + b$. Then determine $a + b$.
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.$
For an integer $n$, let $f_9(n)$ denote the number of positive integers $d\leq 9$ dividing $n$. Suppose that $m$ is a positive integer and $b_1,b_2,\ldots,b_m$ are real numbers such that $f_9(n)=\textstyle\sum_{j=1}^mb_jf_9(n-j)$ for all $n>m$. Find the smallest possible value of $m$.
There is a polynomial $P$ such that for every real number $x$,
\[
x^{512} + x^{256} + 1 = (x^2 + x + 1) P(x).
\]
When $P$ is written in standard polynomial form, how many of its coefficients are nonzero?
Given arbitrary positive integer $ a$ larger than $ 1$, show that for any positive integer $ n$, there always exists a n-degree integral coefficient polynomial $ p(x)$, such that $ p(0)$, $ p(1)$, $ \cdots$, $ p(n)$ are pairwise distinct positive integers, and all have the form of $ 2a^k\plus{}3$, where $ k$ is also an integer.
Let $\mathcal{P}$ be the set of all polynomials with coefficients in $\{0, 1\}$. Suppose $a, b$ are non-zero integers such that for every $f \in \mathcal{P}$ with $f(a)\neq 0$, we have $f(a) \mid f(b)$. Prove that $a=b$.
[i]Proposed by Shashank Ingalagavi and Krutarth Shah[/i]
Find all polynomials $P(x)$ with real coefficients satisfying: $P(2017) = 2016$ and $$(P(x)+1)^2=P(x^2+1).$$