Let $A, B, C, D, E$ be integers, $B \neq 0$ and $F=AD^{2}-BCD+B^{2}E \neq 0$. Prove that the number $N$ of pairs of integers $(x, y)$ such that \[Ax^{2}+Bxy+Cx+Dy+E=0,\] satisfies $N \le 2 d( \vert F \vert )$, where $d(n)$ denotes the number of positive divisors of positive integer $n$.

Let the roots of $ax^2+bx+c=0$ be $r$ and $s$. The equation with roots $ar+b$ and $as+b$ is: $ \textbf{(A)}\ x^2-bx-ac=0$ $\qquad\textbf{(B)}\ x^2-bx+ac=0$ $\qquad\textbf{(C)}\ x^2+3bx+ca+2b^2=0$ ${\qquad\textbf{(D)}\ x^2+3bx-ca+2b^2=0 }$ ${\qquad\textbf{(E)}\ x^2+bx(2-a)+a^2c+b^2(a+1)=0} $

Problem 2. Let $P(x) = ax^2 + bx + c$ where $a, b, c$ are real numbers. If $$P(a) = bc, \hspace{0.5cm} P(b) = ac, \hspace{0.5cm} P(c) = ab$$ then prove that $$(a - b)(b - c)(c - a)(a + b + c) = 0.$$

In the Cartesian plane, let $G_1$ and $G_2$ be the graphs of the quadratic functions $f_1(x) = p_1x^2 + q_1x + r_1$ and $f_2(x) = p_2x^2 + q_2x + r_2$, where $p_1 > 0 > p_2$. The graphs $G_1$ and $G_2$ cross at distinct points $A$ and $B$. The four tangents to $G_1$ and $G_2$ at $A$ and $B$ form a convex quadrilateral which has an inscribed circle. Prove that the graphs $G_1$ and $G_2$ have the same axis of symmetry.

Consider the sequence $(a^n + 1)_{n\geq 1}$, with $a>1$ a fixed integer. i) Prove there exist infinitely many primes, each dividing some term of the sequence. ii) Prove there exist infinitely many primes, none dividing any term of the sequence. [i](Dan Schwarz)[/i]

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$

For all integers $n\geq 1$ we define $x_{n+1}=x_1^2+x_2^2+\cdots +x_n^2$, where $x_1$ is a positive integer. Find the least $x_1$ such that 2006 divides $x_{2006}$.

Square $ABCD$ has center $O$, $AB=900$, $E$ and $F$ are on $AB$ with $AE<BF$ and $E$ between $A$ and $F$, $m\angle EOF =45^\circ$, and $EF=400$. Given that $BF=p+q\sqrt{r}$, wherer $p,q,$ and $r$ are positive integers and $r$ is not divisible by the square of any prime, find $p+q+r$.

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.

Given a quadratic trinomial $f\left(x\right)=x^2+ax+b$. Assume that the equation $f\left(f\left(x\right)\right)=0$ has four different real solutions, and that the sum of two of these solutions is $-1$. Prove that $b\leq -\frac14$.

Let $x_1<x_2<x_3$ be three real roots of equation $\sqrt{2014}x^3-4029x^2+2=0$. Find $x_2(x_1+x_3)$.

Determine for which $ n$ positive integer the equation: $ a \plus{} b \plus{} c \plus{} d \equal{} n \sqrt {abcd}$ has positive integer solutions.

Let $p$ be a prime number and $f\in \mathbb{Z}[X]$ given by \[ f(x) = a_{p-1}x^{p-2} + a_{p-2}x^{p-3} + \cdots + a_2x+ a_1 , \] where $a_i = \left( \tfrac ip\right)$ is the Legendre symbol of $i$ with respect to $p$ (i.e. $a_i=1$ if $ i^{\frac {p-1}2} \equiv 1 \pmod p$ and $a_i=-1$ otherwise, for all $i=1,2,\ldots,p-1$). a) Prove that $f(x)$ is divisible with $(x-1)$, but not with $(x-1)^2$ iff $p \equiv 3 \pmod 4$; b) Prove that if $p\equiv 5 \pmod 8$ then $f(x)$ is divisible with $(x-1)^2$ but not with $(x-1)^3$. [i]Sugested by Calin Popescu.[/i]

