This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 104

2011 Dutch IMO TST, 4
Tags: polynomial , Integer Polynomial , algebra
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 Estonia Team Selection Test, 2
Tags: polynomial , algebra , Integer Polynomial
Find all polynomials $P(x)$ with integral coefficients whose values at points $x = 1, 2, . . . , 2021$ are numbers $1, 2, . . . , 2021$ in some order.

2020 USA EGMO Team Selection Test, 6
Tags: algebra , polynomial , Integer Polynomial , Periodic sequence , modular arithmetic , TST
Find the largest integer $N \in \{1, 2, \ldots , 2019 \}$ such that there exists a polynomial $P(x)$ with integer coefficients satisfying the following property: for each positive integer $k$, $P^k(0)$ is divisible by $2020$ if and only if $k$ is divisible by $N$. Here $P^k$ means $P$ applied $k$ times, so $P^1(0)=P(0), P^2(0)=P(P(0)),$ etc.

2010 Swedish Mathematical Competition, 3
Tags: algebra , polynomial , Integer Polynomial
Find all natural numbers $n \ge 1$ such that there is a polynomial $p(x)$ with integer coefficients for which $p (1) = p (2) = 0$ and where $p (n)$ is a prime number .

2014 Swedish Mathematical Competition, 1
Tags: algebra , polynomial , Integer Polynomial
Determine all polynomials $p(x)$ with non-negative integer coefficients such that $p (1) = 7$ and $p (10) = 2014$.

2011 Ukraine Team Selection Test, 11
Tags: Polynomials , polynomial , algebra , inequalities , Integer Polynomial
Let $ P (x) $ and $ Q (x) $ be polynomials with real coefficients such that $ P (0)> 0 $ and all coefficients of the polynomial $ S (x) = P (x) \cdot Q (x) $ are integers. Prove that for any positive $ x $ the inequality holds: $$S ({{x} ^ {2}}) - {{S} ^ {2}} (x) \le \frac {1} {4} ({{P} ^ {2}} ({{ x} ^ {3}}) + Q ({{x} ^ {3}})). $$

2016 All-Russian Olympiad, 5
Tags: number theory , Integer Polynomial , algebra , polynomial
Let $n$ be a positive integer and let $k_0,k_1, \dots,k_{2n}$ be nonzero integers such that $k_0+k_1 +\dots+k_{2n}\neq 0$. Is it always possible to a permutation $(a_0,a_1,\dots,a_{2n})$ of $(k_0,k_1,\dots,k_{2n})$ so that the equation \begin{align*} a_{2n}x^{2n}+a_{2n-1}x^{2n-1}+\dots+a_0=0 \end{align*} has not integer roots?

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

1947 Putnam, B5
Tags: Putnam , Integer Polynomial , roots
Let $a,b,c,d$ be distinct integers such that $$(x-a)(x-b)(x-c)(x-d) -4=0$$ has an integer root $r.$ Show that $4r=a+b+c+d.$

1998 ITAMO, 5
Tags: polynomial , Integer Polynomial , algebra
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$?

1992 Nordic, 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$.

1994 All-Russian Olympiad Regional Round, 10.6
Tags: algebra , polynomial , Integer Polynomial
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$.

2005 All-Russian Olympiad Regional Round, 11.5
Tags: number theory , Integer Polynomial , polynomial , algebra
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$.

1998 Czech and Slovak Match, 2
Tags: integer root , Integer Polynomial , algebra
A polynomial $P(x)$ of degree $n \ge 5$ with integer coefficients has $n$ distinct integer roots, one of which is $0$. Find all integer roots of the polynomial $P(P(x))$.

1995 Romania Team Selection Test, 3
Tags: algebra , polynomial , Integer Polynomial , Irreducible
Let $f$ be an irreducible (in $Z[x]$) monic polynomial with integer coefficients and of odd degree greater than $1$. Suppose that the modules of the roots of $f$ are greater than $1$ and that $f(0)$ is a square-free number. Prove that the polynomial $g(x) = f(x^3)$ is also irreducible

2013 QEDMO 13th or 12th, 10
Tags: polynomial , algebra , Integer Polynomial
Let $p$ be a prime number gretater then $3$. What is the number of pairs $(m, n)$ of integers with $0 <m <n <p$, for which the polynomial $x^p + px^n + px^m +1$ is not a product of two non-constant polynomials with integer coefficients can be written?

1990 Bundeswettbewerb Mathematik, 1
Tags: trinomial , quadratic polynomial , Integer Polynomial , algebra
Consider the trinomial $f(x) = x^2 + 2bx + c$ with integer coefficients $b$ and $c$. Prove that if $f(n) \ge 0$ for all integers $n$, then $f(x) \ge 0$ even for all rational numbers $x$.

2022 Austrian MO National Competition, 4
Tags: number theory , Integer Polynomial , polynomial
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]

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

1992 Romania Team Selection Test, 6
Tags: number theory , prime , Integer Polynomial , prime numbers
Let $m,n$ be positive integers and $p$ be a prime number. Show that if $\frac{7^m + p \cdot 2^n}{7^m - p \cdot 2^n}$ is an integer, then it is a prime number.

2011 Dutch IMO TST, 4
Tags: polynomial , Integer Polynomial , algebra
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.

2014 IMO Shortlist, N6
Tags: IMO Shortlist , number theory , Divisibility , Modulo Arithmetic , counting in two ways , Integer Polynomial
Let $a_1 < a_2 < \cdots <a_n$ be pairwise coprime positive integers with $a_1$ being prime and $a_1 \ge n + 2$. On the segment $I = [0, a_1 a_2 \cdots a_n ]$ of the real line, mark all integers that are divisible by at least one of the numbers $a_1 , \ldots , a_n$ . These points split $I$ into a number of smaller segments. Prove that the sum of the squares of the lengths of these segments is divisible by $a_1$. [i]Proposed by Serbia[/i]

1985 Spain Mathematical Olympiad, 7
Tags: polynomial , roots , Integer Polynomial , polynomial equation , algebra
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$.

2013 Balkan MO Shortlist, A4
Tags: Integer Polynomial , polynomial , algebra
Find all positive integers $n$ such that there exist non-constant polynomials with integer coefficients $f_1(x),...,f_n(x)$ (not necessarily distinct) and $g(x)$ such that $$1 + \prod_{k=1}^{n}\left(f^2_k(x)-1\right)=(x^2+2013)^2g^2(x)$$

1997 Abels Math Contest (Norwegian MO), 4
Tags: algebra , polynomial , Integer , Integer Polynomial
Let $p(x)$ be a polynomial with integer coefficients. Suppose that there exist different integers $a$ and $b$ such that $f(a) = b$ and $f(b) = a$. Show that the equation $f(x) = x$ has at most one integer solution.