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

Let $f(x)$ be a quadratic polynomial with two real roots in the interval $[-1,1]$. Prove that if the maximum value of $|f(x)|$ in the interval $[-1,1]$ is equal to $1$, then the maximum value of $|f'(x)|$ in the interval $[-1,1]$ is not less than $1$.
Let $x_1,x_2,x_3, \cdots$ be a sequence defined by the following recurrence relation: \[ \begin{cases}x_{1}&= 4\\ x_{n+1}&= x_{1}x_{2}x_{3}\cdots x_{n}+5\text{ for }n\ge 1\end{cases} \] The first few terms of the sequence are $x_1=4,x_2=9,x_3=41 \cdots$ Find all pairs of positive integers $\{a,b\}$ such that $x_a x_b$ is a perfect square.
Find all the polynomials with real coefficients which satisfy $ (x^2-6x+8)P(x)=(x^2+2x)P(x-2)$ for all $x\in \mathbb{R}$.
Suppose that $ a,b$ are positive integers for which $ A\equal{}\frac{a\plus{}1}{b}\plus{}\frac{b}{a}$ is an integer.Prove that $ A\equal{}3$.
Do there exist natural numbers $a, b$ and $c$ such that $a^2+b^2+c^2$ is divisible by $2013(ab+bc+ca)$? [i]Proposed by Mahan Malihi[/i]
A sequence of distinct circles $\omega_1, \omega_2, \cdots$ is inscribed in the parabola $y=x^2$ so that $\omega_n$ and $\omega_{n+1}$ are tangent for all $n$. If $\omega_1$ has diameter $1$ and touches the parabola at $(0,0)$, find the diameter of $\omega_{1998}$.
Let $t$ be an integer. Suppose the equation $$x^2 + (4t - 1) x + 4t^2 = 0$$ has at least one positive integer solution $n$. Show that $n$ is a perfect square.
Give an example of a second degree polynomial $P\in \mathbb{R}[x]$ such that \[\forall x\in \mathbb{R}\text{ with } |x|\leqslant 1: \; \left|P(x)+\frac{1}{x-4}\right| \leqslant 0.01.\] Are there linear polynomials with this property? [i]Octavian Stănășilă[/i]
For how many values of the constant $k$ will the polynomial $x^{2}+kx+36$ have two distinct integer roots? $\textbf{(A) }6 \qquad \textbf{(B) }8 \qquad \textbf{(C) }9 \qquad \textbf{(D) }14 \qquad \textbf{(E) }16$
Prove that the equation $3y^2 = x^4 + x$ has no positive integer solutions.
A small square is constructed inside a square of area 1 by dividing each side of the unit square into $n$ equal parts, and then connecting the vertices to the division points closest to the opposite vertices. Find the value of $n$ if the the area of the small square is exactly 1/1985. [asy] size(200); pair A=(0,1), B=(1,1), C=(1,0), D=origin; draw(A--B--C--D--A--(1,1/6)); draw(C--(0,5/6)^^B--(1/6,0)^^D--(5/6,1)); pair point=( 0.5 , 0.5 ); //label("$A$", A, dir(point--A)); //label("$B$", B, dir(point--B)); //label("$C$", C, dir(point--C)); //label("$D$", D, dir(point--D)); label("$1/n$", (11/12,1), N, fontsize(9));[/asy]
The formula which expresses the relationship between $x$ and $y$ as shown in the accompanying table is: \[ \begin{tabular}[t]{|c|c|c|c|c|c|}\hline x&0&1&2&3&4\\\hline y&100&90&70&40&0\\\hline \end{tabular}\] $\textbf{(A)}\ y=100-10x \qquad \textbf{(B)}\ y=100-5x^2 \qquad \textbf{(C)}\ y=100-5x-5x^2 \qquad\\ \textbf{(D)}\ y=20-x-x^2 \qquad \textbf{(E)}\ \text{None of these}$
In this question we re-define the operations addition and multiplication as follows: $a + b$ is defined as the minimum of $a$ and $b$, while $a * b$ is defined to be the sum of $a$ and $b$. For example, $3+4 = 3$, $3*4 = 7$, and $$3*4^2+5*4+7 = \min(\text{3 plus 4 plus 4}, \text{5 plus 4}, 7) = \min(11, 9, 7) = 7.$$ Let $a, b, c$ be real numbers. Characterize, in terms of $a, b, c$, what the graph of $y = ax^2+bx+c$ looks like.
Find all nonnegative integers $m$ such that \[a_m=(2^{2m+1})^2+1 \] is divisible by at most two different primes.
For integers $x$, $y$, and $z$, we have $(x-y)(y-z)(z-x)=x+y+z$. Prove that $27|x+y+z$.
The board contains $20$ non-constant linear functions, not necessarily distinct. For each pair $(f, g)$ of these functions ($190$ pairs in total), Victor writes on the board a quadratic function $f(x)\cdot g(x) - 2$, and Solomiya writes on the board a quadratic function $f(x)g(x)-1$. Victor calculated that exactly $V$ of his quadratic functions have a root, and Solomiya calculated that exactly $S$ of her quadratic functions have a root. Find the largest possible value of $S-V$. [i]Remarks.[/i] A linear function $y = kx+b$ is called non-constant if $k\neq 0$. [i]Proposed by Oleksiy Masalitin[/i]
Let be a quadratic polynom that has the property that the modulus of the sum between the leading and the free coefficient is smaller than the modulus of the middle coefficient. Prove that this polynom admits two distinct real roots, one belonging to the interval $ (-1,1) , $ and the other belonging outside of the interval $ (-1,1). $
The remainder on dividing the polynomial $p(x)$ by $x^2 - (a+b)x + ab$ (where $a \not = b$) is $mx + n$. Find the coefficients $m, n$ in terms of $a, b$. Find $m, n$ for the case $p(x) = x^{200}$ divided by $x^2 - x - 2$ and show that they are integral.
$L$ and $M$ are two parallel lines a distance $d$ apart. Given $r$ and $x$, construct a triangle $ABC$, with $A$ on $L$, and $B$ and $C$ on $M$, such that the inradius is $r$, and angle $A = x$. Calculate angles $B$ and $C$ in terms of $d$, $r$ and $x$. If the incircle touches the side $BC$ at $D$, find a relation between $BD$ and $DC$
If $n$ is a positive integer, let $A = \{n,n+1,...,n+17 \}$. Does there exist some values of $n$ for which we can divide $A$ into two disjoints subsets $B$ and $C$ such that the product of the elements of $B$ is equal to the product of the elements of $C$?
Figures $ 0$, $ 1$, $ 2$, and $ 3$ consist of $ 1$, $ 5$, $ 13$, and $ 25$ nonoverlapping squares, respectively. If the pattern were continued, how many nonoverlapping squares would there be in figure $ 100$? [asy] unitsize(8); draw((0,0)--(1,0)--(1,1)--(0,1)--cycle); draw((9,0)--(10,0)--(10,3)--(9,3)--cycle); draw((8,1)--(11,1)--(11,2)--(8,2)--cycle); draw((19,0)--(20,0)--(20,5)--(19,5)--cycle); draw((18,1)--(21,1)--(21,4)--(18,4)--cycle); draw((17,2)--(22,2)--(22,3)--(17,3)--cycle); draw((32,0)--(33,0)--(33,7)--(32,7)--cycle); draw((29,3)--(36,3)--(36,4)--(29,4)--cycle); draw((31,1)--(34,1)--(34,6)--(31,6)--cycle); draw((30,2)--(35,2)--(35,5)--(30,5)--cycle); label("Figure",(0.5,-1),S); label("$0$",(0.5,-2.5),S); label("Figure",(9.5,-1),S); label("$1$",(9.5,-2.5),S); label("Figure",(19.5,-1),S); label("$2$",(19.5,-2.5),S); label("Figure",(32.5,-1),S); label("$3$",(32.5,-2.5),S);[/asy]$ \textbf{(A)}\ 10401 \qquad \textbf{(B)}\ 19801 \qquad \textbf{(C)}\ 20201 \qquad \textbf{(D)}\ 39801 \qquad \textbf{(E)}\ 40801$
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} . \]
Quadratic equation $ x^2\plus{}ax\plus{}b\plus{}1\equal{}0$ have 2 positive integer roots, for integers $ a,b$. Show that $ a^2\plus{}b^2$ is not a prime.
Written on a blackboard is the polynomial $x^2+x+2014$. Calvin and Hobbes take turns alternately (starting with Calvin) in the following game. At his turn, Calvin should either increase or decrease the coefficient of $x$ by $1$. And at this turn, Hobbes should either increase or decrease the constant coefficient by $1$. Calvin wins if at any point of time the polynomial on the blackboard at that instant has integer roots. Prove that Calvin has a winning stratergy.
Let $a$, $b$, and $c$ be three distinct one-digit numbers. What is the maximum value of the sum of the roots of the equation $(x-a)(x-b)+(x-b)(x-c)=0$? $\textbf{(A) } 15 \qquad\textbf{(B) } 15.5 \qquad\textbf{(C) } 16 \qquad\textbf{(D) } 16.5 \qquad\textbf{(E) } 17 $