Found problems: 108
Find all nonzero polynomials $P(x)$ with integers coefficients that satisfy the following property: whenever $a$ and $b$ are relatively prime integers, then $P(a)$ and $P(b)$ are relatively prime as well. Prove that your answer is correct. (Two integers are [b]relatively prime[/b] if they have no common prime factors. For example, $-70$ and $99$ are relatively prime, while $-70$ and $15$ are not relatively prime.)
Let $p(x)$ be a polynomial with integer coefficients such that $p(0) = 0$ and $0 \le p(1) \le 10^7$. Suppose that there exist positive integers $a,b$ such that $p(a) = 1999$ and $p(b) = 2001$. Determine all possible values of $p(1)$.
(Note: $1999$ is a prime number.)
Find all polynomials $P(x)$ with integral coefficients whose values at points $x = 1, 2, . . . , 2021$ are numbers $1, 2, . . . , 2021$ in some order.
Let $P(x)$ be a polynomial with integer coefficients. Prove that if there is an integer $k$ such that none of the integers $P(1),P(2), ..., P(k)$ is divisible by $k$, then $P(x)$ does not have integer roots.
Find a polynomial with integer coefficients which has $\sqrt2 + \sqrt3$ and $\sqrt2 + \sqrt[3]{3}$ as roots.
Find all polynomials $P(x)$ with integral coefficients whose values at points $x = 1, 2, . . . , 2021$ are numbers $1, 2, . . . , 2021$ in some order.
Find all polynomials $P\in\mathbb{Z}[x]$ such that $$|P(x)-x|\leq x^2+1$$ for all real numbers $x$.
Let $a$ and $b$ be integers, where $b$ is not a perfect square. Prove that $x^2 + ax + b$ may be the square of an integer only for finite number of integer values of $x$.
(Martin Panák)
Let $p$ be a polynomial with integer coefficients satisfying $p(16)=36,p(14)=16,p(5)=25$. Determine all possible values of $p(10)$.
A polynomial with integer coefficients takes the value $5$ at five distinct integers. Show that it does not take the value $9$ at any integer.
Let $k$ be any fixed positive integer. Let's look at integer pairs $(a, b)$, for which the quadratic equations $x^2 - 2ax + b = 0$ and $y^2 + 2ay + b = 0$ are real solutions (not necessarily different), which can be denoted by $x_1, x_2$ and $y_1, y_2$, respectively, in such an order that the equation $x_1 y_1 - x_2 y_2 = 4k$.
a) Find the largest possible value of the second component $b$ of such a pair of numbers ($a, b)$.
b) Find the sum of the other components of all such pairs of numbers.
Find all Polynomial $P(x)$ and $Q(x)$ with Integer Coefficients satisfied the equation:
\[Q(a+b) = \frac{P(a) - P(b)}{a - b}\]
$\forall a, b \in \mathbb{Z}^+$ and $a>b$
Find all Polynomial $P(x)$ and $Q(x)$ with Integer Coefficients satisfied the equation:
\[Q(a+b) = \frac{P(a) - P(b)}{a - b}\]
$\forall a, b \in \mathbb{Z}^+$ and $a>b$
Determine the smallest positive integer $M$ with the following property:
For every choice of integers $a,b,c$, there exists a polynomial $P(x)$ with integer coefficients so that $P(1)=aM$ and $P(2)=bM$ and $P(4)=cM$.
[i]Proposed by Gerhard Woeginger, Austria[/i]
Let $n > 1$ be an integer and let $a_1, a_2,... , a_n$ be $n$ different integers. Show that the polynomial
$f(x) = (x -a_1)(x - a_2)\cdot ... \cdot (x -a_n) - 1$ is not divisible by any polynomial with integer coefficients
and of degree greater than zero but less than $n$ and such that the highest power of $x$ has coefficient $1$.
Decide whether for every polynomial $P$ of degree at least $1$, there exist infinitely many primes that divide $P(n)$ for at least one positive integer $n$.
[i](Walther Janous)[/i]
$p(x)$ is a polynomial with integer coefficients. The sequence of integers $a_1, a_2, ... , a_n$ (where $n > 2$) satisfies $a_2 = p(a_1), a_3 = p(a_2), ... , a_n = p(a_{n-1}), a_1 = p(a_n)$. Show that $a_1 = a_3$.
Prove that for any polynomial $P$ with integer coefficients and any natural number $k$ there exists a natural number $n$ such that $P(1) + P(2) + ...+ P(n)$ is divisible by $k$.
Let the product of two polynomials of a variable $x$ with integer coefficients be a polynomial with even coefficients not all of which are divisible by $4$. Prove that all the coefficients of one of the polynomials are even and that at least one of the coefficients of the other polynomial is odd.
Suppose $a_1,a_2,a_3,a_4$ are distinct integers and $P(x)$ is a polynomial with integer coefficients satisfying $P(a_1) = P(a_2) = P(a_3) = P(a_4) = 1$.
(a) Prove that there is no integer $n$ such that $P(n) = 12$.
(b) Do there exist such a polynomial and $a_n$ integer $n$ such that $P(n) = 1998$?
Let $n > 1$ be an integer and let $a_1, a_2,... , a_n$ be $n$ different integers. Show that the polynomial
$f(x) = (x -a_1)(x - a_2)\cdot ... \cdot (x -a_n) - 1$ is not divisible by any polynomial with integer coefficients
and of degree greater than zero but less than $n$ and such that the highest power of $x$ has coefficient $1$.
Find the values of $p$ for which the equation $x^5 - px-1 = 0$ has two roots $r$ and $s$ which are the roots of equation $x^2-ax+b= 0$ for some integers $a,b$.
Find all pairs $(m,n)$ of integers with $m > n > 7$ for which there exists a polynomial $p(x)$ with integer coefficients such that $p(7) = 77, p(m) = 0$, and $p(n) = 85$.
Let $P_1(x) = x^2 + a_1x + b_1$ and $P_2(x) = x^2 + a_2x + b_2$ be two quadratic polynomials with integer coeffcients. Suppose $a_1 \ne a_2$ and there exist integers $m \ne n$ such that $P_1(m) = P_2(n), P_2(m) = P_1(n)$. Prove that $a_1 - a_2$ is even.
Suppose $P$ is a polynomial with integer coefficients such that for every positive integer $n$, the sum of the decimal digits of $|P(n)|$ is not a Fibonacci number. Must $P$ be constant?
(A [i]Fibonacci number[/i] is an element of the sequence $F_0, F_1, \dots$ defined recursively by $F_0=0, F_1=1,$ and $F_{k+2} = F_{k+1}+F_k$ for $k\ge 0$.)
[i]Nikolai Beluhov[/i]