Found problems: 3597
Find all polynomials $ P (x) $ with real coefficients that satisfy the identity $ P (x ^ 2) = P (x) P (x + 1) $.
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.
Prove that every polynomial is a difference of two increasing polynomials.
Given a polynomial with integer coefficients $$P(x) = x^{20} + a_{19}x^{19} +... + a_1x + a_0,$$ having $20$ different real roots. Determine the maximum number of roots such a polynomial $P$ can have in the interval $(99, 100)$.
A circle is divided into arcs of equal size by $n$ points ($n \ge 1$). For any positive integer $x$, let $P_n(x)$ denote the number of possibilities for colouring all those points, using colours from $x$ given colours, so that any rotation of the colouring by $ i \cdot \frac{360^o}{n}$ , where i is a positive integer less than $n$, gives a colouring that differs from the original in at least one point. Prove that the function $P_n(x)$ is a polynomial with respect to $x$.
Let $P_1$, $P_2$ and $P_3$ be polynomials of degree two with positive coefficient leader and real roots . Prove that if each pair of polynomials has a common root , then the polynomial $P_1 + P_2 + P_3$ has also real roots.
Is there a quadratic trinomial $f(x)$ with integer coefficients such that $f(f(\sqrt{2}))=0$ ?
[i]A. Khrabrov[/i]
Let $A$ be a real $n\times n$ Matrix and define $e^{A}=\sum_{k=0}^{\infty} \frac{A^{k}}{k!}$
Prove or disprove that for any real polynomial $P(x)$ and any real matrices $A,B$,
$P(e^{AB})$ is nilpotent if and only if $P(e^{BA})$ is nilpotent.
Show that if the last digit of the number $x^2+xy+y^2$ is $0$ (where $x,y\in\mathbb{N}$ ) then last two digits are zero.
Evaluate the sum $\sqrt{1-\frac{1}{2}\cdot\sqrt{1\cdot3}}+\sqrt{2-\frac{1}{2}\cdot\sqrt{3\cdot5}}+\sqrt{3-\frac{1}{2}\cdot\sqrt{5\cdot7}}+\dots+\sqrt{40-\frac{1}{2}\cdot\sqrt{79\cdot81}}$.
$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$
Let $ P (x) $ and $ Q (x) $ be polynomials with real coefficients such that $ P (0)> 0 $ and all coefficients of the polynomial $ S (x) = P (x) \cdot Q (x) $ are integers. Prove that for any positive $ x $ the inequality holds:
$$S ({{x} ^ {2}}) - {{S} ^ {2}} (x) \le \frac {1} {4} ({{P} ^ {2}} ({{ x} ^ {3}}) + Q ({{x} ^ {3}})). $$
Let $P(x)$ be a polynomial with real coefficients. Prove that not all roots of $x^3P(x)+1$ are real.
$k$ and $n$ are positive integers that are greater than $1$. $N$ is the set of positive integers. $A_1, A_2, \cdots A_k$ are pairwise not-intersecting subsets of $N$ and $A_1 \cup A_2 \cup \cdots \cup A_k = N$.
Prove that for some $i \in \{ 1,2,\cdots,k \}$, there exsits infinity many non-factorable n-th degree polynomials so that coefficients of one polynomial are pairwise distinct and all the coeficients are in $A_i$.
A quadratic polynomial $p(x)$ with real coefficients and leading coefficient $1$ is called disrespectful if the equation $p(p(x)) = 0$ is satisfied by exactly three real numbers. Among all the disrespectful quadratic polynomials, there is a unique such polynomial $\tilde{p}(x)$ for which the sum of the roots is maximized. What is $\tilde{p}(1)?$
$\textbf{(A) }\dfrac5{16} \qquad \textbf{(B) }\dfrac12 \qquad \textbf{(C) }\dfrac58 \qquad \textbf{(D) }1 \qquad \textbf{(E) }\dfrac98$
The equation $P(x) = 0$, where $P(x) = x^2+bx+c$, has a single root, and the equation $P(P(P(x))) = 0$ has exactly three different roots. Solve the equation $P(P(P(x))) = 0.$
With $\sigma (n)$ we denote the sum of natural divisors of the natural number $n$. Prove that, if $n$ is the product of different prime numbers of the form $2^k-1$ for $k \in \mathbb{N}$($Mersenne's$ prime numbers) , than $\sigma (n)=2^m$, for some $m \in \mathbb{N}$. Is the inverse statement true?
Find all polynomials with integer coefficients such that for all positive integers $n$ satisfies $P(n!)=|P(n)|!$
Let $a_{i}$ and $b_{i}$ ($i=1,2, \cdots, n$) be rational numbers such that for any real number $x$ there is:
\[x^{2}+x+4=\sum_{i=1}^{n}(a_{i}x+b)^{2}\]
Find the least possible value of $n$.
Determine all monic polynomials $P(x)$ of degree $3$ with coefficients integers, which are divisible by $x-1$, when divided by $ x-5$ leave the same remainder as when divided by$ x+5$ and have a root between $2$ and $3$.
A polynomial $ f(x)\equal{}ax^4\plus{}bx^3\plus{}cx^2\plus{}dx$ with $ a,b,c,d>0$ is such that $ f(x)$ is an integer for $ x \in \{ \minus{}2,\minus{}1,0,1,2 \}$ and $ f(1)\equal{}1$ and $ f(5)\equal{}70$.
$ (a)$ Show that $ a\equal{}\frac{1}{24}, b\equal{}\frac{1}{4},c\equal{}\frac{11}{24},d\equal{}\frac{1}{4}$.
$ (b)$ Prove that $ f(x)$ is an integer for all $ x \in \mathbb{Z}$.
Let
$ f(x)\equal{}\sum_{k\equal{}1}^n a_k x^k$ and $ g(x)\equal{}\sum_{k\equal{}1}^n \frac{a_k x^k}{2^k \minus{}1}$ be two polynomials with real coefficients.
Let g(x) have $ 0,2^{n\plus{}1}$ as two of its roots. Prove That $ f(x)$ has a positive root less than $ 2^n$.
Consider sequences that consist entirely of $ A$'s and $ B$'s and that have the property that every run of consecutive $ A$'s has even length, and every run of consecutive $ B$'s has odd length. Examples of such sequences are $ AA$, $ B$, and $ AABAA$, while $ BBAB$ is not such a sequence. How many such sequences have length 14?
The roots of $ x(x^2\plus{}8x\plus{}16)(4\minus{}x)\equal{}0$ are:
$ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 0,4 \qquad\textbf{(C)}\ 0,4,\minus{}4 \qquad\textbf{(D)}\ 0,4,\minus{}4,\minus{}4 \qquad\textbf{(E)}\ \text{none of these}$
Suppose $f(x)$ is a polynomial with integer coefficients such that $f(0) = 11$ and $f(x_1) = f(x_2) = ... = f(x_n) = 2002$ for some distinct integers $x_1, x_2, . . . , x_n$. Find the largest possible value of $n$.