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

Let $S = \left\{ 1,2, \dots, 2014 \right\}$. Suppose that \[ \sum_{T \subseteq S} i^{\left\lvert T \right\rvert} = p + qi \] where $p$ and $q$ are integers, $i = \sqrt{-1}$, and the summation runs over all $2^{2014}$ subsets of $S$. Find the remainder when $\left\lvert p\right\rvert + \left\lvert q \right\rvert$ is divided by $1000$. (Here $\left\lvert X \right\rvert$ denotes the number of elements in a set $X$.) [i]Proposed by David Altizio[/i]
Let's consider all possible quadratic trinomials of the form $x^2 + ax + b$, where $a$ and $b$ are positive integers not exceeding some positive integer $N$. Prove that the number of pairs of such trinomials having a common root does not exceed $N^2$.
Show that there exist a polynomial $P(x)$ whose one cofficient is $\frac{1}{2016}$ and remaining cofficients are rational numbers, such that $P(x)$ is an integer for any integer $x$ .
Let $n$ be a positive integer. Find all polynomials $P$ with real coefficients such that $$P(x^2+x-n^2)=P(x)^2+P(x)$$ for all real numbers $x$.
Find all polynomials $P(x)$ with integer coefficients such that for all real numbers $s$ and $t$, if $P(s)$ and $P(t)$ are both integers, then $P(st)$ is also an integer.
Consider a sequence of polynomials such that $P_0(x)=2,P_1(x)=x$ and for all $n\ge1$ \[P_{n+1}(x)+P_{n-1}(x)=xP_n(x).\] a) Determine the polynomial \[Q_n(x)=P^2_n(x)-xP_n(x)P_{n-1}(x)+P^2_{n-1}(x)\] for $n=1972.$ b) Express the polynomial \[\bigl(P_{n+1}(x)-P_{n-1}(x)\bigr)^2\] in terms of $P_n(x),Q_n(x).$
Let $a, b$, and $c$ be real numbers such that \[\frac{1}{bc-a^2} + \frac{1}{ca-b^2}+\frac{1}{ab-c^2} = 0.\] Prove that \[\frac{a}{(bc-a^2)^2} + \frac{b}{(ca-b^2)^2}+\frac{c}{(ab-c^2)^2} = 0.\]
$P(x)$ is a polynomial of degree $3n$ such that \begin{eqnarray*} P(0) = P(3) = \cdots &=& P(3n) = 2, \\ P(1) = P(4) = \cdots &=& P(3n-2) = 1, \\ P(2) = P(5) = \cdots &=& P(3n-1) = 0, \quad\text{ and }\\ && P(3n+1) = 730.\end{eqnarray*} Determine $n$.
$p(x)$ is a polynomial with integer coefficients. The sequence of integers $a_1, a_2, ... , a_n$ (where $n > 2$) satisfies $a_2 = p(a_1), a_3 = p(a_2), ... , a_n = p(a_{n-1}), a_1 = p(a_n)$. Show that $a_1 = a_3$.
The roots of $x^2+bx+c=0$ are both real and greater than $1$. Let $s=b+c+1$. Then $s:$ $ \textbf{(A)}\ \text{may be less than zero}\qquad\textbf{(B)}\ \text{may be equal to zero}\qquad$ $\textbf{(C)}\ \text{must be greater than zero}\qquad\textbf{(D)}\ \text{must be less than zero}\qquad $ $\textbf{(E)}\text{ must be between -1 and +1} $
a. View the second-degree quadratic equation $x^2+? x +? = 0$ Two players successively put an integer each at the location of a question mark. Show that the second player can always ensure that the quadratic gets two integer solutions. Note: we say that the quadratic also has two integer solutions, even when they are equal (for example if they are both equal to $3$). b.View the third-degree equation $x^3 +? x^2 +? x +? = 0$ Three players successively put an integer each at the location of a question mark. The equation appears to have three integer (possibly again the same) solutions. It is given that two players each put a $3$ in the place of a question mark. What number did the third player put? Determine that number and the place where it is placed and prove that only one number is possible.
Find the shortest distance between the point $(6,12)$ and the parabola given by the equation $x=\frac{y^2}{2}$
Let $p$ be a prime satisfying $p^2\mid 2^{p-1}-1$, and let $n$ be a positive integer. Define \[ f(x) = \frac{(x-1)^{p^n}-(x^{p^n}-1)}{p(x-1)}. \] Find the largest positive integer $N$ such that there exist polynomials $g(x)$, $h(x)$ with integer coefficients and an integer $r$ satisfying $f(x) = (x-r)^N g(x) + p \cdot h(x)$. [i]Proposed by Victor Wang[/i]
Let $g(x)=x^5+x^4+x^3+x^2+x+1$. What is the remainder when the polynomial $g(x^{12})$ is divided by the polynomial $g(x)$? $\textbf{(A) }6\qquad\textbf{(B) }5-x\qquad\textbf{(C) }4-x+x^2\qquad$ $\textbf{(D) }3-x+x^2-x^3\qquad \textbf{(E) }2-x+x^2-x^3+x^4$
Prove that for every positive integer $n$, there exists a polynomial with integer coefficients whose values at points $1,2,\dots,n$ are pairwise different powers of $2$.
How many polynomials $P$ with integer coefficients and degree at most $5$ satisfy $0 \le P(x) < 120$ for all $x \in \{0,1,2,3,4,5\}$?
Suppose that a polynomial of the form $p(x)=x^{2010}\pm x^{2009}\pm \cdots \pm x \pm 1$ has no real roots. What is the maximum possible number of coefficients of $-1$ in $p$?
The roots of the equation $x^2 + (3a + b)x + a^2 + 2b^2 = 0$ are $x_1$ and $x_2$ with $x_1 \ne x_2$. Determine the values of $a$ and $b$ so that the roots of the equation $ x^2 - 2a(3a + 2b)x + 5a^2b^2 + 4b^4 = 0$ let $x^2_1$ and $x^2_2$.
Let $ a$, $ b$, $ c$, $ d$, $ e$, $ f$ be positive integers and let $ S = a+b+c+d+e+f$. Suppose that the number $ S$ divides $ abc+def$ and $ ab+bc+ca-de-ef-df$. Prove that $ S$ is composite.
What is the maximal possible number of roots on the interval (0,1) for a polynomial of degree 2022 with integer coefficients and with the leading coefficient equal to 1?
Find the smallest positive integer $n\neq 2004$ for which there exists a polynomial $f\in\mathbb{Z}[x]$ such that the equation $f(x)=2004$ has at least one, and the equation $f(x)=n$ has at least $2004$ different integer solutions.
Let $n$ be a fixed natural number. Find all $n$ tuples of natural pairwise distinct and coprime numbers like $a_1,a_2,\ldots,a_n$ such that for $1\leq i\leq n$ we have \[ a_1+a_2+\ldots+a_n|a_1^i+a_2^i+\ldots+a_n^i \]
Let $D$ be a closed disc in the complex plane. Prove that for all positive integers $n$, and for all complex numbers $z_1,z_2,\ldots,z_n\in D$ there exists a $z\in D$ such that $z^n = z_1\cdot z_2\cdots z_n$.
Let $A=\{a_1,a_2,\cdots,a_{2010}\}$ and $B=\{b_1,b_2,\cdots,b_{2010}\}$ be two sets of complex numbers. Suppose \[\sum_{1\leq i<j\leq 2010} (a_i+a_j)^k=\sum_{1\leq i<j\leq 2010}(b_i+b_j)^k\] holds for every $k=1,2,\cdots, 2010$. Prove that $A=B$.
Find the number of quadratic polynomials $ax^2 + bx +c$ which satisfy the following: (a) $a,b,c$ are distinct; (b) $a,b,c \in \{ 1,2,3,\cdots 1999 \}$; (c) $x+1$ divides $ax^2 + bx+c$.