Found problems: 4275
Six members of the team of Fatalia for the International Mathematical Olympiad are selected from $13$ candidates. At the TST the candidates got $a_1,a_2, \ldots, a_{13}$ points with $a_i \neq a_j$ if $i \neq j$.
The team leader has already $6$ candidates and now wants to see them and nobody other in the team. With that end in view he constructs a polynomial $P(x)$ and finds the creative potential of each candidate by the formula $c_i = P(a_i)$.
For what minimum $n$ can he always find a polynomial $P(x)$ of degree not exceeding $n$ such that the creative potential of all $6$ candidates is strictly more than that of the $7$ others?
[i]Proposed by F. Petrov, K. Sukhov[/i]
Let $b$ and $c$ be real numbers and define the polynomial $P(x)=x^2+bx+c$. Suppose that $P(P(1))=P(P(2))=0$, and that $P(1) \neq P(2)$. Find $P(0)$.
Let $P(x)=a_d x^d+\dots+a_1 x+a_0$ be a non-constant polynomial with non-negative integer coefficients having $d$ rational roots.Prove that $$\text{lcm} \left(P(m),P(m+1),\dots,P(n) \right)\geq m \dbinom{n}{m}$$ for all $n>m$
[i](Navid Safaei, Iran)[/i]
As usual, let ${\mathbb Z}[x]$ denote the set of single-variable polynomials in $x$ with integer coefficients. Find all functions $\theta : {\mathbb Z}[x] \to {\mathbb Z}$ such that for any polynomials $p,q \in {\mathbb Z}[x]$, [list] [*]$\theta(p+1) = \theta(p)+1$, and [*]if $\theta(p) \neq 0$ then $\theta(p)$ divides $\theta(p \cdot q)$. [/list]
[i]Evan Chen and Yang Liu[/i]
Find all polynomials $P$ with real coefficients which satisfy
\[P(x)P(x+1)=P(x^2-x+3) \quad \forall x \in \mathbb{R}\]
The graph of $y=f(x)$, where $f(x)$ is a polynomial of degree $3$, contains points $A(2,4)$, $B(3,9)$, and $C(4,16)$. Lines $AB$, $AC$, and $BC$ intersect the graph again at points $D$, $E$, and $F$, respectively, and the sum of the $x$-coordinates of $D$, $E$, and $F$ is $24$. What is $f(0)$?
$\textbf{(A) } -2 \qquad \textbf{(B) } 0 \qquad \textbf{(C) } 2 \qquad \textbf{(D) } \frac{24}{5} \qquad \textbf{(E) } 8$
Let $F_m$ be the $m$'th Fibonacci number, defined by $F_1=F_2=1$ and $F_m = F_{m-1}+F_{m-2}$ for all $m \geq 3$. Let $p(x)$ be the polynomial of degree 1008 such that $p(2n+1)=F_{2n+1}$ for $n=0,1,2,\ldots,1008$. Find integers $j$ and $k$ such that $p(2019) = F_j - F_k$.
The roots of the two monic square trinomials are negative integers, and one of these roots is common. Can the values of these trinomials at some positive integer point equal 19 and 98?
For $n\geq 1$ let $M$ be an $n\times n$ complex array with distinct eigenvalues $\lambda_1,\lambda_2,\ldots,\lambda_k$, with multiplicities $m_1,m_2,\ldots,m_k$ respectively. Consider the linear operator $L_M$ defined by $L_MX=MX+XM^T$, for any complex $n\times n$ array $X$. Find its eigenvalues and their multiplicities. ($M^T$ denotes the transpose matrix of $M$).
A polynomial $p(x)$ has remainder three when divided by $x-1$ and remainder five when divided by $x-3$. The remainder when $p(x)$ is divided by $(x-1)(x-3)$ is
$\textbf{(A) }x-2\qquad\textbf{(B) }x+2\qquad\textbf{(C) }2\qquad\textbf{(D) }8\qquad \textbf{(E) }15$
Let $a_1(x), a_2(x)$, and $a_3(x)$ be three polynomials with integer coefficients such that every polynomial with integer coefficients can be written in the form $p_1(x)a_1(x) + p_2(x)a_2(x) + p_3(x)a_3(x)$ for some polynomials $p_1(x), p_2(x), p_3(x)$ with integer coefficients. Show that every polynomial is of the form $p_1(x)a_1(x)^2 + p_2(x)a_2(x)^2 + p_3(x)a_3(x)^2$ for some polynomials $p_1(x), p_2(x), p_3(x)$ with integer coefficients.
Let $m, n$ be positive integers, define:
$f(x)=(x-1)(x^2-1)\cdots(x^m-1)$, $g(x)=(x^{n+1}-1)(x^{n+2}-1)\cdots(x^{n+m}-1)$.
Show that there exists a polynomial $h(x)$ of degree $mn$ such that $f(x)h(x)=g(x)$, and its $mn+1$ coefficients are all positive integers.
Let K be the field formed by the addition of a root of the polynomial $x^4 - 2x^2 - 1$ to the rational field. Prove that there are no exceptional units in the ring of integers of K. (A unit $\varepsilon$ is called exceptional if $1-\varepsilon$ is also a unit.)
Let $h(t)$ and $f(t)$ be polynomials such that $h(t)=t^2$ and $f_n(t)=h(h(h(h(h...h(t))))))-1$ where $h(t)$ occurs $n$ times. Prove that $f_n(t)$ is a factor of $f_N(t)$ whenever $n$ is a factor of $N$
Consider a polynomial $P(x,y,z)$ in three variables with integer coefficients such that for any real numbers $a,b,c,$ $$P(a,b,c)=0 \Leftrightarrow a=b=c.$$
Find the largest integer $r$ such that for all such polynomials $P(x,y,z)$ and integers $m,n,$ $$m^r\mid P(n,n+m,n+2m).$$
[i]Proposed by Ma Zhao Yu
Show that the polynomial $x^{8} +98 x^{4}+1$ can be expressed as the product of two nonconstant polynomials with integer coefficients.
Let $k$ be an odd number that is greater than or equal to $3$. Prove that there exists a $k^{th}$-degree integer-valued polynomial with non-integer-coefficients that has the following properties:
(1) $f(0)=0$ and $f(1)=1$; and.
(2) There exist infinitely many positive integers $n$ so that if the following equation: \[ n= f(x_1)+\cdots+f(x_s), \] has integer solutions $x_1, x_2, \dots, x_s$, then $s \geq 2^k-1$.
Let $S$ be the set of all polynomials $Q(x,y,z)$ with coefficients in $\{0,1\}$ such that there exists a homogeneous polynomial $P(x,y,z)$ of degree $2016$ with integer coefficients and a polynomial $R(x,y,z)$ with integer coefficients so that \[P(x,y,z) Q(x,y,z) = P(yz,zx,xy)+2R(x,y,z)\] and $P(1,1,1)$ is odd. Determine the size of $S$.
Note: A homogeneous polynomial of degree $d$ consists solely of terms of degree $d$.
[i]Proposed by Vincent Huang[/i]
Determine all polynomials $P(x,y)$ with real coefficients such that
\[P(x+y,x-y)=2P(x,y) \qquad \forall x,y\in\mathbb{R}.\]
A polynomial $ f(x)\equal{}x^3\plus{}ax^2\plus{}bx\plus{}c$ is such that $ b<0$ and $ ab\equal{}9c$. Prove that the polynomial $ f$ has three different real roots.
Let $f(x) = ax^7+bx^3+cx-5$, where $a,b$ and $c$ are constants. If $f(-7) = 7$, the $f(7)$ equals
$\textbf {(A) } -17 \qquad \textbf {(B) } -7 \qquad \textbf {(C) } 14 \qquad \textbf {(D) } 21\qquad \textbf {(E) } \text{not uniquely determined}$
Let $q$ be a monic polynomial with integer coefficients. Prove that there exists a constant $C$ depending only on polynomial $q$ such that for an arbitrary prime number $p$ and an arbitrary positive integer $N \leq p$ the congruence $n! \equiv q(n) \pmod p$ has at most $CN^\frac {2}{3}$ solutions among any $N$ consecutive integers.
For each integer $m$, consider the polynomial \[ P_m(x)=x^4-(2m+4)x^2+(m-2)^2. \] For what values of $m$ is $P_m(x)$ the product of two non-consant polynomials with integer coefficients?
Find all polynomials $P$ with integer coefficients such that for all positive integers $x,y$, $$\frac{P(x)-P(y)}{x^2+y^2}$$ evaluates to an integer (in particular, it can be zero).
Determine all polynomials $P(x) \in \mathbb R[x]$ satisfying the following two conditions :
(a) $P(2017) = 2016$ and
(b) $(P(x) + 1)^2 = P(x^2 + 1)$ for all real numbers $x$.
[i]proposed by Walther Janous[/i]