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

For certain real numbers $a$, $b$, and $c$, the polynomial \[g(x) = x^3 + ax^2 + x + 10\] has three distinct roots, and each root of $g(x)$ is also a root of the polynomial \[f(x) = x^4 + x^3 + bx^2 + 100x + c.\] What is $f(1)$? $\textbf{(A)}\ -9009 \qquad\textbf{(B)}\ -8008 \qquad\textbf{(C)}\ -7007 \qquad\textbf{(D)}\ -6006 \qquad\textbf{(E)}\ -5005$
All non-zero coefficients of the polynomial $f(x)$ equal $1$, while the sum of the coefficients is $20$. Is it possible that thirteen coefficients of $f^2(x)$ equal $9$? [i](S. Ivanov, K. Kokhas)[/i]
What is the sum of all possible values of $k$ for which the polynomials $x^2 - 3x + 2$ and $x^2 - 5x + k$ have a root in common? $ \textbf{(A) }3 \qquad \textbf{(B) }4 \qquad \textbf{(C) }5 \qquad \textbf{(D) }6 \qquad \textbf{(E) }10 \qquad $
Suppose $P(x)$ is a degree $n$ monic polynomial with integer coefficients such that $2013$ divides $P(r)$ for exactly $1000$ values of $r$ between $1$ and $2013$ inclusive. Find the minimum value of $n$.
Consider a polynomial with coefficients of real numbers $ \phi(x)\equal{}ax^3\plus{}bx^2\plus{}cx\plus{}d$ with three positive real roots. Assume that $ \phi(0)<0$, prove that \[ 2b^3\plus{}9a^2d\minus{}7abc \le 0.\] [i]Hery Susanto, Malang[/i]
Given the polynomial sequence $(p_{n}(x))$ satisfying $p_{1}(x)=x^{2}-1$, $p_{2}(x)=2x(x^{2}-1)$, and $p_{n+1}(x)p_{n-1}(x)=(p_{n}(x)^{2}-(x^{2}-1)^{2}$, for $n\geq 2$, let $s_{n}$ be the sum of the absolute values of the coefficients of $p_{n}(x)$. For each $n$, find a non-negative integer $k_{n}$ such that $2^{-k_{n}}s_n$ is odd.
Three real numbers $ a,b,c$ satisfy the equations $ a\plus{}b\plus{}c\equal{}3, a^2\plus{}b^2\plus{}c^2\equal{}9, a^3\plus{}b^3\plus{}c^3\equal{}24.$ Find $ a^4\plus{}b^4\plus{}c^4$.
Suppose the real number $\lambda \in \left( 0,1\right),$ and let $n$ be a positive integer. Prove that the modulus of all the roots of the polynomial $$f\left ( x \right )=\sum_{k=0}^{n}\binom{n}{k}\lambda^{k\left ( n-k \right )}x^{k}$$ are $1.$
In the complex plane, consider squares having the following property: the complex numbers its vertex correspond to are exactly the roots of integer coefficients equation $ x^4 \plus{} px^3 \plus{} qx^2 \plus{} rx \plus{} s \equal{} 0$. Find the minimum of square areas.
Let $t\in (1,2)$. Show that there exists a polynomial $P(x)=a_nx^n+a_{n-1}x^{n-1}+...+a_1x+a_0$ with the coefficients in $\{1,-1\}$ such that $\left|P(t)-2019\right| \leqslant 1.$ [i]Proposed by N. Safaei (Iran)[/i]
Find all polynomials $P(x)$ with real coefficients which satisfies \\ $P(2015)=2025$ and $P(x)-10=\sqrt{P(x^{2}+3)-13}$ for every $x\ge 0$ .
Let $n$ be a positive integer. Find all positive integers $m$ for which there exists a polynomial $f(x) = a_{0} + \cdots + a_{n}x^{n} \in \mathbb{Z}[X]$ ($a_{n} \not= 0$) such that $\gcd(a_{0},a_{1},\cdots,a_{n},m)=1$ and $m|f(k)$ for each $k \in \mathbb{Z}$.
Decide whether or not there exists a nonconstant polynomial $Q(x)$ with integer coefficients with the following property: for every positive integer $n > 2$, the numbers \[ Q(0), \; Q(1), Q(2), \; \dots, \; Q(n-1) \] produce at most $0.499n$ distinct residues when taken modulo $n$. [i]Proposed by Yang Liu[/i]
What is the value of the sum \[ \sum_z \frac{1}{{\left|1 - z\right|}^2} \, , \] where $z$ ranges over all 7 solutions (real and nonreal) of the equation $z^7 = -1$?
The numbers in the sequence 101, 104, 109, 116, $\dots$ are of the form $a_n = 100 + n^2$, where $n = 1$, 2, 3, $\dots$. For each $n$, let $d_n$ be the greatest common divisor of $a_n$ and $a_{n + 1}$. Find the maximum value of $d_n$ as $n$ ranges through the positive integers.
Let $x \neq 0$ be a real number satisfying $ax^2+bx+c=0$ with $a,b,c \in \mathbb{Z}$ obeying $|a|+|b|+|c| > 1$. Then prove \[ |x| \geq \frac{1}{|a|+|b|+|c|-1}. \]
Let $ z_{1},z_{2},z_{3}$ be three complex numbers of moduli less than or equal to $ 1$. $ w_{1},w_{2}$ are two roots of the equation $ (z \minus{} z_{1})(z \minus{} z_{2}) \plus{} (z \minus{} z_{2})(z \minus{} z_{3}) \plus{} (z \minus{} z_{3})(z \minus{} z_{1}) \equal{} 0$. Prove that, for $ j \equal{} 1,2,3$, $\min\{|z_{j} \minus{} w_{1}|,|z_{j} \minus{} w_{2}|\}\leq 1$ holds.
Find all polynomials $P(x,y)$ with real coefficients such that for all real numbers $x,y$ and $z$: $$P(x,2yz)+P(y,2zx)+P(z,2xy)=P(x+y+z,xy+yz+zx).$$ [i]Proposed by Sina Saleh[/i]
If integers $m,n,k$ satisfy $m^2+n^2+1=kmn$, what values can $k$ have?
One member of an infinite arithmetic sequence in the set of natural numbers is a perfect square. Show that there are infinitely many members of this sequence having this property.
We distribute $n\ge1$ labelled balls among nine persons $A,B,C, \dots , I$. How many ways are there to do this so that $A$ gets the same number of balls as $B,C,D$ and $E$ together?
a) Prove that there are two polynomials in $ \mathbb Z[x]$ with at least one coefficient larger than 1387 such that coefficients of their product is in the set $ \{\minus{}1,0,1\}$. b) Does there exist a multiple of $ x^2\minus{}3x\plus{}1$ such that all of its coefficient are in the set $ \{\minus{}1,0,1\}$
(a) Is there a polynomial $P(x)$ with real coefficients such that $P\left(\frac1k\right)=\frac{k+2}k$ for all positive integers $k$? (b) Is there a polynomial $P(x)$ with real coefficients such that $P\left(\frac1k\right)=\frac1{2k+1}$ for all positive integers $k$?
Do there exist two quadratic trinomials $ax^2 +bx+c$ and $(a+1)x^2 +(b + 1)x + (c + 1)$ with integer coeficients, both of which have two integer roots? [i]N. Agakhanov[/i]