Found problems: 4275
Compute the sum of the positive integers $n \le 100$ for which the polynomial $x^n + x + 1$ can be written as the product of at least $2$ polynomials of positive degree with integer coefficients.
Given the polynomial $a_0x^n+a_1x^{n-1}+\cdots+a_{n-1}x+a_n$, where $n$ is a positive integer or zero, and $a_0$ is a positive integer. The remaining $a$'s are integers or zero. Set $h=n+a_0+|a_1|+|a_2|+\cdots+|a_n|$. [See example 25 for the meaning of $|x|$.] The number of polynomials with $h=3$ is:
$ \textbf{(A)}\ 3\qquad\textbf{(B)}\ 5\qquad\textbf{(C)}\ 6\qquad\textbf{(D)}\ 7\qquad\textbf{(E)}\ 9 $
Let $N$ be the number of polynomials $P(x_1, x_2, \dots, x_{2016})$ of degree at most $2015$ with coefficients in the set $\{0, 1, 2 \}$ such that $P(a_1,a_2,\cdots ,a_{2016}) \equiv 1 \pmod{3}$ for all $(a_1,a_2,\cdots ,a_{2016}) \in \{0, 1\}^{2016}.$
Compute the remainder when $v_3(N)$ is divided by $2011$, where $v_3(N)$ denotes the largest integer $k$ such that $3^k | N.$
[i]Proposed by Yang Liu[/i]
A polynomial $P(x)$ with integer coefficients satisfies the following: if $F(x)$, $G(x)$, and $Q(x)$ are polynomials with integer coefficients satisfying $P\Big(Q(x)\Big)=F(x)\cdot G(x)$, then $F(x)$ or $G(x)$ is a constant polynomial. Prove that $P(x)$ is a constant polynomial.
Suppose that for a function $f: \mathbb{R}\to \mathbb{R}$ and real numbers $a<b$ one has $f(x)=0$ for all $x\in (a,b).$ Prove that $f(x)=0$ for all $x\in \mathbb{R}$ if
\[\sum^{p-1}_{k=0}f\left(y+\frac{k}{p}\right)=0\]
for every prime number $p$ and every real number $y.$
Let $P$ be the product of the nonreal roots of $x^4-4x^3+6x^2-4x=2005$. Find $\lfloor P\rfloor$.
Suppose that $p(x)$ is a polynomial and that $p(x)-p^\prime (x)=x^2+2x+1$. Compute $p(5)$.
Let $P(x)$ be a monic polynomial of degree $3$. Suppose that $P(x)$ has remainder $R(x)$ when it is divided by $(x - 1)(x - 4)$ and $2R(x)$ when it is divided by $(x - 2)(x - 3)$. Given that $P(0) = 5$, find $P(5)$.
Determine all polynomial $P(x)\in \mathbb{R}[x]$ satisfying the following two conditions:
(a) $P(2017)=2016$ and
(b) $(P(x)+1)^2=P(x^2+1)$ for all real number $x$.
Let $n$ be a positive integer. Find the number of polynomials $P(x)$ with coefficients in $\{0, 1, 2, 3\}$ for which $P(2) = n$.
Let $ A,B\in\mathcal{M} \left( \mathbb{R} \right) $ that satisfy $ AB=O_3. $ Prove that:
[b]a)[/b] The function $ f:\mathbb{C}\longrightarrow\mathbb{C} $ defined as $ f(x)=\det \left( A^2+B^2+xBA \right) $ is a polynomial one, of degree at most $ 2. $
[b]b)[/b] $ \det\left( A^2+B^2 \right)\ge 0. $
Let $n$ be an integer greater than $3$. Prove that all the roots of the polynomial
$P(x) = x^n - 5x^{n-1} + 12x^{n-2}- 15x^{n-3} + a_{n-4}x^{n-4} +...+ a_0$ cannot be both real and positive.
Do there exist four polynomials $P_1(x), P_2(x), P_3(x), P_4(x)$ with real coefficients, such that the sum of any three of them always has a real root, but the sum of any two of them has no real root?
The prime number $p$ and a positive integer $k$ are given. Assume that $P(x)\in \mathbb Z[X]$ is a polynomial with coefficients in the set $\{0,1,\cdots,p-1\}$ with least degree which satisfies the following property: There exists a permutaion of numbers $1,2,\cdots,p-1$ around a circle such that for any $k$ consecutive numbers $a_1,a_2,\cdots,a_k$ one has
$$
p | P(a_1)+P(a_2)+\cdots+ P(a_k).
$$
Prove that $P(x)$ is of the form $ax^d+b$.
Proposed by [i]Yahya Motevassel[/i]
[b]p1.[/b] Let $x_1 = 0$, $x_2 = 1/2$ and for $n >2$, let $x_n$ be the average of $x_{n-1}$ and $x_{n-2}$. Find a formula for $a_n = x_{n+1} - x_{n}$, $n = 1, 2, 3, \dots$. Justify your answer.
[b]p2.[/b] Given a triangle $ABC$. Let $h_a, h_b, h_c$ be the altitudes to its sides $a, b, c,$ respectively. Prove: $\frac{1}{h_a}+\frac{1}{h_b}>\frac{1}{h_c}$ Is it possible to construct a triangle with altitudes $7$, $11$, and $20$? Justify your answer.
[b]p3.[/b] Does there exist a polynomial $P(x)$ with integer coefficients such that $P(0) = 1$, $P(2) = 3$ and $P(4) = 9$? Justify your answer.
[b]p4.[/b] Prove that if $\cos \theta$ is rational and $n$ is an integer, then $\cos n\theta$ is rational. Let $\alpha=\frac{1}{2010}$. Is $\cos \alpha $ rational ? Justify your answer.
[b]p5.[/b] Let function $f(x)$ be defined as $f(x) = x^2 + bx + c$, where $b, c$ are real numbers.
(A) Evaluate $f(1) -2f(5) + f(9)$ .
(B) Determine all pairs $(b, c)$ such that $|f(x)| \le 8$ for all $x$ in the interval $[1, 9]$.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $n$ be a fixed positive integer. Determine the smallest possible rank of an $n\times n$ matrix that has zeros along the main diagonal and strictly positive real numbers off the main diagonal.
[i]Proposed by Ilya Bogdanov and Grigoriy Chelnokov, MIPT, Moscow.[/i]
Determine all polynomials $f (x)$ with real coeffcients that satisfy
\[f (x^{2}-2x) = f^{2}(x-2)\]
for all $x.$
Determine all roots, real or complex, of the system of simultaneous equations
\begin{align*} x+y+z &= 3, \\
x^2+y^2+z^2 &= 3, \\
x^3+y^3+z^3 &= 3.\end{align*}
Let $c_n$ be a sequence which is defined recursively as follows: $c_0 = 1$, $c_{2n+1} = c_n$ for $n \geq 0$, and $c_{2n} = c_n + c_{n-2^e}$ for $n > 0$ where $e$ is the maximal nonnegative integer such that $2^e$ divides $n$. Prove that
\[\sum_{i=0}^{2^n-1} c_i = \frac{1}{n+2} {2n+2 \choose n+1}.\]
Let $k$ be a positive integer not less than 3 and $x$ a real number. Prove that if $\cos (k-1)x$ and $\cos kx$ are rational, then there exists a positive integer $n>k$, such that both $\cos (n-1)x$ and $\cos nx$ are rational.
Let $P$ and $Q$ be non-constant integer-coefficient monic polynomials, and let $a$ and $b$ be integers satisfying $| a | \geq 3$ and $ | b | \geq 3$. These satisfy the following conditions for all positive integers $n$:
$$
P(n) \mid Q(n)^2 + aQ(n) + 1, \quad Q(n) \mid P(n)^2 + bP(n) + 1.
$$
Determine all possible ordered pairs $(a+b, \deg P)$.
[hide=Original wording]
상수다항식이 아닌 최고차항의 계수가 1인 정수계수다항식 $P$, $Q$와 정수 $a$, $b$($| a |, | b | \geq 3$)가 모든 양의 정수 $n$에 대해
$$P(n) \mid Q(n)^2 +aQ(n)+1, \quad Q(n) \mid P(n)^2+bP(n)+1$$
을 만족한다. 이때 가능한 모든 $(a+b, \deg P)$ 순서쌍을 구하여라.
[/hide]
Show that there do not exist polynomials $p(x)$ and $q(x)$ each having integer coefficients and of degree greater than or equal to 1 such that \[ p(x)q(x) = x^5 +2x +1 . \]
[b]1)[/b] Show that there exist quadratic polynoms $ P\in\mathbb{R}[X] $ whose composition with themselves have $
1,2 $ and $ 3 $ as their fixed points.
[b]2)[/b] Prove that the polynoms referred to at [b]1)[/b] are not integer.
[i]Gheorghe Iurea[/i]
Let $ P (x) $ be a polynomial with real coefficients such that $ P (x)> 0 $ for all $ x \geq 0 $. Prove that there is a positive integer $ n $ such that $ (1 + x) ^ n P (x) $ polynomial with nonnegative coefficients.
Given $n > 1$ monic square trinomials $x^2 - a_1x + b_1$,$...$, $x^2-a_nx + b_n$, and all $2n$ numbers are $a_1$,$...$, $a_n$, $b_1$,$...$, $b_n$ are different. Can it happen that each of the numbers $a_1$,$...$, $a_n$, $b_1$,$...$, $b_n is the root of one of these trinomials?