Let $S$ be the set of all pairs $(a,b)$ of real numbers satisfying $1+a+a^2+a^3 = b^2(1+3a)$ and $1+2a+3a^2 = b^2 - \frac{5}{b}$. Find $A+B+C$, where \[ A = \prod_{(a,b) \in S} a , \quad B = \prod_{(a,b) \in S} b , \quad \text{and} \quad C = \sum_{(a,b) \in S} ab. \][i]Proposed by Evan Chen[/i]

Which of the following sets of $ x$-values satisfy the inequality $ 2x^2 \plus{} x < 6?$ $ \textbf{(A)}\ \minus{} 2 < x < \frac{3}{2} \qquad \textbf{(B)}\ x > \frac32 \text{ or }x < \minus{} 2 \qquad \textbf{(C)}\ x < \frac32 \qquad \textbf{(D)}\ \frac32 < x < 2 \qquad \textbf{(E)}\ x < \minus{} 2$

Prove that, among $100000$ consecutive $100$-digit positive integers, there is an integer $n$ such that the length of the period of the decimal expansion of $\frac1n$ is greater than $2011$.

Let $Q$ be a quadratic polynomial with a unique zero. Suppose $Q(12)=Q(16)$ and $Q(20)=24$. Compute $Q(28)$.

Given the equation $3x^2 - 4x + k = 0$ with real roots. The value of $k$ for which the product of the roots of the equation is a maximum is: $\textbf{(A)}\ \dfrac{16}{9} \qquad \textbf{(B)}\ \dfrac{16}{3}\qquad \textbf{(C)}\ \dfrac{4}{9} \qquad \textbf{(D)}\ \dfrac{4}{3} \qquad \textbf{(E)}\ -\dfrac{4}{3}$

$29$ quadratic polynomials $f_1(x), \ldots, f_{29}(x)$ and $15$ real numbers $x_1<x_2<\ldots<x_{15}$ are given. Prove that for some two given polynomials $f_i(x)$ and $f_j(x)$ the following inequality holds: $$\sum_{k=1}^{14} (f_i(x_{k+1})-f_i(x_k))(f_j(x_{k+1})-f_j(x_k))>0$$ [i]A. Voidelevich[/i]

If $ a > 1$, then the sum of the real solutions of \[\sqrt{a \minus{} \sqrt{a \plus{} x}} \equal{} x\] is equal to $ \textbf{(A)}\ \sqrt{a} \minus{} 1\qquad \textbf{(B)}\ \frac{\sqrt{a} \minus{} 1}{2}\qquad \textbf{(C)}\ \sqrt{a \minus{} 1}\qquad \textbf{(D)}\ \frac{\sqrt{a \minus{} 1}}{2}\qquad \textbf{(E)}\ \frac{\sqrt{4a \minus{} 3} \minus{} 1}{2}$

Let a quadratic polynomial $g(x) = ax^2 + bx + c$ be given and an integer $n \ge 1$. Prove that there exists at most one polynomial $f(x)$ of $n$th degree such that $f(g(x)) = g(f(x)).$

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...

$a,b,c$ - different natural numbers. Can we build quadratic polynomial $P(x)=kx^2+lx+m$, with $k,l,m$ are integer, $k>0$ that for some integer points it get values $a^3,b^3,c^3$ ?

Square $ ABCD$ has side length $ s$, a circle centered at $ E$ has radius $ r$, and $ r$ and $ s$ are both rational. The circle passes through $ D$, and $ D$ lies on $ \overline{BE}$. Point $ F$ lies on the circle, on the same side of $ \overline{BE}$ as $ A$. Segment $ AF$ is tangent to the circle, and $ AF \equal{} \sqrt {9 \plus{} 5\sqrt {2}}$. What is $ r/s$? [asy]unitsize(6mm); defaultpen(linewidth(.8pt)+fontsize(10pt)); dotfactor=3; pair B=(0,0), C=(3,0), D=(3,3), A=(0,3); pair Ep=(3+5*sqrt(2)/6,3+5*sqrt(2)/6); pair F=intersectionpoints(Circle(A,sqrt(9+5*sqrt(2))),Circle(Ep,5/3))[0]; pair[] dots={A,B,C,D,Ep,F}; draw(A--F); draw(Circle(Ep,5/3)); draw(A--B--C--D--cycle); dot(dots); label("$A$",A,NW); label("$B$",B,SW); label("$C$",C,SE); label("$D$",D,SW); label("$E$",Ep,E); label("$F$",F,NW);[/asy]$ \textbf{(A) } \frac {1}{2}\qquad \textbf{(B) } \frac {5}{9}\qquad \textbf{(C) } \frac {3}{5}\qquad \textbf{(D) } \frac {5}{3}\qquad \textbf{(E) } \frac {9}{5}$

Do there exist non-zero reals $a$, $b$, $c$ such that, for any $n>3$, there exists a polynomial $P_{n}(x) = x^{n}+\dots+a x^{2}+bx+c$, which has exactly $n$ (not necessary distinct) integral roots? [i]N. Agakhanov, I. Bogdanov[/i]

