Found problems: 3597
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}). \]
Let $P(x)$ be a quadratic polynomial with two distinct real roots.
For all real numbers $a$ and $b$ satisfying $|a|,|b| \ge 2017$, we have $P(a^2+b^2) \ge P(2ab)$.
Show that at least one of the roots of $P$ is negative.
For a natural number $n>1$ , consider the $n-1$ points on the unit circle $e^{\frac{2\pi ik}{n}}\ (k=1,2,...,n-1) $ . Show that the product of the distances of these points from $1$ is $n$.
Let $P(X)$ be a nonconstant polynomial with real coefficients such that for every rational number $q{}$ the equation $P(X)=q$ has no irrational solutions. Show that $P(X)$ is a first degree polynomial.
Let $Q$ be a quadratic polynomial. If the sum of the roots of $Q^{100}(x)$ (where $Q^i(x)$ is defined by $Q^1(x)=Q(x)$, $Q^i(x)=Q(Q^{i-1}(x))$ for integers $i\geq 2$) is $8$ and the sum of the roots of $Q$ is $S$, compute $|\log_2(S)|$.
Let $a,b,c$ be integer numbers such that $(a+b+c) \mid (a^{2}+b^{2}+c^{2})$. Show that there exist infinitely many positive integers $n$ such that $(a+b+c) \mid (a^{n}+b^{n}+c^{n})$.
[i]Laurentiu Panaitopol[/i]
Consider the polynomial $p(x)=a_nx^n+\ldots+a_1x+a_0$ with real coefficients such that $0\le a_i\le a_0$ for each $i=1,2,\ldots,n$. If $a$ is the coefficient of $x^{n+1}$ in the polynomial $q(x)=p(x)^2$, prove that $2a\le p(1)^2$.
Find the number of integer polynomials $P$ such that $P(x)^2 = P(P(x)) \forall x$.
Factor the polynomial $P (x) = 1 + x +x^2+...+x^{2^k-1}$
We call two non-constant polynomials [i]friendly[/i] if each of them has only real roots, and every root of one polynomial is also a root of the other. For two friendly polynomials \( P(x), Q(x) \) and a constant \( C \in \mathbb{R}, C \neq 0 \), it is given that \( P(x) + C \) and \( Q(x) + C \) are also friendly polynomials. Prove that \( P(x) \equiv Q(x) \).
Evaluate the following definite integral.
\[\int_{0}^{\pi}\frac{\cos nx}{2-\cos x}dx\ (n=0,\ 1,\ 2,\ \cdots)\]
Determine all possible values of $x+\frac{1}{x}$ , where the real number $x$ satisfies the equation $$x^4+5x^3-4x^2+5x+1=0$$ and solve this equation.
Let $P(x) = x^4 + ax^3 + bx^2 + cx + d$ and $Q(x) = x^2 + px + q$be two real polynomials. Suppose that there exista an interval $(r,s)$ of length greater than $2$ SUCH THAT BOTH $P(x)$ AND $Q(x)$ ARE nEGATIVE FOR $X \in (r,s)$ and both are positive for $x > s$ and $x<r$. Show that there is a real $x_0$ such that $P(x_0) < Q(x_0)$
Prove that in Euclidean ring $ R$ the quotient and remainder are always uniquely determined if and only if $ R$ is a polynomial ring over some field and the value of the norm is a strictly monotone function of the degree of the polynomial. (To be precise, there are two trivial cases: $ R$ can also be a field or the null ring.)
[i]E. Fried[/i]
Let $n{}$ be a natural number and $f{}$ be polynomial with integer coefficients. It is known that for any integer $m{}$ there is an integer $k{}$ such that $f(k)-m$ is divisible by $n{}$. Prove that there exists a polynomial $g{}$ with integer coefficients such that $f(g(m))-m$ is divisible by $n{}$ for any integer $m{}$.
[i]From the folklore[/i]
Find all polynomials $f\in \mathbb{Z}[X]$ such that if $p$ is prime then $f(p)$ is also prime.
What is the largest integer that is a divisor of
\[ (n\plus{}1)(n\plus{}3)(n\plus{}5)(n\plus{}7)(n\plus{}9)
\]for all positive even integers $ n$?
$ \textbf{(A)}\ 3 \qquad
\textbf{(B)}\ 5 \qquad
\textbf{(C)}\ 11 \qquad
\textbf{(D)}\ 15 \qquad
\textbf{(E)}\ 165$
Does there exist a polynomial \( P(x,y) \) in two variables with real coefficients, such that the following two conditions hold:
1) \( P(x,y) = P(x, x-y) = P(y-x, y) \) for any real numbers \( x \) and \( y \);
2) There does not exist a polynomial \( Q(z) \) in one variable with real coefficients such that \( P(x,y) = Q(x^2 - xy + y^2) \) for any real numbers \( x \) and \( y \)?
Find all strictly monotone functions $f : \mathbb{R} \to \mathbb{R}$ such that some polynomial $P(x, y)$
satisfies the equality
$$f(x + y) = P(f(x), f(y))$$
for all real numbers $x$ and $y$
For polynomial $P(x)=1-\frac{1}{3}x+\frac{1}{6}x^2$, define \[ Q(x) = P(x)P(x^3)P(x^5)P(x^7)P(x^9) = \sum\limits_{i=0}^{50}a_ix^i. \] Then $\sum\limits_{i=0}^{50}|a_i|=\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Let $P(x) = x^2 + ax + b$ be a quadratic polynomial with real coefficients. Suppose there are real numbers $ s \neq t$ such that $P(s) = t$ and $P(t) = s$. Prove that $b-st$ is a root of $x^2 + ax + b - st$.
Let $f_1(x) = x^3+a_1x^2+b_1x+c_1 = 0$ be an equation with three positive roots $\alpha>\beta>\gamma > 0$. From the equation $f_1(x) = 0$, one constructs the equation $f_2(x) = x^3 +a_2x^2 +b_2x+c_2 = x(x+b_1)^2 -(a_1x+c_1)^2 = 0$. Continuing this process, we get equations $f_3,\cdots, f_n$. Prove that
\[\lim_{n\to\infty}\sqrt[2^{n-1}]{-a_n} = \alpha\]
A polynomial $P$ with real coefficients is called [i]great,[/i] if for some integer $a>1$ and for all integers $x$, there exists an integer $z$ such that $aP(x)=P(z)$. Find all [i]great[/i] polynomials.
[i]Proposed by A. Golovanov[/i]
Find all polynomials $ p(x)$ satisfying the equation: $ (x\minus{}16)p(2x)\equal{}16(x\minus{}1)p(x)$ for all $ x$.
Prove that if the quadratic $x^2 +ax+b$ is always positive (for all real $x$) then it can be written as the quotient of two polynomials whose coefficients are all positive.