Let $q$ be an odd prime number. Prove that it is impossible for all $(q-1)$ numbers \[1^2+1+q, 2^2+2+q, \dots, (q-1)^2+(q-1)+q\] to be products of two primes (not necessarily distinct).

Define $\displaystyle{f(x) = x + \sqrt{x + \sqrt{x + \sqrt{x + \sqrt{x + \ldots}}}}}$. Find the smallest integer $x$ such that $f(x)\ge50\sqrt{x}$. (Edit: The official question asked for the "smallest integer"; the intended question was the "smallest positive integer".)

The polynomial $P$ is a quadratic with integer coefficients. For every positive integer $n$, the integers $P(n)$ and $P(P(n))$ are relatively prime to $n$. If $P(3) = 89$, what is the value of $P(10)$?

For any non-negative integer $n$, we say that a permutation $(a_0,a_1,...,a_n)$ of $\{0,1,..., n\} $ is quadratic if $k + a_k$ is a square for $k = 0, 1,...,n$. Show that for any non-negative integer $n$, there exists a quadratic permutation of $\{0,1,..., n\}$.

Find all primes $p$ such that $p^2-p+1$ is a perfect cube.

Define the sequence of integers $\langle a_n\rangle$ as; \[a_0=1, \quad a_1=-1, \quad \text{ and } \quad a_n=6a_{n-1}+5a_{n-2} \quad \forall n\geq 2.\] Prove that $a_{2012}-2010$ is divisible by $2011.$

The edges of a regular tetrahedron with vertices $A ,~ B,~ C$, and $D$ each have length one. Find the least possible distance between a pair of points $P$ and $Q$, where $P$ is on edge $AB$ and $Q$ is on edge $CD$. $\textbf{(A) }\frac{1}{2}\qquad\textbf{(B) }\frac{3}{4}\qquad\textbf{(C) }\frac{\sqrt{2}}{2}\qquad\textbf{(D) }\frac{\sqrt{3}}{2}\qquad\textbf{(E) }\frac{\sqrt{3}}{3}$ [asy] size(150); import patterns; pair D=(0,0),C=(1,-1),B=(2.5,-0.2),A=(1,2),AA,BB,CC,DD,P,Q,aux; add("hatch",hatch()); //AA=new A and etc. draw(rotate(100,D)*(A--B--C--D--cycle)); AA=rotate(100,D)*A; BB=rotate(100,D)*D; CC=rotate(100,D)*C; DD=rotate(100,D)*B; aux=midpoint(AA--BB); draw(BB--DD); P=midpoint(AA--aux); aux=midpoint(CC--DD); Q=midpoint(CC--aux); draw(AA--CC,dashed); dot(P); dot(Q); fill(DD--BB--CC--cycle,pattern("hatch")); label("$A$",AA,W); label("$B$",BB,S); label("$C$",CC,E); label("$D$",DD,N); label("$P$",P,S); label("$Q$",Q,E); //Credit to TheMaskedMagician for the diagram [/asy]

A quadratic polynomial $p(x)$ with integer coefficients satisfies $p(41) = 42$. For some integers $a, b > 41$, $p(a) = 13$ and $p(b) = 73$. Compute the value of $p(1)$. [i]Proposed by Aaron Lin[/i]

Suppose that $m$ and $n$ are integers, such that both the quadratic equations $x^2+mx-n=0$ and $x^2-mx+n=0$ have integer roots. Prove that $n$ is divisible by $6$.

For how many rational numbers $p$ is the area of the triangle formed by the intercepts and vertex of $f(x) = -x^2+4px-p+1$ an integer?

Do there exist quadratic polynomials $P(x)$ and $Q(x)$ with real coeffcients such that the polynomial $P(Q(x))$ has precisely the zeros $x = 2, x = 3, x =5$ and $x = 7$?

Equation $(1-\text{i})x^2+(\lambda+\text{i})x+(1+\text{i}\lambda)=0(\lambda\in\mathbb{R})$ has two imaginary roots, then the range value of $\lambda$ is________.