Define the polynomials $P_0, P_1, P_2 \cdots$ by: \[ P_0(x)=x^3+213x^2-67x-2000 \] \[ P_n(x)=P_{n-1}(x-n), n \in N \] Find the coefficient of $x$ in $P_{21}(x)$.

For a sequence $ a_i \in \mathbb{R}, i \in \{0, 1, 2, \ldots\}$ we have $ a_0 \equal{} 1$ and \[ a_{n\plus{}1} \equal{} a_n \plus{} \sqrt{a_{n\plus{}1} \plus{} a_n} \quad \forall n \in \mathbb{N}.\] Prove that this sequence is unique and find an explicit formula for this recursively defined sequence.

Quadratic trinomials $f$ and $g$ with integer coefficients obtain only positive values and the inequality $\dfrac{f(x)}{g(x)}\geq \sqrt{2}$ is true $\forall x\in\mathbb{R}$. Prove that $\dfrac{f(x)}{g(x)}>\sqrt{2}$ is true $\forall x\in\mathbb{R}$ [I]Proposed by A. Khrabrov[/i]

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}$.

The remainder $R$ obtained by dividing $x^{100}$ by $x^2-3x+2$ is a polynomial of degree less than $2$. Then $R$ may be written as: $\textbf{(A) }2^{100}-1\qquad \textbf{(B) }2^{100}(x-1)-(x-2)\qquad \textbf{(C) }2^{100}(x-3)\qquad$ $\textbf{(D) }x(2^{100}-1)+2(2^{99}-1)\qquad \textbf{(E) }2^{100}(x+1)-(x+2)$

Let $ ABC$ be a triangle with $ AB \equal{} 5$, $ BC \equal{} 4$ and $ AC \equal{} 3$. Let $ \mathcal P$ and $ \mathcal Q$ be squares inside $ ABC$ with disjoint interiors such that they both have one side lying on $ AB$. Also, the two squares each have an edge lying on a common line perpendicular to $ AB$, and $ \mathcal P$ has one vertex on $ AC$ and $ \mathcal Q$ has one vertex on $ BC$. Determine the minimum value of the sum of the areas of the two squares. [asy]import olympiad; import math; import graph; unitsize(1.5cm); pair A, B, C; A = origin; B = A + 5 * right; C = (9/5, 12/5); pair X = .7 * A + .3 * B; pair Xa = X + dir(135); pair Xb = X + dir(45); pair Ya = extension(X, Xa, A, C); pair Yb = extension(X, Xb, B, C); pair Oa = (X + Ya)/2; pair Ob = (X + Yb)/2; pair Ya1 = (X.x, Ya.y); pair Ya2 = (Ya.x, X.y); pair Yb1 = (Yb.x, X.y); pair Yb2 = (X.x, Yb.y); draw(A--B--C--cycle); draw(Ya--Ya1--X--Ya2--cycle); draw(Yb--Yb1--X--Yb2--cycle); label("$A$", A, W); label("$B$", B, E); label("$C$", C, N); label("$\mathcal P$", Oa, origin); label("$\mathcal Q$", Ob, origin);[/asy]

Prove that the sequence $ \{y_{n}\}_{n \ge 1}$ defined by \[ y_{0}=1, \; y_{n+1}= \frac{1}{2}\left( 3y_{n}+\sqrt{5y_{n}^{2}-4}\right) \] consists only of integers.

Which integers can be represented as \[\frac{(x+y+z)^{2}}{xyz}\] where $x$, $y$, and $z$ are positive integers?

Find all pairs of positive integers $ a,b$ such that \begin{align*} b^2 + b+ 1 & \equiv 0 \pmod a \\ a^2+a+1 &\equiv 0 \pmod b . \end{align*}

There are infinitely many ordered pairs $(m,n)$ of positive integers for which the sum \[ m + ( m + 1) + ( m + 2) +... + ( n - 1 )+n\] is equal to the product $mn$. The four pairs with the smallest values of $m$ are $(1, 1), (3, 6), (15, 35),$ and $(85, 204)$. Find three more $(m, n)$ pairs.

Prove that there are infinitely many positive integers $ n$ such that $ n^{2} \plus{} 1$ has a prime divisor greater than $ 2n \plus{} \sqrt {2n}$. [i]Author: Kestutis Cesnavicius, Lithuania[/i]

Suppose $p$ is a prime with $p \equiv 3 \; \pmod{4}$. Show that for any set of $p-1$ consecutive integers, the set cannot be divided two subsets so that the product of the members of the one set is equal to the product of the members of the other set.

Let $f : \mathbb{C} \to \mathbb{C} $ be defined by $ f(z) = z^2 + iz + 1 $. How many complex numbers $z $ are there such that $ \text{Im}(z) > 0 $ and both the real and the imaginary parts of $f(z)$ are integers with absolute value at most $ 10 $? ${ \textbf{(A)} \ 399 \qquad \textbf{(B)} \ 401 \qquad \textbf{(C)} \ 413 \qquad \textbf{(D}} \ 431 \qquad \textbf{(E)} \ 441 $