Found problems: 3597
Let $P_0(x) = x^3 + 313x^2 - 77x - 8$. For integers $n \ge 1$, define $P_n(x) = P_{n - 1}(x - n)$. What is the coefficient of $x$ in $P_{20}(x)$?
$P$ is an monic integer coefficient polynomial which has no integer roots. deg$P=n$ and define
$A$ $:=${$v_2(P(m))|m\in Z, v_2(P(m)) \ge 1$}. If $|A|=n$, show that all of the elements of $A$ is smaller than $\frac{3}{2}n^2$.
$f(x)$ is square trinomial. Is it always possible to find polynomial $g(x)$ with fourth degree, such that $f(g(x))=0$ has not roots?
Is there a triangle with angles in ratio of $ 1: 2: 4$ and the length of its sides are integers with at least one of them is a prime number?
[i]Nanang Susyanto, Jogjakarta[/i]
The polynomial $R(x)$ is the remainder upon dividing $x^{2007}$ by $x^2-5x+6$. $R(0)$ can be expressed as $ab(a^c-b^c)$. Find $a+c-b$.
Consider a quadratic polynomial $ax^2+bx+c$ with real coefficients satisfying $a\ge 2$, $b\ge 2$, $c\ge 2$. Adam and Boris play the following game. They alternately take turns with Adam first. On Adam’s turn, he can choose one of the polynomial’s coefficients and replace it with the sum of the other two coefficients. On Boris’s turn, he can choose one of the polynomial’s coefficients and replace it with the product of the other two coefficients. The winner is the player who first produces a polynomial with two distinct real roots. Depending on the values of $a$, $b$ and $c$, determine who has a winning strategy.
Let $p(z)=a_0+a_1z+a_2z^2+\cdots+a_nz^n$ be a complex polynomial. Suppose that $1=c_0\ge c_1\ge \cdots \ge c_n\ge 0$ is a sequence of real numbers which form a convex sequence. (That is $2c_k\le c_{k-1}+c_{k+1}$ for every $k=1,2,\cdots ,n-1$ ) and consider the polynomial
\[ q(z)=c_0a_0+c_1a_1z+c_2a_2z^2+\cdots +c_na_nz^n \]
Prove that :
\[ \max_{|z|\le 1}q(z)\le \max_{|z|\le 1}p(z) \]
For a polynomial $ P$ of degree 2000 with distinct real coefficients let $ M(P)$ be the set of all polynomials that can be produced from $ P$ by permutation of its coefficients. A polynomial $ P$ will be called [b]$ n$-independent[/b] if $ P(n) \equal{} 0$ and we can get from any $ Q \in M(P)$ a polynomial $ Q_1$ such that $ Q_1(n) \equal{} 0$ by interchanging at most one pair of coefficients of $ Q.$ Find all integers $ n$ for which $ n$-independent polynomials exist.
Find all integers $ n\ge 2$ having the following property: for any $ k$ integers $ a_{1},a_{2},\cdots,a_{k}$ which aren't congruent to each other (modulo $ n$), there exists an integer polynomial $ f(x)$ such that congruence equation $ f(x)\equiv 0 (mod n)$ exactly has $ k$ roots $ x\equiv a_{1},a_{2},\cdots,a_{k} (mod n).$
Positive integers $x,y,z$ satisfy $x^3+xy+x^2+xz+y+z=301$. Compute $y+z-x$.
[i]2015 CCA Math Bonanza Individual Round #12[/i]
Consider the polynomials $P(x)=x^{6}-x^{5}-x^{3}-x^{2}-x$ and $Q(x)=x^{4}-x^{3}-x^{2}-1.$ Given that $z_{1},z_{2},z_{3},$ and $z_{4}$ are the roots of $Q(x)=0,$ find $P(z_{1})+P(z_{2})+P(z_{3})+P(z_{4}).$
Suppose that the sum of the squares of two complex numbers $x$ and $y$ is 7 and the sum of the cubes is 10. What is the largest real value that $x + y$ can have?
Say that a polynomial with real coefficients in two variable, $ x,y,$ is [i]balanced[/i] if the average value of the polynomial on each circle centered at the origin is $ 0.$ The balanced polynomials of degree at most $ 2009$ form a vector space $ V$ over $ \mathbb{R}.$ Find the dimension of $ V.$
Let $P(x)$ be a nonconstant polynomial of degree $n$ with rational coefficients which can not be presented as a product of two nonconstant polynomials with rational coefficients. Prove that the number of polynomials $Q(x)$ of degree less than $n$ with rational coefficients such that $P(x)$ divides $P(Q(x))$
a) is finite
b) does not exceed $n$.
Let all roots of an $n$-th degree polynomial $P(z)$ with complex coefficients lie on the unit circle in the complex plane. Prove that all roots of the polynomial
$$2zP'(z)-nP(z)$$
lie on the same circle.
Find all polynomials $P(x)$ with real coefficients such that
\[P(x)P(x + 1) = P(x^2), \quad \forall x \in \mathbb R.\]
Define a sequence {$a_n$}$^{\infty}_{n=1}$ by $a_1 = 4, a_2 = a_3 = (a^2 - 2)^2$ and
$a_n = a_{n-1}.a_{n-2} - 2(a_{n-1} + a_{n-2}) - a_{n-3} + 8, n \ge 4$, where $a > 2$ is a natural number.
Prove that for all $n$ the number $2 + \sqrt{a_n}$ is a perfect square.
Let $a, b > 0$ be reals such that
\[ a^3=a+1\\ b^6=b+3a \]
Show that $a>b$
Let $m$, $n$ be positive integers. Prove that, for some positive integer $a$, each of $\phi(a)$, $\phi(a+1)$, $\cdots$, $\phi(a+n)$ is a multiple of $m$.
The teacher wrote on the blackboard quadratic polynomial $x^2 + 10x + 20$. Then in turn each student in the class either increased or decreased by $1$ either the coefficient of $x$ or the constant term. At the end the quadratic polynomial became $x^2+20x+10$. Is it true that at certain moment a quadratic polynomial with integer roots was on the board?
Two polynomials $ f(x)=a_{100}x^{100}+a_{99}x^{99}+\dots+a_{1}x+a_{0}$ and $ g(x)=b_{100}x^{100}+b_{99}x^{99}+\dots+b_{1}x+b_{0}$ of degree $ 100$ differ from each other by a permutation of coefficients. It is known that $ a_{i}\ne b_{i}$ for $ i=0, 1, 2, \dots, 100$. Is it possible that $ f(x)\geq g(x)$ for all real $ x$?
Prove that the polynomial $P (x)$ with integer coefficients, taking odd values for $x = 0$ and $x= 1$, has no integer roots.
Let $ a\geq 2$ be a real number; with the roots $ x_{1}$ and $ x_{2}$ of the equation $ x^2\minus{}ax\plus{}1\equal{}0$ we build the sequence with $ S_{n}\equal{}x_{1}^n \plus{} x_{2}^n$.
[b]a)[/b]Prove that the sequence $ \frac{S_{n}}{S_{n\plus{}1}}$, where $ n$ takes value from $ 1$ up to infinity, is strictly non increasing.
[b]b)[/b]Find all value of $ a$ for the which this inequality hold for all natural values of $ n$ $ \frac{S_{1}}{S_{2}}\plus{}\cdots \plus{}\frac{S_{n}}{S_{n\plus{}1}}>n\minus{}1$
Let $D \subseteq \mathbb{C}$ be an open set containing the closed unit disk $\{z : |z| \leq 1\}$. Let $f : D \rightarrow \mathbb{C}$ be a holomorphic function, and let $p(z)$ be a monic polynomial. Prove that
$$
|f(0)| \leq \max_{|z|=1} |f(z)p(z)|
$$
Let $p(x)$ be a polynomial with integer coefficients such that $p(0)=p(1)=1$. We define the sequence $a_0, a_1, a_2, \ldots, a_n, \ldots$ that starts with an arbitrary nonzero integer $a_0$ and satisfies $a_{n+1}=p(a_n)$ for all $n \in \mathbb N\cup \{0\}$. Prove that $\gcd(a_i,a_j)=1$ for all $i,j \in \mathbb N \cup \{0\}$.