Found problems: 3597
Let $P(x)$ be a polynomial with positive integer coefficients such that $deg(P)=699$. Prove that if $P(1) \le 2022$, then there exist some consecutive coefficients such that their sum is $22$, $55$, or $77$.
Given a positive integer $ m$ and $ 0 < \delta <\pi$, construct a trigonometric polynomial $ f(x)\equal{}a_0\plus{} \sum_{n\equal{}1}^m (a_n \cos nx\plus{}b_n \sin nx)$ of degree $ m$ such that $ f(0)\equal{}1, \int_{ \delta \leq |x| \leq \pi} |f(x)|dx \leq c/m,$ and $ \max_{\minus{}\pi \leq x \leq \pi}|f'(x)| \leq c/{\delta}$, for some universal constant $ c$.
[i]G. Halasz[/i]
Determine all non-constant monic polynomials $f(x)$ with integer coefficients for which there exists a natural number $M$ such that for all $n \geq M$, $f(n)$ divides $f(2^n) - 2^{f(n)}$
[i] Proposed by Anant Mudgal [/i]
Polynomials $(P_n(X))_{n\in\mathbb{N}}$ are defined as: $$P_0(X)=0, \quad P_1(X)=X+2,$$ $$P_n(X)=P_{n-1}(X)+3P_{n-1}(X)\cdot P_{n-2}(X)+P_{n-2}(X), \quad (\forall) n\geq2.$$ Show that if $ k $ divides $m$ then $P_k(X)$ divides $P_m(X).$
Let $P(X,Y)=X^2+2aXY+Y^2$ be a real polynomial where $|a|\geq 1$. For a given positive integer $n$, $n\geq 2$ consider the system of equations: \[ P(x_1,x_2) = P(x_2,x_3) = \ldots = P(x_{n-1},x_n) = P(x_n,x_1) = 0 . \] We call two solutions $(x_1,x_2,\ldots,x_n)$ and $(y_1,y_2,\ldots,y_n)$ of the system to be equivalent if there exists a real number $\lambda \neq 0$, $x_1=\lambda y_1$, $\ldots$, $x_n= \lambda y_n$. How many nonequivalent solutions does the system have?
[i]Mircea Becheanu[/i]
Let $P(x)=c_nx^n+c_{n-1}x^{n-1}+\cdots+c_0$ be a polynomial with integer coefficients. Suppose that $r$ is a rational number such that $P(r)=0$. Show that the $n$ numbers
$c_nr, c_nr^2+c_{n-1}r, c_nr^3+c_{n-1}r^2+c_{n-1}r, \dots, c_nr^n+c_{n-1}r^{n-1}+\cdots+c_1r$
are all integers.
Problem:
Find all polynomials satisfying the equation
$ f(x^2) = (f(x))^2 $
for all real numbers x.
I'm not exactly sure where to start though it doesn't look too difficult. Thanks!
Prove that any polynomial of the form $1+a_nx^n + a_{n+1}x^{n+1} + \cdots + a_kx^k$ ($k\ge n$) has at least $n-2$ non-real roots (counting multiplicity), where the $a_i$ ($n\le i\le k$) are real and $a_k\ne 0$.
[i]David Yang.[/i]
Call a polynomial $ P(x_{1}, \ldots, x_{k})$ [i]good[/i] if there exist $ 2\times 2$ real matrices $ A_{1}, \ldots, A_{k}$ such that
$ P(x_{1}, \ldots, x_{k}) = \det \left(\sum_{i=1}^{k}x_{i}A_{i}\right).$
Find all values of $ k$ for which all homogeneous polynomials with $ k$ variables of degree 2 are good. (A polynomial is homogeneous if each term has the same total degree.)
Let $A,B,C$ be real square matrices of order $n$ such that $A^3=-I$, $BA^2+BA=C^6+C+I$ and $C$ is symmetric. Is it possible that $n=2005$?
Let $P(x)$ and $Q(x)$ be (monic) polynomials with real coefficients (the first coefficient being equal to $1$), and $\deg P(x)=\deg Q(x)=10$. Prove that if the equation $P(x)=Q(x)$ has no real solutions, then $ P(x+1)=Q(x-1) $ has a real solution.
Let $a,b,c,d \in \mathbb{N}$ such that $a \ge b \ge c \ge d $. Show that the equation $x^4 - ax^3 - bx^2 - cx -d = 0$ has no integer solution.
Let $P$ be a fourth degree polynomial, with derivative $P^\prime$, such that $P(1)=P(3)=P(5)=P^\prime (7)=0$. Find the real number $x\neq 1,3,5$ such that $P(x)=0$.
Let $r$ and $s$ be positive integers. Define $a_0 = 0$, $a_1 = 1$, and $a_n = ra_{n-1} + sa_{n-2}$ for $n \geq 2$. Let $f_n = a_1a_2\cdots a_n$. Prove that $\displaystyle\frac{f_n}{f_kf_{n-k}}$ is an integer for all integers $n$ and $k$ such that $0 < k < n$.
[i]Evan O' Dorney.[/i]
Let $P(x)$ be a non-constant polynomial with integer coefficients. Prove that there is no function $T$ from the set of integers into the set of integers such that the number of integers $x$ with $T^n(x)=x$ is equal to $P(n)$ for every $n\geq 1$, where $T^n$ denotes the $n$-fold application of $T$.
[i]Proposed by Jozsef Pelikan, Hungary[/i]
The real numbers $a$, $b$ and $c$ verify that the polynomial $p(x)=x^4+ax^3+bx^2+ax+c$ has exactly three distinct real roots; these roots are equal to $\tan y$, $\tan 2y$ and $\tan 3y$, for some real number $y$.
Find all possible values of $y$, $0\leq y < \pi$.
Given a polynomial $f(x)$ with rational coefficients, of degree $d \ge 2$, we define the sequence of sets $f^0(\mathbb{Q}), f^1(\mathbb{Q}), \ldots$ as $f^0(\mathbb{Q})=\mathbb{Q}$, $f^{n+1}(\mathbb{Q})=f(f^{n}(\mathbb{Q}))$ for $n\ge 0$. (Given a set $S$, we write $f(S)$ for the set $\{f(x)\mid x\in S\})$.
Let $f^{\omega}(\mathbb{Q})=\bigcap_{n=0}^{\infty} f^n(\mathbb{Q})$ be the set of numbers that are in all of the sets $f^n(\mathbb{Q})$, $n\geq 0$. Prove that $f^{\omega}(\mathbb{Q})$ is a finite set.
[i]Dan Schwarz, Romania[/i]
Suppose $P(x)$ is a non-constant polynomial with real coefficients, and even degree. Bob writes the polynomial $P(x)$ on a board. At every step, if the polynomial on the board is $f(x)$, he can replace it with
1. $f(x)+c$ for a real number $c$, or
2. the polynomial $P(f(x))$.
Can he always find a finite sequence of steps so the final polynomial on the board has exactly $2020$ real roots? What about $2021$?
[i]~Sutanay Bhattacharya[/i]
If $a$ and $b$ are integers such that $x^2 - x - 1$ is a factor of $ax^3 + bx^2 + 1$, then $b$ is
$ \textbf{(A)}\ -2\qquad\textbf{(B)}\ -1\qquad\textbf{(C)}\ 0\qquad\textbf{(D)}\ 1\qquad\textbf{(E)}\ 2 $
For $n \ge 3$, let $S=a_1+a_2+\cdots+a_n$ and $T=b_1b_2\cdots b_n$ for positive real numbers $a_1,a_2,\ldots,a_n, b_1,b_2 ,\ldots,b_n$, where the numbers $b_i$ are pairwise distinct.
(a) Find the number of distinct real zeroes of the polynomial
\[f(x)=(x-b_1)(x-b_2)\cdots(x-b_n)\sum_{j=1}^n \frac{a_j}{x-b_j}\]
(b) Prove the inequality
\[\frac1{n-1}\sum_{j=1}^n \left(1-\frac{a_j}{S}\right)b_j > \left(\frac{T}{S}\sum_{j=1}^{n} \frac{a_j}{b_j}\right)^{\frac1{n-1}}\]
Find all polynomials $P\in \mathbb{R}[x]$, for which $P(P(x))=\lfloor P^2 (x)\rfloor$ is true for $\forall x\in \mathbb{Z}$.
How many polynomial functions $f$ of degree $\ge 1$ satisfy
\[ f(x^2)=[f(x)]^2=f(f(x)) \ ? \]
$ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ \text{finitely many but more than 2} \\ \qquad\textbf{(E)}\ \text{infinitely many} $
Prove that for all sufficiently large positive integers $d{}$, at least $99\%$ of the polynomials of the form \[\sum_{i\leqslant d}\sum_{j\leqslant d}\pm x^iy^j\]are irreducible over the integers.
How many polynomials of the form $x^5 + ax^4 + bx^3 + cx^2 + dx + 2020$, where $a$, $b$, $c$, and $d$ are real numbers, have the property that whenever $r$ is a root, so is $\frac{-1+i\sqrt{3}}{2} \cdot r$? (Note that $i=\sqrt{-1}$)
$\textbf{(A) } 0 \qquad \textbf{(B) }1 \qquad \textbf{(C) } 2 \qquad \textbf{(D) } 3 \qquad \textbf{(E) } 4$
Let
\begin{eqnarray*} f(x) & = & a_n x^n + a_{n-1} x^{n-1} + \cdots + a_0 \ \ \mbox{and} \\ g(x) & = & c_{n+1} x^{n+1} + c_n x^n + \cdots + c_0 \end{eqnarray*}
be non-zero polynomials with real coefficients such that $g(x) = (x+r)f(x)$ for some real number $r$. If $a = \max(|a_n|, \ldots, |a_0|)$ and $c = \max(|c_{n+1}|, \ldots, |c_0|)$, prove that $\frac{a}{c} \leq n+1$.