Found problems: 3597
Prove that there does not exist a polynomial $f(x)$ with integer coefficients for which $f(2008) = 0$ and $f(2010) = 1867$.
Let $n > 1$ be an integer and let $f(x) = x^n + 5 \cdot x^{n-1} + 3.$ Prove that there do not exist polynomials $g(x),h(x),$ each having integer coefficients and degree at least one, such that $f(x) = g(x) \cdot h(x).$
Find a 3rd degree polynomial whose roots are $r_a$, $r_b$ and $r_c$ where $r_a$ is the radius of the outer inscribed circle of $ABC$ with respect to $A$.
Let $s_k$ denote the sum of the $\textit{k}$th powers of the roots of the polynomial $x^3-5x^2+8x-13$. In particular, $s_0=3$, $s_1=5$, and $s_2=9$. Let $a$, $b$, and $c$ be real numbers such that $s_{k+1} = a \, s_k + b \, s_{k-1} + c \, s_{k-2}$ for $k = 2$, $3$, $....$ What is $a+b+c$?
$\textbf{(A)} \; -6 \qquad \textbf{(B)} \; 0 \qquad \textbf{(C)} \; 6 \qquad \textbf{(D)} \; 10 \qquad \textbf{(E)} \; 26$
$p(x)$ is the cubic $x^3 - 3x^2 + 5x$. If $h$ is a real root of $p(x) = 1$ and $k$ is a real root of $p(x) = 5$, find $h + k$.
Define the function $\xi : \mathbb Z^2 \to \mathbb Z$ by $\xi(n,k) = 1$ when $n \le k$ and $\xi(n,k) = -1$ when $n > k$, and construct the polynomial \[ P(x_1, \dots, x_{1000}) = \prod_{n=1}^{1000} \left( \sum_{k=1}^{1000} \xi(n,k)x_k \right). \]
(a) Determine the coefficient of $x_1x_2 \dots x_{1000}$ in $P$.
(b) Show that if $x_1, x_2, \dots, x_{1000} \in \left\{ -1,1 \right\}$ then $P(x_1,x_2,\dots,x_{1000}) = 0$.
[i]Proposed by Evan Chen[/i]
Let $n$ be a natural number and let $P (t) = 1 + t + t^2 + ... + t^{2n}$.
If $x \in R$ such that $P (x)$ and $P (x^2)$ are rational numbers, prove that $x$ is rational number.
Let $ M$ be the set of all polynomials $ P(x)$ with pairwise distinct integer roots, integer coefficients and all absolut values of the coefficients less than $ 2007$. Which is the highest degree among all the polynomials of the set $ M$?
Let $a_0,$ $a_1,$ $\ldots,$ $a_n$ be complex numbers such that [center]$|a_nz^n+a_{n-1}z^{n-1}+\ldots+a_1z+a_0| \le 1,$ for any $z \in \mathbb{C}$ with $|z|=1.$[/center]
Prove that $|a_k| \le 1$ and $|a_0+a_1+\ldots+a_n-(n+1)a_k| \le n,$ for any $k=\overline{0,n}.$
Find a nonzero monic polynomial $P(x)$ with integer coefficients and minimal degree such that $P(1-\sqrt[3]2+\sqrt[3]4)=0$. (A polynomial is called $\textit{monic}$ if its leading coefficient is $1$.)
Prove that:$a+b+c+d \geq \frac{2}{3}(ab+bc+ca+ad+ac+bd)$
where $a;b;c;d$ are positive real numbers satisfying $2(ab+bc+cd+da+ac+bd)+abc+bcd+cda+dab=16$
Each of the quadratic polynomials $P(x), Q(x)$ and $P(x)+Q(x)$ with real coefficients has a repeated root. Is it guaranteed that those roots coincide?
[i]Boris Frenkin[/i]
Which polygon inscribed in a given circle has the property that the sum of the squares of the lengths of its sides is maximum?
Find all integers $a,b,m,n$, with $m>n>1$, for which the polynomial $f(X)=X^n+aX+b$ divides the polynomial $g(X)=X^m+aX+b$.
[i]Laurentiu Panaitopol[/i]
[list=1]
[*] Prove that, the sequence of remainders obtained when the Fibonacci numbers are divided by $n$ is periodic, where $n$ is a natural number.
[*] There exists no such non-constant polynomial with integer coefficients such that for every Fibonacci number $n,$ $ P(n)$ is a prime.
[/list]
Consider the matrix $ A,B\in \mathcal l{M}_3(\mathbb{C})$ with $ A=-^tA$ and $ B=^tB$. Prove that if the polinomial function defined by
\[ f(x)=\det(A+xB)\]
has a multiple root, then $ \det(A+B)=\det B$.
Let $p$ be a prime number. Find all polynomials $P$ with integer coefficients with the following properties:
$(a)$ $P(x)>x$ for all positive integers $x$.
$(b)$ The sequence defined by $p_0:=p$, $p_{n+1}:=P(p_n)$ for all positive integers $n$, satisfies the property that for all positive integers $m$ there exists some $l\geq 0$ such that $m\mid p_l$.
Let $m, n$ be positive integers. Show that the polynomial $$f(x)=x^m(x^2-100)^n-11$$ cannot be expressed as a product of two non-constant polynomials with integral coefficients.
If 1,2, and 3 are solutions to the equation $ x^4 \plus{} ax^2 \plus{} bx \plus{} c \equal{} 0,$ then $ a\plus{}c$ equals
A. -12
B. 24
C. 35
D. -61
E. -63
The sequence of integers an is given by $a_0 = 0, a_n = p(a_n-1)$, where $p(x)$ is a polynomial whose coefficients are all positive integers. Show that for any two positive integers $m, k$ with greatest common divisor $d$, the greatest common divisor of $a_m$ and $a_k$ is $a_d$.
Let $K$ be a finite field and $f:K\to K^*$. Prove that there is a reducible polynomial $P\in K[X]$ s.t. $P(x)=f(x),\forall x\in K$.
[i]Marian Andronache[/i]
Find all polynomials $P(x, y)$ with real coefficients which for all real numbers $x$ and $y$ satisfy $P(x + y, x - y) = 2P(x, y)$.
Does there exist a polynomial $P(x)$ with integral coefficients such that $P(1+\sqrt 3) = 2+\sqrt 3$ and $P(3+\sqrt 5) = 3+\sqrt 5 $?
[i]Proposed by Alexander S. Golovanov, Russia[/i]
The sequence of positive integers $a_1$, $a_2$,$...$ is such that for each $n = 1$,$2$, $...$ the quadratic equation $$a_{n+2}x^2 + a_{n+1}x+ a_n = 0$$ has a real root. Can the sequence consist of
(a) $10 $ terms,
(b) an infinite number of terms?
(A Shapovalov)
On the plane, a Cartesian coordinate system is chosen. Given points $ A_1,A_2,A_3,A_4$ on the parabola $ y \equal{} x^2$, and points $ B_1,B_2,B_3,B_4$ on the parabola $ y \equal{} 2009x^2$. Points $ A_1,A_2,A_3,A_4$ are concyclic, and points $ A_i$ and $ B_i$ have equal abscissas for each $ i \equal{} 1,2,3,4$.
Prove that points $ B_1,B_2,B_3,B_4$ are also concyclic.