Olympiad problems

1994 All-Russian Olympiad Regional Round, 10.6

Find the free coefficient of the polynomial $P(x)$ with integer coefficients, knowing that it is less than $1000$ in absolute value and that $P(19) = P(94) = 1994$.

2012 BAMO, 5

Tags: relative prime , polynomial , integer polynomial

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.)

2020 Jozsef Wildt International Math Competition, W27

Tags: algebra , number theory , polynomial , integer polynomial

Let $$P(x)=a_0x^n+a_1x^{n-1}+\ldots+a_n$$ where $a_0,\ldots,a_n$ are integers. Show that if $P$ takes the value $2020$ for four distinct integral values of $x$, then $P$ cannot take the value $2001$ for any integral value of $x$. [i]Proposed by Ángel Plaza[/i]

2023 Indonesia TST, A

Tags: algebra , integer polynomial , polynomial

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$

2000 ITAMO, 6

Tags: polynomial , algebra , integer polynomial

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.)

2011 Tuymaada Olympiad, 4

Tags: polynomial , algebra , quadratic , analytic number theory , integer sequence , integer polynomial

Let $P(n)$ be a quadratic trinomial with integer coefficients. For each positive integer $n$, the number $P(n)$ has a proper divisor $d_n$, i.e., $1<d_n<P(n)$, such that the sequence $d_1,d_2,d_3,\ldots$ is increasing. Prove that either $P(n)$ is the product of two linear polynomials with integer coefficients or all the values of $P(n)$, for positive integers $n$, are divisible by the same integer $m>1$.

2007 Singapore MO Open, 2

Tags: algebra , integer polynomial , polynomial division

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$.

2017 Balkan MO Shortlist, A5

Tags: algebra , perfect power , polynomial , integer polynomial

Consider integers $m\ge 2$ and $n\ge 1$. Show that there is a polynomial $P(x)$ of degree equal to $n$ with integer coefficients such that $P(0),P(1),...,P(n)$ are all perfect powers of $m$ .