This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 3597

Find all complex roots (with multiplicities) of the polynomial $$p(x)=\sum_{n=1}^{2008}(1004-|1004-n|)x^n.$$
Let $P(a)$ be the largest prime positive divisor of $a^2 + 1$. Prove that exist infinitely many positive integers $a, b, c$ such that $P(a)=P(b)=P(c)$. [i]A. Golovanov[/i]
If $p,q\in\mathbb{R}[x]$ satisfy $p(p(x))=q(x)^2$, does it follow that $p(x)=r(x)^2$ for some $r\in\mathbb{R}[x]$?
Let $M=\{1,2,\cdots,n\}$, each element of $M$ is colored in either red, blue or yellow. Set $A=\{(x,y,z)\in M\times M\times M|x+y+z\equiv 0\mod n$, $x,y,z$ are of same color$\},$ $B=\{(x,y,z)\in M\times M\times M|x+y+z\equiv 0\mod n,$ $x,y,z$ are of pairwise distinct color$\}.$ Prove that $2|A|\geq |B|$.
A polynomial $P(x, y, z)$ in three variables with real coefficients satisfies the identities $$P(x, y, z)=P(x, y, xy-z)=P(x, zx-y, z)=P(yz-x, y, z).$$ Prove that there exists a polynomial $F(t)$ in one variable such that $$P(x,y,z)=F(x^2+y^2+z^2-xyz).$$
Two polynomials $f(x)$ and $g(x)$ with real coefficients are called similar if there exist nonzero real number a such that $f(x) = q \cdot g(x)$ for all $x \in R$. [b]I.[/b] Show that there exists a polynomial $P(x)$ of degree 1999 with real coefficients which satisfies the condition: $(P(x))^2 - 4$ and $(P'(x))^2 \cdot (x^2-4)$ are similar. [b]II.[/b] How many polynomials of degree 1999 are there which have above mentioned property.
Prove that there exists a polynomial $P(x)$ with real coefficients and degree greater than 1 such that both of the following conditions are true $\cdot$ $P(a)+P(b)+P(c)\ge 2021$ holds for all nonnegative real numbers $a,b,c$ such that $a+b+c=3$ $\cdot$ There are infinitely many triples $(a,b,c)$ of nonnegative real numbers such that $a+b+c=3$ and $P(a)+P(b)+P(c)= 2021$
Suppose that $\omega$ is a primitive $2007^{\text{th}}$ root of unity. Find $\left(2^{2007}-1\right)\displaystyle\sum_{j=1}^{2006}\dfrac{1}{2-\omega^j}$.
Prove that $ \forall n > 1, n \in \mathbb{N}$ the equation \[ \sum^n_{k\equal{}1} \frac{x^k}{k!} \plus{} 1 \equal{} 0\] has no rational roots.
Find all positive integers $ k$ for which the following statement is true: If $ F(x)$ is a polynomial with integer coefficients satisfying the condition $ 0 \leq F(c) \leq k$ for each $ c\in \{0,1,\ldots,k \plus{} 1\}$, then $ F(0) \equal{} F(1) \equal{} \ldots \equal{} F(k \plus{} 1)$.
Fix an integer $n \geq 2$ and let $a_1, \ldots, a_n$ be integers, where $a_1 = 1$. Let $$ f(x) = \sum_{m=1}^n a_mm^x. $$ Suppose that $f(x) = 0$ for some $K$ consecutive positive integer values of $x$. In terms of $n$, determine the maximum possible value of $K$.
Prove the following inequality: \[\prod^k_{i=1} x_i \cdot \sum^k_{i=1} x^{n-1}_i \leq \sum^k_{i=1} x^{n+k-1}_i,\] where $x_i > 0,$ $k \in \mathbb{N}, n \in \mathbb{N}.$
Determine all positive integers $n$ for which there exists a polynomial $P_n(x)$ of degree $n$ with integer coefficients that is equal to $n$ at $n$ different integer points and that equals zero at zero.
Let $n$ be a positive integer and $P,Q$ be polynomials with real coefficients with $P(x)=x^nQ(\frac{1}{x})$ and $P(x) \geq Q(x)$ for all real numbers $x$. Prove that $P(x)=Q(x)$ for all real number $x$.
The roots of the equation $x^5-180x^4+Ax^3+Bx^2+Cx+D=0$ are in geometric progression. The sum of their reciprocals is $20$. Compute $|D|$.
Let $a_1 < a_2 < \cdots < a_k$ denote the sequence of all positive integers between $1$ and $91$ which are relatively prime to $91$, and set $\omega = e^{2\pi i/91}$. Define \[S = \prod_{1\leq q < p\leq k}\left(\omega^{a_p} - \omega^{a_q}\right).\] Given that $S$ is a positive integer, compute the number of positive divisors of $S$.
For how many positive integers $n$ is $n^3-8n^2+20n-13$ a prime number? $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad\textbf{(E) }\text{more than 4}$
Let $n$ be a positive integer, and $a_j$, for $j=1,2,\ldots,n$ are complex numbers. Suppose $I$ is an arbitrary nonempty subset of $\{1,2,\ldots,n\}$, the inequality $\left|-1+ \prod_{j\in I} (1+a_j) \right| \leq \frac 12$ always holds. Prove that $\sum_{j=1}^n |a_j| \leq 3$.
Let $f(x)=Ax^2+Bx+C$, $g(x)=ax^2+bx+c$ be two quadratic polynomial functions with real coefficients that satisfy the relation \[|f(x)| \ge |g(x)|\] for all real $x$. Prove that $|b^2-4ac| \le |B^2-4AC|.$ My solution was nearly complete...
Let \( P_1(x) \) and \( P_2(x) \) be monic quadratic trinomials, and let \( A_1 \) and \( A_2 \) be the vertices of the parabolas \( y = P_1(x) \) and \( y = P_2(x) \), respectively. Let \( m(g(x)) \) denote the minimum value of the function \( g(x) \). It is known that the differences \( m(P_1(P_2(x))) - m(P_1(x)) \) and \( m(P_2(P_1(x))) - m(P_2(x)) \) are equal positive numbers. Find the angle between the line \( A_1A_2 \) and the $x$-axis. \\
We define $(x_1, x_2, \ldots , x_n) \Delta (y_1, y_2, \ldots , y_n) = \left( \sum_{i=1}^{n}x_iy_{2-i}, \sum_{i=1}^{n}x_iy_{3-i}, \ldots , \sum_{i=1}^{n}x_iy_{n+1-i} \right)$, where the indices are taken modulo $n$. Besides this, if $v$ is a vector, we define $v^k = v$, if $k=1$, or $v^k = v \Delta v^{k-1}$, otherwise. Prove that, if $(x_1, x_2, \ldots , x_n)^k = (0, 0, \ldots , 0)$, for some natural number $k$, then $x_1 = x_2 = \ldots = x_n = 0$.
The graph of $ y \equal{} x^6 \minus{} 10x^5 \plus{} 29x^4 \minus{} 4x^3 \plus{} ax^2$ lies above the line $ y \equal{} bx \plus{} c$ except at three values of $ x$, where the graph and the line intersect. What is the largest of those values? $ \textbf{(A)}\ 4 \qquad \textbf{(B)}\ 5 \qquad \textbf{(C)}\ 6 \qquad \textbf{(D)}\ 7 \qquad \textbf{(E)}\ 8$
Suppose that the roots of $x^3+3x^2+4x-11=0$ are $a, b,$ and $c,$ and that the roots of $x^3+rx^2+sx+t=0$ are $a+b, b+c,$ and $c+a.$ Find $t.$
Egor and Igor take turns (Igor starts) replacing the coefficients of the polynomial \[a_{99}x^{99} + \cdots + a_1x + a_0\]with non-zero integers. Egor wants the polynomial to have as many different integer roots as possible. What is the largest number of roots he can always achieve?
Calculate $f(\sqrt[3]{2}-1) $, where $$f(x) = x^{1999} + 3x^{1998} + 4x^{1997} + 2x^{1996} + 4x^{1995} + 2x^{1994} + ...$$ $$... + 4x^3 + 2x^2 + 3x+ 1.$$