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: 236

The zeroes of the function $f(x)=x^2-ax+2a$ are integers. What is the sum of all possible values of $a$? $\textbf{(A) }7\qquad\textbf{(B) }8\qquad\textbf{(C) }16\qquad\textbf{(D) }17\qquad\textbf{(E) }18$
What is the sum of the reciprocals of the roots of the equation \[ \frac {2003}{2004}x \plus{} 1 \plus{} \frac {1}{x} \equal{} 0? \] $ \textbf{(A)}\ \minus{}\! \frac {2004}{2003} \qquad \textbf{(B)}\ \minus{} \!1 \qquad \textbf{(C)}\ \frac {2003}{2004} \qquad \textbf{(D)}\ 1 \qquad \textbf{(E)}\ \frac {2004}{2003}$
Let $P(x)$ be a polynomial with integer coefficients that satisfies $P(17)=10$ and $P(24)=17$. Given that $P(n)=n+3$ has two distinct integer solutions $n_1$ and $n_2$, find the product $n_1\cdot n_2$.
Find the sum of all solutions of the equation $\frac{1}{x^2-1}+\frac{2}{x^2-2}+\frac{3}{x^2-3}+\frac{4}{x^2-4}=2010x-4$
Prove that for any positive integer $ m$ there exist an infinite number of pairs of integers $ (x, y)$ such that [i](i)[/i] $ x$ and $ y$ are relatively prime; [i](ii)[/i] $ y$ divides $ x^2 \plus{} m$; [i](iii)[/i] $ x$ divides $ y^2 \plus{} m.$ [i](iv)[/i] $ x \plus{} y \leq m \plus{} 1\minus{}$ (optional condition)
Determine all integers $a$ for which the equation \[x^{2}+axy+y^{2}=1\] has infinitely many distinct integer solutions $x, \;y$.
If $ a$, $ b$, $ c$, and $ d$ are the solutions of the equation $ x^4 \minus{} bx \minus{} 3 \equal{} 0$, then an equation whose solutions are \[ \frac {a \plus{} b \plus{} c}{d^2}, \frac {a \plus{} b \plus{} d}{c^2}, \frac {a \plus{} c \plus{} d}{b^2}, \frac {b \plus{} c \plus{} d}{a^2} \]is $ \textbf{(A)}\ 3x^4 \plus{} bx \plus{} 1 \equal{} 0\qquad \textbf{(B)}\ 3x^4 \minus{} bx \plus{} 1 \equal{} 0\qquad \textbf{(C)}\ 3x^4 \plus{} bx^3 \minus{} 1 \equal{} 0$ $ \textbf{(D)}\ 3x^4 \minus{} bx^3 \minus{} 1 \equal{} 0\qquad \textbf{(E)}\ \text{none of these}$
Let $x_1$ and $x_2$ be the roots of the equation $x^2 + 3x + 1 = 0$. Compute \[\left(\frac{x_1}{x_2 + 1}\right)^2 + \left(\frac{x_2}{x_1 + 1}\right)^2\]
The roots of $ Ax^2 \plus{} Bx \plus{} C \equal{} 0$ are $ r$ and $ s$. For the roots of \[ x^2 \plus{} px \plus{} q \equal{} 0 \] to be $ r^2$ and $ s^2$, $ p$ must equal: $ \textbf{(A)}\ \frac{B^2 \minus{} 4AC}{A^2}\qquad \textbf{(B)}\ \frac{B^2 \minus{} 2AC}{A^2}\qquad \textbf{(C)}\ \frac{2AC \minus{} B^2}{A^2}\qquad \\ \textbf{(D)}\ B^2 \minus{} 2C\qquad \textbf{(E)}\ 2C \minus{} B^2$
Let $a,b$ be two positive integers, such that $ab\neq 1$. Find all the integer values that $f(a,b)$ can take, where \[ f(a,b) = \frac { a^2+ab+b^2} { ab- 1} . \]
Determine a quadric polynomial with intergral coefficients whose roots are $\cos 72^{\circ}$ and $\cos 144^{\circ}.$
Let $P(x)=kx^3+2k^2x^2+k^3$. Find the sum of all real numbers $k$ for which $x-2$ is a factor of $P(x)$. $\textbf{(A) }-8\qquad\textbf{(B) }-4\qquad\textbf{(C) }0\qquad\textbf{(D) }5\qquad\textbf{(E) }8$
Let $ n>4$ be a positive integer such that $ n$ is composite (not a prime) and divides $ \varphi (n) \sigma (n) \plus{}1$, where $ \varphi (n)$ is the Euler's totient function of $ n$ and $ \sigma (n)$ is the sum of the positive divisors of $ n$. Prove that $ n$ has at least three distinct prime factors.
Let $ f(x) \equal{} x^3 \plus{} x \plus{} 1$. Suppose $ g$ is a cubic polynomial such that $ g(0) \equal{} \minus{} 1$, and the roots of $ g$ are the squares of the roots of $ f$. Find $ g(9)$.
Knowing that the system \[x + y + z = 3,\]\[x^3 + y^3 + z^3 = 15,\]\[x^4 + y^4 + z^4 = 35,\] has a real solution $x, y, z$ for which $x^2 + y^2 + z^2 < 10$, find the value of $x^5 + y^5 + z^5$ for that solution.
Prove there exists a constant $k_0$ such that for any $k\ge k_0$, the equation \[a^{2n}+b^{4n}+2013=ka^nb^{2n}\] has no positive integer solutions $a,b,n$. [i]Proposed by István Pink.[/i]
Let $r_1$, $r_2$, $\ldots$, $r_{20}$ be the roots of the polynomial $x^{20}-7x^3+1$. If \[\dfrac{1}{r_1^2+1}+\dfrac{1}{r_2^2+1}+\cdots+\dfrac{1}{r_{20}^2+1}\] can be written in the form $\tfrac mn$ where $m$ and $n$ are positive coprime integers, find $m+n$.
$ n $ is a natural number, and $ S $ is the sum of all the solutions of the equations $$ x^2+a_k\cdot x+a_k=0,\quad a_k\in\mathbb{R} ,\quad k\in\{ 1,2,...,n\} . $$ Show that if $ |S|>2n\left( \sqrt[n]{n} -1\right) , $ then at least one of the equations has real solutions.
Both roots of the quadratic equation $ x^2 \minus{} 63x \plus{} k \equal{} 0$ are prime numbers. The number of possible values of $ k$ is $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ \textbf{more than four}$
Suppose $p$ is an odd prime number. We call the polynomial $f(x)=\sum_{j=0}^n a_jx^j$ with integer coefficients $i$-remainder if $ \sum_{p-1|j,j>0}a_{j}\equiv i\pmod{p}$. Prove that the set $\{f(0),f(1),...,f(p-1)\}$ is a complete residue system modulo $p$ if and only if polynomials $f(x), (f(x))^2,...,(f(x))^{p-2}$ are $0$-remainder and the polynomial $(f(x))^{p-1}$ is $1$-remainder. [i]Proposed by Yahya Motevassel[/i]
Each of two different lines parallel to the the axis $Ox$ have exactly two common points on the graph of the function $f(x)=x^3+ax^2+bx+c$. Let $\ell_1$ and $\ell_2$ be two lines parallel to $Ox$ axis which meet the graph of $f$ in points $K_1, K_2$ and $K_3, K_4$, respectively. Prove that the quadrilateral formed by $K_1, K_2, K_3$ and $ K_4$ is a rhombus if and only if its area is equal to $6$ units.
Let $p$ be an odd prime. If $g_{1}, \cdots, g_{\phi(p-1)}$ are the primitive roots $\pmod{p}$ in the range $1<g \le p-1$, prove that \[\sum_{i=1}^{\phi(p-1)}g_{i}\equiv \mu(p-1) \pmod{p}.\]
Show that the solution set of the inequality \[ \sum^{70}_{k \equal{} 1} \frac {k}{x \minus{} k} \geq \frac {5}{4} \] is a union of disjoint intervals, the sum of whose length is 1988.
Let $m>1$ and $n>1$ be integers. Suppose that the product of the solutions for $x$ of the equation \[8(\log_n x)(\log_m x) - 7 \log_n x - 6 \log_m x - 2013 = 0\] is the smallest possible integer. What is $m+n$? ${ \textbf{(A)}\ 12\qquad\textbf{(B)}\ 20\qquad\textbf{(C)}\ 24\qquad\textbf{(D}}\ 48\qquad\textbf{(E)}\ 272 $