Found problems: 3597
2011 ELMO Shortlist, 6
Let $Q(x)$ be a polynomial with integer coefficients. Prove that there exists a polynomial $P(x)$ with integer coefficients such that for every integer $n\ge\deg{Q}$,
\[\sum_{i=0}^{n}\frac{!i P(i)}{i!(n-i)!} = Q(n),\]where $!i$ denotes the number of derangements (permutations with no fixed points) of $1,2,\ldots,i$.
[i]Calvin Deng.[/i]
2013 India Regional Mathematical Olympiad, 4
A polynomial is called Fermat polynomial if it can be written as the sum of squares of two polynomials with integer coefficients. Suppose that $f(x)$ is a Fermat polynomial such that $f(0)=1000$. Prove that $f(x)+2x$ is not a fermat polynomial
2021 Azerbaijan IMO TST, 1
Let $\mathcal{A}$ denote the set of all polynomials in three variables $x, y, z$ with integer coefficients. Let $\mathcal{B}$ denote the subset of $\mathcal{A}$ formed by all polynomials which can be expressed as
\begin{align*}
(x + y + z)P(x, y, z) + (xy + yz + zx)Q(x, y, z) + xyzR(x, y, z)
\end{align*}
with $P, Q, R \in \mathcal{A}$. Find the smallest non-negative integer $n$ such that $x^i y^j z^k \in \mathcal{B}$ for all non-negative integers $i, j, k$ satisfying $i + j + k \geq n$.
2012 Indonesia TST, 1
Suppose $P(x,y)$ is a homogenous non-constant polynomial with real coefficients such that $P(\sin t, \cos t) = 1$ for all real $t$. Prove that $P(x,y) = (x^2+y^2)^k$ for some positive integer $k$.
(A polynomial $A(x,y)$ with real coefficients and having a degree of $n$ is homogenous if it is the sum of $a_ix^iy^{n-i}$ for some real number $a_i$, for all integer $0 \le i \le n$.)
2014 NIMO Problems, 6
Let $P(x)$ be a polynomial with real coefficients such that $P(12)=20$ and \[ (x-1) \cdot P(16x)= (8x-1) \cdot P(8x) \] holds for all real numbers $x$. Compute the remainder when $P(2014)$ is divided by $1000$.
[i]Proposed by Alex Gu[/i]
1980 IMO, 1
Determine all positive integers $n$ such that the following statement holds: If a convex polygon with with $2n$ sides $A_1 A_2 \ldots A_{2n}$ is inscribed in a circle and $n-1$ of its $n$ pairs of opposite sides are parallel, which means if the pairs of opposite sides
\[(A_1 A_2, A_{n+1} A_{n+2}), (A_2 A_3, A_{n+2} A_{n+3}), \ldots , (A_{n-1} A_n, A_{2n-1} A_{2n})\]
are parallel, then the sides \[ A_n A_{n+1}, A_{2n} A_1\] are parallel as well.
2005 Baltic Way, 4
Find three different polynomials $P(x)$ with real coefficients such that $P\left(x^2 + 1\right) = P(x)^2 + 1$ for all real $x$.
2005 Greece National Olympiad, 1
Find the polynomial $P(x)$ with real coefficients such that $P(2)=12$ and $P(x^2)=x^2(x^2+1)P(x)$ for each $x\in\mathbb{R}$.
2013 Brazil Team Selection Test, 4
Let $a$ and $b$ be positive integers, and let $A$ and $B$ be finite sets of integers satisfying
(i) $A$ and $B$ are disjoint;
(ii) if an integer $i$ belongs to either to $A$ or to $B$, then either $i+a$ belongs to $A$ or $i-b$ belongs to $B$.
Prove that $a\left\lvert A \right\rvert = b \left\lvert B \right\rvert$. (Here $\left\lvert X \right\rvert$ denotes the number of elements in the set $X$.)
1979 IMO Longlists, 10
Find all polynomials $f(x)$ with real coefficients for which
\[f(x)f(2x^2) = f(2x^3 + x).\]
1991 French Mathematical Olympiad, Problem 5
(a) For given complex numbers $a_1,a_2,a_3,a_4$, we define a function $P:\mathbb C\to\mathbb C$ by $P(z)=z^5+a_4z^4+a_3z^3+a_2z^2+a_1z$. Let $w_k=e^{2ki\pi/5}$, where $k=0,\ldots,4$. Prove that
$$P(w_0)+P(w_1)+P(w_2)+P(w_3)+P(w_4)=5.$$(b) Let $A_1,A_2,A_3,A_4,A_5$ be five points in the plane. A pentagon is inscribed in the circle with center $A_1$ and radius $R$. Prove that there is a vertex $S$ of the pentagon for which
$$SA_1\cdot SA_2\cdot SA_3\cdot SA_4\cdot SA_5\ge R^5.$$
2015 Iran Team Selection Test, 5
Prove that for each natural number $d$, There is a monic and unique polynomial of degree $d$ like $P$ such that $P(1)$≠$0$ and for each sequence like $a_{1}$,$a_{2}$, $...$ of real numbers that the recurrence relation below is true for them, there is a natural number $k$ such that $0=a_{k}=a_{k+1}= ...$ :
$P(n)a_{1} + P(n-1)a_{2} + ... + P(1)a_{n}=0$
$n>1$
1959 AMC 12/AHSME, 48
Given the polynomial $a_0x^n+a_1x^{n-1}+\cdots+a_{n-1}x+a_n$, where $n$ is a positive integer or zero, and $a_0$ is a positive integer. The remaining $a$'s are integers or zero. Set $h=n+a_0+|a_1|+|a_2|+\cdots+|a_n|$. [See example 25 for the meaning of $|x|$.] The number of polynomials with $h=3$ is:
$ \textbf{(A)}\ 3\qquad\textbf{(B)}\ 5\qquad\textbf{(C)}\ 6\qquad\textbf{(D)}\ 7\qquad\textbf{(E)}\ 9 $
2020 Iran Team Selection Test, 1
We call a monic polynomial $P(x) \in \mathbb{Z}[x]$ [i]square-free mod n[/i] if there [u]dose not[/u] exist polynomials $Q(x),R(x) \in \mathbb{Z}[x]$ with $Q$ being non-constant and $P(x) \equiv Q(x)^2 R(x) \mod n$. Given a prime $p$ and integer $m \geq 2$. Find the number of monic [i]square-free mod p[/i] $P(x)$ with degree $m$ and coeeficients in $\{0,1,2,3,...,p-1\}$.
[i]Proposed by Masud Shafaie[/i]
2012 China National Olympiad, 2
Let $p$ be a prime. We arrange the numbers in ${\{1,2,\ldots ,p^2} \}$ as a $p \times p$ matrix $A = ( a_{ij} )$. Next we can select any row or column and add $1$ to every number in it, or subtract $1$ from every number in it. We call the arrangement [i]good[/i] if we can change every number of the matrix to $0$ in a finite number of such moves. How many good arrangements are there?
1997 Tournament Of Towns, (545) 6
Prove that if $F(x)$ and $G(x)$ are polynomials with coefficients $0$ and $1$ such that $$F(x)G(x) = 1 +x + x^2 +...+ x^{n-1}$$
holds for some $n > 1$, then one of them can be represented in the form
$$ (1 +x + x^2 +...+ x^{k-1}) T(x)$$
for some $k > 1$ where $T(x)$ is a polynomial with coefficients $0$ and $1$.
(V Senderov, M Vialiy)
2011 IMC, 4
Let $f$ be a polynomial with real coefficients of degree $n$. Suppose that $\displaystyle \frac{f(x)-f(y)}{x-y}$ is an integer for all $0 \leq x<y \leq n$. Prove that $a-b | f(a)-f(b)$ for all distinct integers $a,b$.
1976 IMO Longlists, 48
The polynomial $1976(x+x^2+ \cdots +x^n)$ is decomposed into a sum of polynomials of the form $a_1x + a_2x^2 + \cdots + a_nx^n$, where $a_1, a_2, \ldots , a_n$ are distinct positive integers not greater than $n$. Find all values of $n$ for which such a decomposition is possible.
1988 Dutch Mathematical Olympiad, 1
The real numbers $x_1,x_2,..., x_n$ and $a_0,a_1,...,a_{n-1}$ with $x_i \ne 0$ for $i \in\{1,2,.., n\}$ are such that
$$(x-x_1)(x-x_2)...(x-x_n)=x^n+a_{n-1}x^{n-1}+...+a_1x+a_0$$
Express $x_1^{-2}+x_2^{-2}+...+ x_n^{-2}$ in terms of $a_0,a_1,...,a_{n-1}$.
2003 India IMO Training Camp, 6
A zig-zag in the plane consists of two parallel half-lines connected by a line segment. Find $z_n$, the maximum number of regions into which $n$ zig-zags can divide the plane. For example, $z_1=2,z_2=12$(see the diagram). Of these $z_n$ regions how many are bounded? [The zig-zags can be as narrow as you please.] Express your answers as polynomials in $n$ of degree not exceeding $2$.
[asy]
draw((30,0)--(-70,0), Arrow);
draw((30,0)--(-20,-40));
draw((-20,-40)--(80,-40), Arrow);
draw((0,-60)--(-40,20), dashed, Arrow);
draw((0,-60)--(0,15), dashed);
draw((0,15)--(40,-65),dashed, Arrow);
[/asy]
2001 Nordic, 3
Determine the number of real roots of the equation
${x^8 -x^7 + 2x^6- 2x^5 + 3x^4 - 3x^3 + 4x^2 - 4x + \frac{5}{2}= 0}$
2010 Romanian Master of Mathematics, 4
Determine whether there exists a polynomial $f(x_1, x_2)$ with two variables, with integer coefficients, and two points $A=(a_1, a_2)$ and $B=(b_1, b_2)$ in the plane, satisfying the following conditions:
(i) $A$ is an integer point (i.e $a_1$ and $a_2$ are integers);
(ii) $|a_1-b_1|+|a_2-b_2|=2010$;
(iii) $f(n_1, n_2)>f(a_1, a_2)$ for all integer points $(n_1, n_2)$ in the plane other than $A$;
(iv) $f(x_1, x_2)>f(b_1, b_2)$ for all integer points $(x_1, x_2)$ in the plane other than $B$.
[i]Massimo Gobbino, Italy[/i]
2013 Miklós Schweitzer, 2
Prove there exists a constant $k_0$ such that for any $k\ge k_0$, the equation
\[a^{2n}+b^{4n}+2013=ka^nb^{2n}\]
has no positive integer solutions $a,b,n$.
[i]Proposed by István Pink.[/i]
2003 Manhattan Mathematical Olympiad, 4
Let $p$ and $a$ be positive integer numbers having no common divisors except of $1$. Prove that $p$ is prime if and only if all the coefficients of the polynomial \[ F(x) = (x-a)^p - (x^p - a) \] are divisible by $p$.
2007 Hong kong National Olympiad, 2
is there any polynomial of $deg=2007$ with integer coefficients,such that for any integer $n$,$f(n),f(f(n)),f(f(f(n))),...$ is coprime to each other?