Found problems: 4275
Let $P(x)$ be a polynomial of degree $n$ such that $P(x)=3^k$ for $0\le k \le n$. Find $P(n+1)$
Find all polynomials $p$ with real coefficients such that for all real $x$
$$(x-8)p(2x)=8(x-1)p(x).$$
Let $n$ be a fixed integer with $n \ge 2$. We say that two polynomials $P$ and $Q$ with real coefficients are [i]block-similar[/i] if for each $i \in \{1, 2, \ldots, n\}$ the sequences
\begin{eqnarray*}
P(2015i), P(2015i - 1), \ldots, P(2015i - 2014) & \text{and}\\
Q(2015i), Q(2015i - 1), \ldots, Q(2015i - 2014)
\end{eqnarray*}
are permutations of each other.
(a) Prove that there exist distinct block-similar polynomials of degree $n + 1$.
(b) Prove that there do not exist distinct block-similar polynomials of degree $n$.
[i]Proposed by David Arthur, Canada[/i]
Let $ I$ be an ideal of the ring $\mathbb{Z}\left[x\right]$ of all polynomials with integer coefficients such that
a) the elements of $ I$ do not have a common divisor of degree greater than $ 0$, and
b) $ I$ contains of a polynomial with constant term $ 1$.
Prove that $ I$ contains the polynomial $ 1 + x + x^2 + ... + x^{r-1}$ for some natural number $ r$.
[i]Gy. Szekeres[/i]
The polynomial $1976(x+x^2+ \cdots +x^n)$ is decomposed into a sum of polynomials of the form $a_1x + a_2x^2 + \cdots + a_nx^n$, where $a_1, a_2, \ldots , a_n$ are distinct positive integers not greater than $n$. Find all values of $n$ for which such a decomposition is possible.
A polynomial $P$ with integer coefficients has at least $13$ distinct integer roots. Prove that if an integer $n$ is not a root of $P$, then $|P(n)| \geq 7 \cdot 6!^2$, and give an example for equality.
Let $n \geq 3$ and $a_1,a_2,...,a_n$ be complex numbers different from $0$ with $|a_i| < 1$ for all $i \in \{1,2,...,n-1 \}.$ If the coefficients of $f = \prod_{i=1}^n (X-a_i)$ are integers, prove that
$\textbf{a)}$ The numbers $a_1,a_2,...,a_n$ are distinct.
$\textbf{b)}$ If $a_j^2 = a_ia_k,$ then $i=j=k.$
Given an integer $n \geqslant 3$ the polynomial $f(x_1, \ldots, x_n)$ with integer coefficients is called [i]good[/i] if $f(0,\ldots, 0) = 0$ and \[f(x_1, \ldots, x_n)=f(x_{\pi_1}, \ldots, x_{\pi_n}),\]for any permutation of $\pi$ of the numbers $1,\ldots, n$. Denote by $\mathcal{J}$ the set of polynomials of the form \[p_1q_1+\cdots+p_mq_m,\]where $m$ is a positive integer and $q_1,\ldots , q_m$ are polynomials with integer coefficients, and $p_1,\ldots , p_m$ are good polynomials. Find the smallest natural number $D{}$ such that each monomial of degree $D{}$ lies in the set $\mathcal{J}$.
Among all polynomials $P(x)$ with integer coefficients for which $P(-10) = 145$ and $P(9) = 164$, compute the smallest possible value of $|P(0)|.$
The Fibonacci sequence is determined by conditions $ F_0 \equal{} 0, F1 \equal{} 1$, and $ F_k\equal{}F_{k\minus{}1}\plus{}F_{k\minus{}2}$ for all $ k \ge 2$. Let $ n$ be a positive integer and let $ P(x) \equal{} a_mx^m \plus{}. . .\plus{} a_1x\plus{} a_0$ be a polynomial that satisfies the following two conditions:
(1) $ P(F_n) \equal{} F_{n}^{2}$ ;
(2) $ P(F_k) \equal{} P(F_{k\minus{}1}) \plus{} P(F_{k\minus{}2}$ for all $ k \ge 2$.
Find the sum of the coefficients of P.
Let $A$ and $B$ be $2\times 2$ matrices with integer entries such that $A, A+B, A+2B, A+3B,$ and $A+4B$ are all invertible matrices whose inverses have integer entries. Show that $A+5B$ is invertible and that its inverse has integer entries.
Let $P$ be a quadratic (polynomial of degree two) with a positive leading coefficient and negative discriminant. Prove that there exists three quadratics $P_1, P_2, P_3$ such that:
- $P(x) = P_1(x) + P_2(x) + P_3(x)$
- $P_1, P_2, P_3$ have positive leading coefficients and zero discriminants (and hence each has a double root)
- The roots of $P_1, P_2, P_3$ are different
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$.
A point in the plane with a cartesian coordinate system is called a [i]mixed point[/i] if one of its coordinates is rational and the other one is irrational. Find all polynomials with real coefficients such that their graphs do not contain any mixed point.
Show that all complex roots of the polynomial $P(z)=a_0z^n+a_1z^{n-1}+\ldots+a_{n-1}z+a_n$, where $0<a_0<\ldots<a_n$, satisfy $|z|>1$.
Consider polynomial $f(x)=ax^3+bx^2+cx+d$ where $a, b, c, d$ are nonnegative integers satisfying $ab+bc+cd+ad=20$. Find the sum of all distinct possible values of $f(1)$.
$\omega$ is a complex number such that $\omega^{2013} = 1$ and $\omega^m \neq 1$ for $m=1,2,\ldots,2012$. Find the number of ordered pairs of integers $(a,b)$ with $1 \le a, b \le 2013$ such that \[ \frac{(1 + \omega + \cdots + \omega^a)(1 + \omega + \cdots + \omega^b)}{3} \] is the root of some polynomial with integer coefficients and leading coefficient $1$. (Such complex numbers are called [i]algebraic integers[/i].)
[i]Victor Wang[/i]
Let $a \in \mathbb{R}.$ Show that for $n \geq 2$ every non-real root $z$ of polynomial $X^{n+1}-X^2+aX+1$ satisfies the condition $|z| > \frac{1}{\sqrt[n]{n}}.$
Let $n$ be a positive integer. Prove that there exist integers $a_1, a_2,..., a_n$ such that for any integer $x$, the number $(... (((x^2 + a_1)^2 + a_2)^2 + ...)^2 + a_{n-1})^2 + a_n$ is divisible by $2n - 1$.
[b]p1.[/b] The length of the side $AB$ of the trapezoid with bases $AD$ and $BC$ is equal to the sum of lengths $|AD|+|BC|$. Prove that bisectors of angles $A$ and $B$ do intersect at a point of the side $CD$.
[b]p2.[/b] Polynomials $P(x) = x^4 + ax^3 + bx^2 + cx + 1$ and $Q(x) = x^4 + cx^3 + bx^2 + ax + 1$ have two common roots. Find these common roots of both polynomials.
[b]p3.[/b] A girl has a box with $1000$ candies. Outside the box there is an infinite number of chocolates and muffins. A girl may replace:
$\bullet$ two candies in the box with one chocolate bar,
$\bullet$ two muffins in the box with one chocolate bar,
$\bullet$ two chocolate bars in the box with one candy and one muffin,
$\bullet$ one candy and one chocolate bar in the box with one muffin,
$\bullet$ one muffin and one chocolate bar in the box with one candy.
Is it possible that after some time it remains only one object in the box?
[b]p4.[/b] There are $9$ straight lines drawn in the plane. Some of them are parallel some of them intersect each other. No three lines do intersect at one point. Is it possible to have exactly $17$ intersection points?
[b]p5.[/b] It is known that $x$ is a real number such that $x+\frac{1}{x}$ is an integer. Prove that $x^n+\frac{1}{x^n}$ is an integer for any positive integer $n$.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $P(x)$ be a nonconstant complex coefficient polynomial and let $Q(x,y)=P(x)-P(y).$ Suppose that polynomial $Q(x,y)$ has exactly $k$ linear factors unproportional two by tow (without counting repetitons). Let $R(x,y)$ be factor of $Q(x,y)$ of degree strictly smaller than $k$. Prove that $R(x,y)$ is a product of linear polynomials.
[b]Note: [/b] The [i]degree[/i] of nontrivial polynomial $\sum_{m}\sum_{n}c_{m,n}x^{m}y^{n}$ is the maximum of $m+n$ along all nonzero coefficients $c_{m,n}.$ Two polynomials are [i]proportional[/i] if one of them is the other times a complex constant.
[i]Proposed by Navid Safaie[/i]
We call polynomial $S(x)\in\mathbb{R}[x]$ sadeh whenever it's divisible by $x$ but not divisible by $x^2$.
For the polynomial $P(x)\in\mathbb{R}[x]$ we know that there exists a sadeh polynomial $Q(x)$ such that $P(Q(x))-Q(2x)$ is divisible by $x^2$. Prove that there exists sadeh polynomial $R(x)$ such that $P(R(x))-R(2x)$ is divisible by $x^{1401}$.
Find the sum of the squares of the values $x$ that satisfy $\frac{1}{x} + \frac{2}{x+3}+\frac{3}{x+6} = 1$.
Do there exist two real monic polynomials $P(x)$ and $Q(x)$ of degree 3,such that the roots of $P(Q(X))$ are nine pairwise distinct nonnegative integers that add up to $72$?
(In a monic polynomial of degree 3, the coefficient of $x^{3}$ is $1$.)
Let $p_1,p_2,p_3,p_4$ be four distinct primes. Prove that there is no polynomial $Q(x) = ax^3 + bx^2 + cx + d$ with integer coefficients such that $|Q(p_1)| =|Q(p_2)| = |Q(p_3)|= |Q(p_4 )| = 3$.