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: 3597

1988 Bulgaria National Olympiad, Problem 6

Find all polynomials $p(x)$ satisfying $p(x^3+1)=p(x+1)^3$ for all $x$.

2017 Middle European Mathematical Olympiad, 1

Determine all pairs of polynomials $(P, Q)$ with real coefficients satisfying $$P(x + Q(y)) = Q(x + P(y))$$ for all real numbers $x$ and $y$.

2019 India PRMO, 2

If $x=\sqrt2+\sqrt3+\sqrt6$ is a root of $x^4+ax^3+bx^2+cx+d=0$ where $a,b,c,d$ are integers, what is the value of $|a+b+c+d|$?

2016 Polish MO Finals, 1

Let $p$ be a certain prime number. Find all non-negative integers $n$ for which polynomial $P(x)=x^4-2(n+p)x^2+(n-p)^2$ may be rewritten as product of two quadratic polynomials $P_1, \ P_2 \in \mathbb{Z}[X]$.

1977 USAMO, 3

If $ a$ and $ b$ are two of the roots of $ x^4\plus{}x^3\minus{}1\equal{}0$, prove that $ ab$ is a root of $ x^6\plus{}x^4\plus{}x^3\minus{}x^2\minus{}1\equal{}0$.

1969 IMO Longlists, 66

$(USS 3)$ $(a)$ Prove that if $0 \le a_0 \le a_1 \le a_2,$ then $(a_0 + a_1x - a_2x^2)^2 \le (a_0 + a_1 + a_2)^2\left(1 +\frac{1}{2}x+\frac{1}{3}x^2+\frac{1}{2}x^3+x^4\right)$ $(b)$ Formulate and prove the analogous result for polynomials of third degree.

2008 Hong kong National Olympiad, 1

Let $ f(x) \equal{} c_m x^m \plus{} c_{m\minus{}1} x^{m\minus{}1} \plus{}...\plus{} c_1 x \plus{} c_0$, where each $ c_i$ is a non-zero integer. Define a sequence $ \{ a_n \}$ by $ a_1 \equal{} 0$ and $ a_{n\plus{}1} \equal{} f(a_n)$ for all positive integers $ n$. (a) Let $ i$ and $ j$ be positive integers with $ i<j$. Show that $ a_{j\plus{}1} \minus{} a_j$ is a multiple of $ a_{i\plus{}1} \minus{} a_i$. (b) Show that $ a_{2008} \neq 0$

1999 Yugoslav Team Selection Test, Problem 1

For a natural number $n$, let $P(x)$ be the polynomial of $2n$−th degree such that: $P(0) = 1$ and $P(k) = 2^{k-1}$ for $k = 1, 2, . . . , 2n$. Prove that $2P(2n + 1) - P(2n + 2) = 1$. P.S. I tried to prove it by firstly expressing this polynomial using Lagrange interpolation but get bored of computations - it seems like it can be done this way, but I'd like to see more 'clever' solution. :)

2006 All-Russian Olympiad Regional Round, 10.4

Given $n > 1$ monic square trinomials $x^2 - a_1x + b_1$,$...$, $x^2-a_nx + b_n$, and all $2n$ numbers are $a_1$,$...$, $a_n$, $b_1$,$...$, $b_n$ are different. Can it happen that each of the numbers $a_1$,$...$, $a_n$, $b_1$,$...$, $b_n is the root of one of these trinomials?

2023 4th Memorial "Aleksandar Blazhevski-Cane", P1

Let $a, b, c, d$ be integers. Prove that for any positive integer $n$, there are at least $\left \lfloor{\frac{n}{4}}\right \rfloor $ positive integers $m \leq n$ such that $m^5 + dm^4 + cm^3 + bm^2 + 2023m + a$ is not a perfect square. [i]Proposed by Ilir Snopce[/i]

2005 Serbia Team Selection Test, 3

Find all polynomial with real coefficients such that: P(x^2+1)=P(x)^2+1

2015 VJIMC, 3

[b]Problem 3[/b] Let $ P(x) = x^{2015} -2x^{2014}+1$ and $ Q(x) = x^{2015} -2x^{2014}-1$. Determine for each of the polynomials $P$ and $Q$ whether it is a divisor of some nonzero polynomial $c_0 + c_{1}x +\ldots + c_{n}x^n$ n whose coefficients $c_i$ are all in the set $ \{ -1, 1\}$.

