Found problems: 3597
Is there any polynomial $P(x)$ with degree $n$ such that $ \underbrace{P(...(P(x))...)}_{m\,\, times \,\, P}$ has all roots from $1,2,..., mn$ ?
Prove that if for a polynomial $P(x, y)$, we have
\[P(x - 1, y - 2x + 1) = P(x, y),\]
then there exists a polynomial $\Phi(x)$ with $P(x, y) = \Phi(y - x^2).$
The polynomials $P$, $Q$, $R$ with real coefficients, one of which is degree $2$ and two of degree $3$, satisfy the equality $P^2+Q^2=R^2$. Prove that one of the polynomials of degree $3$ has three real roots.
Find all real numbers$p, q$ for which the polynomial equation $P(x) = x^4 - \frac{8p^2}{q}x^3 + 4qx^2 - 3px + p^2 = 0$ has four positive roots.
Let $P, Q,R$ be three polynomials with real coefficients such that \[P(Q(x)) + P(R(x))=\text{constant}\] for all $x$. Prove that $P(x)=\text{constant}$ or $Q(x)+R(x)=\text{constant}$ for all $x$.
Let $a < b$ be positive integers. Prove that there is a positive integer $n{}$ and a polynomial of the form \[\pm1\pm x\pm x^2\pm\cdots\pm x^n,\]divisible by the polynomial $1+x^a+x^b$.
Let $a,b,c$ be real numbers with $a$ non-zero. It is known that the real numbers $x_1,x_2,\ldots,x_n$ satisfy the $n$ equations:
\[ ax_1^2+bx_1+c = x_{2} \]\[ ax_2^2+bx_2 +c = x_3\]\[ \ldots \quad \ldots \quad \ldots \quad \ldots\]\[ ax_n^2+bx_n+c = x_1 \] Prove that the system has [b]zero[/b], [u]one[/u] or [i]more than one[/i] real solutions if $(b-1)^2-4ac$ is [b]negative[/b], equal to [u]zero[/u] or [i]positive[/i] respectively.
a) Divide $a^{128} - b^{128}$ by $(a + b)(a^2 + b^2)(a^4 + b^4)(a^8 + b^8)(a^{16} + b^{16})(a^{32} + b^{32})(a^{64} + b^{64}) $.
b) Divide $a^{2^k} - b^{2^k}$ by $(a + b)(a^2 + b^2)(a^4 + b^4) ... (a^{2^{k-1}} + b^{2^{k-1}})$
For each non-negative integer $n$, $F_n(x)$ is a polynomial in $x$ of degree $n$. Prove that if the identity
\[F_n(2x)=\sum_{r=0}^{n} (-1)^{n-r} \binom nr 2^r F_r(x)\]
holds for each n, then
\[F_n(tx)=\sum_{r=0}^{n} \binom nr t^r (1-t)^{n-r} F_r(x)\]
Find all integers $ k$ such that for infinitely many integers $ n \ge 3$ the polynomial
\[ P(x) =x^{n+ 1}+ kx^n - 870x^2 + 1945x + 1995\]
can be reduced into two polynomials with integer coefficients.
Let $A,B$ be matrices of dimension $2010\times2010$ which commute and have real entries, such that $A^{2010}=B^{2010}=I$, where $I$ is the identity matrix. Prove that if $\operatorname{tr}(AB)=2010$, then $\operatorname{tr}(A)=\operatorname{tr}(B)$.
A machine-shop cutting tool has the shape of a notched circle, as shown. The radius of the circle is $\sqrt{50}$ cm, the length of $AB$ is 6 cm, and that of $BC$ is 2 cm. The angle $ABC$ is a right angle. Find the square of the distance (in centimeters) from $B$ to the center of the circle.
[asy]
size(150); defaultpen(linewidth(0.65)+fontsize(11));
real r=10;
pair O=(0,0),A=r*dir(45),B=(A.x,A.y-r),C;
path P=circle(O,r);
C=intersectionpoint(B--(B.x+r,B.y),P);
draw(Arc(O, r, 45, 360-17.0312));
draw(A--B--C);dot(A); dot(B); dot(C);
label("$A$",A,NE);
label("$B$",B,SW);
label("$C$",C,SE);
[/asy]
Prove that all real roots of the polynomial
$$ P=X^{1985}-X^{1984}+1983\cdot X^{1983}+1994\cdot X^{992} -884064 $$
are positive.
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]
Let $P(x) =(x+1)^p (x-3)^q=x^n+a_1x^{n-1}+a_2x^{n-2}+...+a_{n-1}x+a_n$ where $p$ and $q$ are positive integers
a) Given $a_1=a_2$, prove that $3n$ is a perfect square.
b) Prove that there exist infinitely many pairs $(p, q)$ of positive integers p and q such that the equality $a_1=a_2$ is valid for the polynomial $P(x)$.
(D. Bazylev)
For which quadratic polynomials $f(x)$ does there exist a quadratic polynomial $g(x)$ such that the equations $g(f(x)) = 0$ and $f(x)g(x) = 0$ have the same roots, which are mutually distinct and form an arithmetic progression?
After multiplying out and simplifying polynomial $ (x \minus{} 1)(x^2 \minus{} 1)(x^3 \minus{} 1)\cdots(x^{2007} \minus{} 1),$ getting rid of all terms whose powers are greater than $ 2007,$ we acquire a new polynomial $ f(x).$ Find its degree and the coefficient of the term having the highest power. Find the degree of $ f(x) \equal{} (1 \minus{} x)(1 \minus{} x^{2})...(1 \minus{} x^{2007})$ $ (mod$ $ x^{2008}).$
Let $a$, $b$, and $c$ be the $3$ roots of $x^3-x+1=0$. Find $\frac{1}{a+1}+\frac{1}{b+1}+\frac{1}{c+1}.$
Let $F$ be the set of all polynomials $\Gamma$ such that all the coefficients of $\Gamma (x)$ are integers and $\Gamma (x) = 1$ has integer roots. Given a positive intger $k$, find the smallest integer $m(k) > 1$ such that there exist $\Gamma \in F$ for which $\Gamma (x) = m(k)$ has exactly $k$ distinct integer roots.
Find all polynomials $P$ in two variables with real coefficients satisfying the identity
$$P(x,y)P(z,t)=P(xz-yt,xt+yz).$$
Let $ a$ be the greatest positive root of the equation $ x^3 \minus{} 3 \cdot x^2 \plus{} 1 \equal{} 0.$ Show that $ \left[a^{1788} \right]$ and $ \left[a^{1988} \right]$ are both divisible by 17. Here $ [x]$ denotes the integer part of $ x.$
Does there exist a second-degree polynomial $p(x, y)$ in two variables such that every non-negative integer $ n $ equals $p(k,m)$ for one and only one ordered pair $(k,m)$ of non-negative integers?
[i]Proposed by Finland.[/i]
Suppose the real number $\lambda \in \left( 0,1\right),$ and let $n$ be a positive integer. Prove that the modulus of all the roots of the polynomial $$f\left ( x \right )=\sum_{k=0}^{n}\binom{n}{k}\lambda^{k\left ( n-k \right )}x^{k}$$ are $1.$
Find the prime factorization of $\textstyle\sum_{1\le i < j \le 100}ij$.
Show that if the integers $a_1$; $\dots$ $a_m$ are nonzero and for each $k =0; 1; \dots ;n$ ($n < m - 1$),
$a_1 + a_22^k + a_33^k + \dots + a_mm^k = 0$; then the sequence $a_1, \dots, a_m$ contains at least $n+1$ pairs of consecutive terms having opposite signs.
[i]O. Musin[/i]