Olympiad problems

2011 Dutch IMO TST, 4

Determine all integers $n$ for which the polynomial $P(x) = 3x^3-nx-n-2$ can be written as the product of two non-constant polynomials with integer coeffcients.

2021 Korea Winter Program Practice Test, 4

Tags: number theory , integer polynomial

Find all $f(x)\in \mathbb Z (x)$ that satisfies the following condition, with the lowest degree. [b]Condition[/b]: There exists $g(x),h(x)\in \mathbb Z (x)$ such that $$f(x)^4+2f(x)+2=(x^4+2x^2+2)g(x)+3h(x)$$.

2007 Singapore MO Open, 2

Tags: integer polynomial , polynomial division , algebra

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

2021 Mediterranean Mathematics Olympiad, 1

Tags: polynomial , integer polynomial , algebra

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]

1968 Poland - Second Round, 1

Tags: polynomial , integer polynomial , algebra

Prove that if a polynomial with integer coefficients takes a value equal to $1$ in absolute value at three different integer points, then it has no integer zeros.

2018 Iran Team Selection Test, 3

Tags: polynomial , integer polynomial , number theory

$n>1$ and distinct positive integers $a_1,a_2,\ldots,a_{n+1}$ are given. Does there exist a polynomial $p(x)\in\Bbb{Z}[x]$ of degree $\le n$ that satisfies the following conditions? a. $\forall_{1\le i < j\le n+1}: \gcd(p(a_i),p(a_j))>1 $ b. $\forall_{1\le i < j < k\le n+1}: \gcd(p(a_i),p(a_j),p(a_k))=1 $ [i]Proposed by Mojtaba Zare[/i]

2022 Turkey Team Selection Test, 6

Tags: algebra , polynomial , integer polynomial , number theory

For a polynomial $P(x)$ with integer coefficients and a prime $p$, if there is no $n \in \mathbb{Z}$ such that $p|P(n)$, we say that polynomial $P$ [i]excludes[/i] $p$. Is there a polynomial with integer coefficients such that having degree of 5, excluding exactly one prime and not having a rational root?

1999 Israel Grosman Mathematical Olympiad, 4

Tags: integer polynomial , polynomial , factoring , algebra

Consider a polynomial $f(x) = x^4 +ax^3 +bx^2 +cx+d$ with integer coefficients. Prove that if $f(x)$ has exactly one real root, then it can be factored into nonconstant polynomials with rational coefficients