1969 IMO Shortlist, 24

$(GBR 1)$ The polynomial $P(x) = a_0x^k + a_1x^{k-1} + \cdots + a_k$, where $a_0,\cdots, a_k$ are integers, is said to be divisible by an integer $m$ if $P(x)$ is a multiple of $m$ for every integral value of $x$. Show that if $P(x)$ is divisible by $m$, then $a_0 \cdot k!$ is a multiple of $m$. Also prove that if $a, k,m$ are positive integers such that $ak!$ is a multiple of $m$, then a polynomial $P(x)$ with leading term $ax^k$can be found that is divisible by $m.$

2025 India STEMS Category B, 1

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]

2001 Iran MO (2nd round), 1

Find all polynomials $P$ with real coefficients such that $\forall{x\in\mathbb{R}}$ we have: \[ P(2P(x))=2P(P(x))+2(P(x))^2. \]

2000 Swedish Mathematical Competition, 2

$p(x)$ is a polynomial such that $p(y^2+1) = 6y^4 - y^2 + 5$. Find $p(y^2-1)$.

1976 Euclid, 4

Source: 1976 Euclid Part B Problem 4 ----- The remainder when $f(x)=x^5-2x^4+ax^3-x^2+bx-2$ is divided by $x+1$ is $-7$. When $f(x)$ is divided by $x-2$ the remainder is $32$. Determine the remainder when $f(x)$ is divided by $x-1$.

2021 Malaysia IMONST 1, 14

Given a function $p(x) = ax^5 + bx^4 + cx^3 + dx^2 + ex + f$. Each coefficient $a, b, c, d, e$, and$ f$ is equal to either $ 1$ or $-1$. If $p(2) = 11$, what is the value of $p(3)$?

1999 Putnam, 5

Prove that there is a constant $C$ such that, if $p(x)$ is a polynomial of degree $1999$, then \[|p(0)|\leq C\int_{-1}^1|p(x)|\,dx.\]

2011 India National Olympiad, 3

Let $P(x)=a_nx^n+a_{n-1}x^{n-1}+\cdots+a_0$ and $Q(x)=b_nx^n+b_{n-1}x^{n-1}+\cdots+b_0$ be two polynomials with integral coefficients such that $a_n-b_n$ is a prime and $a_nb_0-a_0b_n\neq 0,$ and $a_{n-1}=b_{n-1}.$ Suppose that there exists a rational number $r$ such that $P(r)=Q(r)=0.$ Prove that $r\in\mathbb Z.$

2007 iTest Tournament of Champions, 5

A polynomial $p(x)$ of degree $1000$ is such that $p(n) = (n+1)2^n$ for all nonnegative integers $n$ such that $n\leq 1000$. Given that \[p(1001) = a\cdot 2^b - c,\] where $a$ is an odd integer, and $0 < c < 2007$, find $c-(a+b)$.

2020 OMpD, 3

Determine all integers $n$ such that both of the numbers: $$|n^3 - 4n^2 + 3n - 35| \text{ and } |n^2 + 4n + 8|$$ are both prime numbers.

2014 BMT Spring, 2

Find the smallest positive value of $x$ such that $x^3-9x^2+22x-16=0$.

1988 Poland - Second Round, 1

Let $ f(x) $ be a polynomial, $ n $ - a natural number. Prove that if $ f(x^{n}) $ is divisible by $ x-1 $, then it is also divisible by $ x^{n-1} + x^{n-2} + \ldots + x + $1.

2012-2013 SDML (High School), 13

A polynomial $P$ is called [i]level[/i] if it has integer coefficients and satisfies $P\left(0\right)=P\left(2\right)=P\left(5\right)=P\left(6\right)=30$. What is the largest positive integer $d$ such that for any level polynomial $P$, $d$ is a divisor of $P\left(n\right)$ for all integers $n$? $\text{(A) }1\qquad\text{(B) }2\qquad\text{(C) }3\qquad\text{(D) }6\qquad\text{(E) }10$