Found problems: 3597
Prove that the equation $x^n - a_1x^{n-1} - a_2x^{n-2} - ... -a_{n-1}x - a_n = 0$, where $a_1 \ge 0, a_2 \ge 0, . . . , a_n \ge 0$, cannot have two positive roots.
For nonnegative integers $m$ and $n$, define the sequence $a(m,n)$ of real numbers as follows. Set $a(0,0)=2$ and for every natural number $n$, set $a(0,n)=1$ and $a(n,0)=2$. Then for $m,n\geq1$, define \[ a(m,n)=a(m-1,n)+a(m,n-1). \] Prove that for every natural number $k$, all the roots of the polynomial $P_{k}(x)=\sum_{i=0}^{k}a(i,2k+1-2i)x^{i}$ are real.
For any polynomial f, denote by $P_f$ the number of integers n for which f(n) is a (positive) prime number. Let $q_d = max P_f$ , where f runs over all polynomials with integer coefficients with degree d and reducible over $\mathbb{Q}$. Prove that $\forall d\geq 2$ , $q_d = d$.
If the remainder is $2013$ when a polynomial with coefficients from the set $\{0,1,2,3,4,5\}$ is divided by $x-6$, what is the least possible value of the coefficient of $x$ in this polynomial?
$
\textbf{(A)}\ 5
\qquad\textbf{(B)}\ 4
\qquad\textbf{(C)}\ 3
\qquad\textbf{(D)}\ 2
\qquad\textbf{(E)}\ 1
$
If $x$, $y$, $z$ are real numbers satisfying
\begin{align*}
(x + 1)(y + 1)(z + 1) & = 3 \\
(x + 2)(y + 2)(z + 2) & = -2 \\
(x + 3)(y + 3)(z + 3) & = -1,
\end{align*}
find the value of
$$ (x + 20)(y + 20)(z + 20). $$
Let $n$ be an even positive integer. An $n$-degree monic polynomial $P(x)$ has $n$ real roots (not necessarily distinct). Suppose $y$ is a positive real number such that for any real number $t<y$, we have $P(t)>0$. Prove that
\[P(0)^{\frac{1}{n}}-P(y)^{\frac{1}{n}}\ge y.\]
$f:\mathbb{R}\rightarrow \mathbb{R}$ satisfies the equation
\[f(x)f(y)-af(xy)=x+y\]
, for every real numbers $x,y$. Find all possible real values of $a$.
Let all possible $2023$-degree real polynomials: $P(x)=x^{2023}+a_1x^{2022}+a_2x^{2021}+\cdots+a_{2022}x+a_{2023}$,
where $P(0)+P(1)=0$, and the polynomial has 2023 real roots $r_1, r_2,\cdots r_{2023}$ [not necessarily distinct] so that $0\leq r_1,r_2,\cdots r_{2023}\leq1$. What is the maximum value of $r_1 \cdot r_2 \cdots r_{2023}?$
Let $P(x)=ax^3+bx^2+cx+d$ be a polynomial with real coefficients such that \[\min\{d,b+d\}> \max\{|{c}|,|{a+c}|\}\]
Prove that $P(x)$ do not have a real root in $[-1,1]$.
A cubic polynomial $f$ satisfies $f(0)=0, f(1)=1, f(2)=2, f(3)=4$. What is $f(5)$?
Show that for any positive integer $n$ there is an integer $N$ such that the product $x_1x_2\cdots x_n$ can be expressed identically in the form
\[x_1x_2\cdots x_n=\sum_{i=1}^Nc_i(a_{i1}x_1+a_{i2}x_2+\cdots +a_{in}x_n)^n\]
where the $c_i$ are rational numbers and each $a_{ij}$ is one of the numbers, $-1,0,1.$
Consider the polynomial
$P_n(x) = \binom {n}{2}+\binom {n}{5}x+\binom {n}{8}x^2 + \cdots + \binom {n}{3k+2}x^{3k}$
where $n \ge 2$ is a natural number and $k = \left\lfloor \frac{n-2}{3} \right \rfloor$
[b](a)[/b] Prove that $P_{n+3}(x)=3P_{n+2}(x)-3P_{n+1}(x)+(x+1)P_n(x)$
[b](b)[/b] Find all integer numbers $a$ such that $P_n(a^3)$ is divisible by $3^{ \lfloor \frac{n-1}{2} \rfloor}$ for all $n \ge 2$
It is known that $1$ and $2$ are roots of a polynomial with integer coefficients. Prove that the polynomial has a coefficient with value less than $-1$ .
Find the sum of all positive integers $n$ for which $n^2-19n+99$ is a perfect square.
If $a,b,c,$ and $d$ are non-zero numbers such that $c$ and $d$ are the solutions of $x^2+ax+b=0$ and $a$ and $b$ are the solutions of $x^2+cx+d=0$, then $a+b+c+d$ equals
$\textbf{(A) }0\qquad\textbf{(B) }-2\qquad\textbf{(C) }2\qquad\textbf{(D) }4\qquad \textbf{(E) }(-1+\sqrt{5})/2$
In 1772 Euler discovered the curious fact that $n^2 +n+41$ is prime when $n$ is any of $0,1,2, \cdots, 39$. Show that there exist $40$ consecutive integer values of $n$ for which this polynomial is not prime.
Let $p$ and $q$ be integers. Show that there exists an interval $I$ of length $1/q$ and a polynomial $P$ with integral coefficients such that
\[ \left|P(x)-\frac pq \right| < \frac{1}{q^2}\]for all $x \in I.$
Let $P(x), Q(x), R(x)$ be polynomials with integer coefficients, such that $P(x) = Q(x)R(x)$. Let's denote by $a$ and $b$ the largest absolute values of coefficients of $P, Q$ correspondingly. Does $b \le 2023a$ always hold?
[i]Proposed by Dmytro Petrovsky[/i]
Let $\{F_n\}^\infty_{n=1}$ be the Fibonacci sequence and let $f$ be a polynomial of degree $1006$ such that $f(k) = F_k$ for all $k \in \{1008, \dots , 2014\}$. Prove that $$233\mid f(2015)+1.$$
[i]Note: $F_1=F_2=1$ and $F_{n+2}=F_{n+1}+F_n$ for all $n\geq 1$.[/i]
Hello,
I've been trying to solve this for a while now, but no success! I mean, I have an expression for this but not a closed one. I derived something in terms of Tchebychev Polynomials : cos(nx) = P_n(cos(x)). Any help is appreciated.
Compute the following primitive:
\[ \int \frac{x\sin\left(2004 x\right)}{\tan x}\ dx\]
Let $k$ be the smallest positive integer for which there exist distinct integers $m_{1}, m_{2}, m_{3}, m_{4}, m_{5}$ such that the polynomial $$p(x)=\left(x-m_{1}\right)\left(x-m_{2}\right)\left(x-m_{3}\right)\left(x-m_{4}\right)\left(x-m_{5}\right)$$ has exactly $k$ nonzero coefficients. Find, with proof, a set of integers $m_{1}, m_{2}, m_{3}, m_{4}, m_{5}$ for which this minimum $k$ is achieved.
A $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ where $h_i\left(x_1,x_2, \cdots , x_n\right)$ are $n$ variable polynomials with real coefficients is called [i]good[/i] if the following condition holds:
For any $n$ functions $f_1,f_2, \cdots ,f_n : \mathbb R \to \mathbb R$ if for all $1 \le i \le n+1$, $P_i(x)=h_i \left(f_1(x),f_2(x), \cdots, f_n(x) \right)$ is a polynomial with variable $x$, then $f_1(x),f_2(x), \cdots, f_n(x)$ are polynomials.
$a)$ Prove that for all positive integers $n$, there exists a [i]good[/i] $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ such that the degree of all $h_i$ is more than $1$.
$b)$ Prove that there doesn't exist any integer $n>1$ that for which there is a [i]good[/i] $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ such that all $h_i$ are symmetric polynomials.
[i]Proposed by Alireza Shavali[/i]
We say that a ring $A$ has property $(P)$ if any non-zero element can be written uniquely as the sum of an invertible element and a non-invertible element.
a) If in $A$, $1+1=0$, prove that $A$ has property $(P)$ if and only if $A$ is a field.
b) Give an example of a ring that is not a field, containing at least two elements, and having property $(P)$.
[i]Dan Schwarz[/i]
Show that there exists a degree $58$ monic polynomial
$$P(x) = x^{58} + a_1x^{57} + \cdots + a_{58}$$
such that $P(x)$ has exactly $29$ positive real roots and $29$ negative real roots and that $\log_{2017} |a_i|$ is a positive integer for all $1 \leq i \leq 58$.
Find all triples $(p,q,n)$ that satisfy
\[q^{n+2} \equiv 3^{n+2} (\mod p^n) ,\quad p^{n+2} \equiv 3^{n+2} (\mod q^n)\]
where $p,q$ are odd primes and $n$ is an positive integer.