Found problems: 4275
Given are two monic quadratics $f(x), g(x)$ such that $f, g, f+g$ have two distinct real roots. Suppose that the difference of the roots of $f$ is equal to the difference of the roots of $g$. Prove that the difference of the roots of $f+g$ is not bigger than the above common difference.
Let $n$ be the number of polynomial functions from the integers modulo $2010$ to the integers modulo $2010$. $n$ can be written as $n = p_1 p_2 \cdots p_k$, where the $p_i$s are (not necessarily distinct) primes. Find $p_1 + p_2 + \cdots + p_n$.
Let $\mathcal{P}$ be a set of monic polynomials with integer coefficients of the least degree, with root $k \cdot \cos\left(\frac{4\pi}{7}\right)$, as $k$ spans over the positive integers. Let $P(x) \in \mathcal{P}$ be the polynomial so that $|P(1)|$ is minimized. Find the remainder when $P(2017)$ is divided by $1000$.
[i]Proposed by [b] eisirrational [/b][/i]
The roots of the polynomial $P(x) = x^3 + 5x + 4$ are $r$, $s$, and $t$. Evaluate $(r+s)^4 (s+t)^4 (t+r)^4$.
[i]Proposed by Eugene Chen
[/i]
Let $n \ge 2$ be an integer and $f_1(x), f_2(x), \ldots, f_{n}(x)$ a sequence of polynomials with integer coefficients. One is allowed to make moves $M_1, M_2, \ldots $ as follows: in the $k$-th move $M_k$ one chooses an element $f(x)$ of the sequence with degree of $f$ at least $2$ and replaces it with $(f(x) - f(k))/(x-k)$. The process stops when all the elements of the sequence are of degree $1$. If $f_1(x) = f_2(x) = \cdots = f_n(x) = x^n + 1$, determine whether or not it is possible to make appropriate moves such that the process stops with a sequence of $n$ identical polynomials of degree 1.
The polynomial $x^k + a_1x^{k-1} + a_2x^{k-2} +... + a_k$ has $k$ distinct real roots. Show that $a_1^2 > \frac{2ka_2}{k-1}$.
$\definecolor{A}{RGB}{255,0,0}\color{A}\fbox{A6.}$ Let $ P (x)$ be a polynomial with real coefficients such that $\deg P \ge 3$ is an odd integer. Let $f : \mathbb{R}\rightarrow\mathbb{Z}$ be a function such that
$$\definecolor{A}{RGB}{0,0,200}\color{A}\forall_{x\in\mathbb{R}}\ f(P(x)) = P(f(x)).$$
$\definecolor{A}{RGB}{255,150,0}\color{A}\fbox{(a)}$ Prove that the range of $f$ is finite.
$\definecolor{A}{RGB}{255,150,0}\color{A}\fbox{(b)}$ Show that for any positive integer $n$, there exist $P$, $f$ that satisfies the above condition and also that the range of $f$ has cardinality $n$.
[i]Proposed by [/i][b][color=#419DAB]ltf0501[/color][/b].
[color=#3D9186]#1735[/color]
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$
Suppose that $P(x)$ is a polynomial with degree $10$ and integer coefficients.
Prove that, there is an infinite arithmetic progression (open to bothside) not contain value of $P(k)$ with $k\in\mathbb{Z}$
For each positive integer $n$, define $f(n)$ to be the least positive integer for which the following holds:
For any partition of $\{1,2,\dots, n\}$ into $k>1$ disjoint subsets $A_1, \dots, A_k$, [u]all of the same size[/u], let $P_i(x)=\prod_{a\in A_i}(x-a)$. Then there exist $i\neq j$ for which
\[\deg(P_i(x)-P_j(x))\geq \frac{n}{k}-f(n)\]
a) Prove that there is a constant $c$ so that $f(n)\le c\cdot \sqrt{n}$ for all $n$.
b) Prove that for infinitely many $n$, one has $f(n)\ge \ln(n)$.
Given quadratic trinomials $P(x)=x^2+ax+b$ and $Q(x)=x^2+cx+d$, where $a>c$. It is known that for every real $t$ and $s$ with $t+s=1$ the polynomial $B(x)=tP(x)+sQ(x)$ has at least one real root.
Prove that $bc \geq ad$.
Given two monic polynomials $P(x)$ and $Q(x)$ with degrees 2016.
$P(x)=Q(x)$ has no real root. [b]Prove that P(x)=Q(x+1) has at least one real root.[/b]
For certain real numbers $a$, $b$, and $c$, the polynomial \[g(x) = x^3 + ax^2 + x + 10\] has three distinct roots, and each root of $g(x)$ is also a root of the polynomial \[f(x) = x^4 + x^3 + bx^2 + 100x + c.\] What is $f(1)$?
$\textbf{(A)}\ -9009 \qquad\textbf{(B)}\ -8008 \qquad\textbf{(C)}\ -7007 \qquad\textbf{(D)}\ -6006 \qquad\textbf{(E)}\ -5005$
$(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.$
For any positive integer $k$, denote the sum of digits of $k$ in its decimal representation by $S(k)$. Find all polynomials $P(x)$ with integer coefficients such that for any positive integer $n \geq 2016$, the integer $P(n)$ is positive and $$S(P(n)) = P(S(n)).$$
[i]Proposed by Warut Suksompong, Thailand[/i]
Let $f$ be a polynomial of degree $n$ with integer coefficients and $p$ a prime for which $f$, considered modulo $p$, is a degree-$k$ irreducible polynomial over $\mathbb{F}_p$. Show that $k$ divides the degree of the splitting field of $f$ over $\mathbb{Q}$.
Say that a positive integer is [i]sweet[/i] if it uses only the digits 0, 1, 2, 4, and 8. For instance, 2014 is sweet. There are sweet integers whose squares are sweet: some examples (not necessarily the smallest) are 1, 2, 11, 12, 20, 100, 202, and 210. There are sweet integers whose cubes are sweet: some examples (not necessarily the smallest) are 1, 2, 10, 20, 200, 202, 281, and 2424. Prove that there exists a sweet positive integer $n$ whose square and cube are both sweet, such that the sum of all the digits of $n$ is 2014.
The Fibonacci sequence $F_n$ is defined by $F_1=F_2=1$ and the recurrence relation $F_n=F_{n-1}+F_{n-2}$ for all integers $n\geq3$.
Let $m,n\geq1$ be integers. Find the minimal degree $d$ for which there exists a polynomial $f(x)=a_dx^d+a_{d-1}x^{d-1}+\dots+a_1x+a_0$, which satisfies $f(k)=F_{m+k}$ for all $k=0,1,...,n$.
Let $\alpha$ and $\beta$ be the roots of $x^{2} - qx + 1$, where $q$ is a rational number larger than $2$. Let $s_1 = \alpha + \beta$, $t_1 = 1$, and for all integers $n \geq 2$:
$s_n = \alpha^n + \beta^n$
$t_n = s_{n-1} + 2s_{n-2} + \cdot \cdot \cdot + (n - 1)s_{1} + n$
Prove that, for all odd integers $n$, $t_n$ is the square of a rational number.
For any polynomial $P(x)=a_0+a_1x+\ldots+a_kx^k$ with integer coefficients, the number of odd coefficients is denoted by $o(P)$. For $i-0,1,2,\ldots$ let $Q_i(x)=(1+x)^i$. Prove that if $i_1,i_2,\ldots,i_n$ are integers satisfying $0\le i_1<i_2<\ldots<i_n$, then: \[ o(Q_{i_{1}}+Q_{i_{2}}+\ldots+Q_{i_{n}})\ge o(Q_{i_{1}}). \]
For every positive integer $n\ge 3$, let $\phi_n$ be the set of all positive integers less than and coprime to $n$. Consider the polynomial:
$$P_n(x)=\sum_{k\in\phi_n} {x^{k-1}}.$$
a. Prove that $P_n(x)=(x^{r_n}+1)Q_n(x)$ for some positive integer $r_n$ and polynomial $Q_n(x)\in\mathbb{Z}[x]$ (not necessary non-constant polynomial).
b. Find all $n$ such that $P_n(x)$ is irreducible over $\mathbb{Z}[x]$.
Let $f(x,y)$ be a polynomial with real coefficients in the real variables $x$ and $y$ defined over the entire $xy$-plane. What are the possibilities for the range of $f(x,y)?$
Find all polynomials $P$ such that $P(x)+3P(x+2)=3P(x+1)+P(x+3)$ for all real numbers $x$.
Fix a positive integer $a > 1$. Consider triples $(f(x), g(x), h(x))$ of polynomials with integer coefficients, such that
1. $f$ is a monic polynomial with $\deg f \ge 1$.
2. There exists a positive integer $N$ such that $g(x)>0$ for $x \ge N$ and for all positive integers $n \ge N$, we have $f(n) \mid a^{g(n)} + h(n)$.
Find all such possible triples.
[i]Proposed by Mainak Ghosh and Rijul Saini[/i]
If the polynomial $ P\left(x\right)$ satisfies $ 2P\left(x\right) \equal{} P\left(x \plus{} 3\right) \plus{} P\left(x \minus{} 3\right)$ for every real number $ x$, degree of $ P\left(x\right)$ will be at most
$\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ \text{None}$