Let $0 < u < 1$ and define \[u_1 = 1 + u, \quad u_2 = \frac{1}{u_1} + u, \quad \dots, \quad u_{n + 1} = \frac{1}{u_n} + u, \quad n \ge 1.\] Show that $u_n > 1$ for all values of $n = 1$, 2, 3, $\dots$.

For all positive real numbers $x$ and $y$ let \[f(x,y)=\min\left( x,\frac{y}{x^2+y^2}\right) \] Show that there exist $x_0$ and $y_0$ such that $f(x, y)\le f(x_0, y_0)$ for all positive $x$ and $y$, and find $f(x_0,y_0)$.

Quadratic polynomials $P(x)$ and $Q(x)$ have leading coefficients of $2$ and $-2$, respectively. The graphs of both polynomials pass through the two points $(16,54)$ and $(20,53)$. Find ${P(0) + Q(0)}$.

Let $d$ be any positive integer not equal to $2, 5$ or $13$. Show that one can find distinct $a,b$ in the set $\{2,5,13,d\}$ such that $ab-1$ is not a perfect square.

Find all quadruples of real numbers $(a,b,c,d)$ such that the equalities \[X^2 + a X + b = (X-a)(X-c) \text{ and } X^2 + c X + d = (X-b)(X-d)\] hold for all real numbers $X$. [i]Morteza Saghafian, Iran[/i]

Find $\displaystyle n \in \mathbb N$, $\displaystyle n \geq 2$, and the digits $\displaystyle a_1,a_2,\ldots,a_n$ such that \[ \displaystyle \sqrt{\overline{a_1 a_2 \ldots a_n}} - \sqrt{\overline{a_1 a_2 \ldots a_{n-1}}} = a_n . \]

If $ r$ and $ s$ are the roots of the equation $ ax^2 \plus{} bx \plus{} c \equal{} 0$, the value of $ \frac {1}{r^2} \plus{} \frac {1}{s^2}$ is: $ \textbf{(A)}\ b^2 \minus{} 4ac \qquad\textbf{(B)}\ \frac {b^2 \minus{} 4ac}{2a} \qquad\textbf{(C)}\ \frac {b^2 \minus{} 4ac}{c^2} \qquad\textbf{(D)}\ \frac {b^2 \minus{} 2ac}{c^2}$ $ \textbf{(E)}\ \text{none of these}$

Find the smallest real number $A$ such that, for every quadratic polynomial $f(x)$ satisfying $ | f(x)| \le 1$ for $0 \le x \le 1$, it holds that $f' (0) \le A$.

Let $ P(x) \equal{} x^3 \plus{} mx \plus{} n$ be an integer polynomial satisfying that if $ P(x) \minus{} P(y)$ is divisible by 107, then $ x \minus{} y$ is divisible by 107 as well, where $ x$ and $ y$ are integers. Prove that 107 divides $ m$.

When rolling a certain unfair six-sided die with faces numbered $1, 2, 3, 4, 5$, and $6$, the probability of obtaining face $F$ is greater than $\frac{1}{6}$, the probability of obtaining the face opposite is less than $\frac{1}{6}$, the probability of obtaining any one of the other four faces is $\frac{1}{6}$, and the sum of the numbers on opposite faces is $7$. When two such dice are rolled, the probability of obtaining a sum of $7$ is $\frac{47}{288}$. Given that the probability of obtaining face $F$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers, find $m+n$.

$(CZS 3)$ Let $a$ and $b$ be two positive real numbers. If $x$ is a real solution of the equation $x^2 + px + q = 0$ with real coefficients $p$ and $q$ such that $|p| \le a, |q| \le b,$ prove that $|x| \le \frac{1}{2}(a +\sqrt{a^2 + 4b})$ Conversely, if $x$ satisfies the above inequality, prove that there exist real numbers $p$ and $q$ with $|p|\le a, |q|\le b$ such that $x$ is one of the roots of the equation $x^2+px+ q = 0.$

a) Show that you can divide an angle $\theta$ to three equal parts using compass and ruler if and only if the polynomial $4t^3-3t-\cos (\theta)$ is reducible over $\mathbb{Q}(\cos (\theta))$. b) Is it always possible to divide an angle into five equal parts?

On a board, there are $n$ equations in the form $*x^2+*x+*$. Two people play a game where they take turns. During a turn, you are aloud to change a star into a number not equal to zero. After $3n$ moves, there will be $n$ quadratic equations. The first player is trying to make more of the equations not have real roots, while the second player is trying to do the opposite. What is the maximum number of equations that the first player can create without real roots no matter how the second player acts?

Let $n\geq 0$ be an integer and let $p \equiv 7 \pmod 8$ be a prime number. Prove that \[ \sum^{p-1}_{k=1} \left \{ \frac {k^{2^n}}p - \frac 12 \right\} = \frac {p-1}2 . \] [i]Călin Popescu[/i]

Given that $(1+\sin t)(1+\cos t)=5/4$ and \[ (1-\sin t)(1-\cos t)=\frac mn-\sqrt{k}, \] where $k, m,$ and $n$ are positive integers with $m$ and $n$ relatively prime, find $k+m+n.$

Circles $C_1$ and $C_2$ are externally tangent, and they are both internally tangent to circle $C_3$. The radii of $C_1$ and $C_2$ are $4$ and $10$, respectively, and the centers of the three circles are all collinear. A chord of $C_3$ is also a common external tangent of $C_1$ and $C_2$. Given that the length of the chord is $\frac{m\sqrt{n}}{p}$ where $m,n,$ and $p$ are positive integers, $m$ and $p$ are relatively prime, and $n$ is not divisible by the square of any prime, find $m+n+p$.

Let $x_i,$ $1 \leq i \leq n$ be real numbers with $n \geq 3.$ Let $p$ and $q$ be their symmetric sum of degree $1$ and $2$ respectively. Prove that: i) $p^2 \cdot \frac{n-1}{n}-2q \geq 0$ ii) $\left|x_i - \frac{p}{n}\right| \leq \sqrt{p^2 - \frac{2nq}{n-1}} \cdot \frac{n-1}{n}$ for every meaningful $i$.

Prove that the equation $3y^2 = x^4 + x$ has no positive integer solutions.

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

For certain ordered pairs $(a,b)$ of real numbers, the system of equations \begin{eqnarray*} && ax+by =1\\ &&x^2+y^2=50\end{eqnarray*} has at least one solution, and each solution is an ordered pair $(x,y)$ of integers. How many such ordered pairs $(a,b)$ are there?

Suppose $x$ is a real number satisfying $x^2-990x+1=(x+1)\sqrt x$. Find $\sqrt x+\tfrac1{\sqrt x}$.

Are there integers $m$ and $n$ such that \[5m^2 - 6mn + 7n^2 = 1985 \ ?\]

Determine the value of the parameter $m$ such that the equation $(m-2)x^2+(m^2-4m+3)x-(6m^2-2)=0$ has real solutions, and the sum of the third powers of these solutions is equal to zero.

Let $\{a_n\}_{n\geq 1}$ be a sequence with $a_1=1$, $a_2=4$ and for all $n>1$, \[ a_{n} = \sqrt{ a_{n-1}a_{n+1} + 1 } . \] a) Prove that all the terms of the sequence are positive integers. b) Prove that $2a_na_{n+1}+1$ is a perfect square for all positive integers $n$. [i]Valentin Vornicu[/i]

A round table has radius $ 4$. Six rectangular place mats are placed on the table. Each place mat has width $ 1$ and length $ x$ as shown. They are positioned so that each mat has two corners on the edge of the table, these two corners being end points of the same side of length $ x$. Further, the mats are positioned so that the inner corners each touch an inner corner of an adjacent mat. What is $ x$? [asy]unitsize(4mm); defaultpen(linewidth(.8)+fontsize(8)); draw(Circle((0,0),4)); path mat=(-2.687,-1.5513)--(-2.687,1.5513)--(-3.687,1.5513)--(-3.687,-1.5513)--cycle; draw(mat); draw(rotate(60)*mat); draw(rotate(120)*mat); draw(rotate(180)*mat); draw(rotate(240)*mat); draw(rotate(300)*mat); label("$x$",(-2.687,0),E); label("$1$",(-3.187,1.5513),S);[/asy]$ \textbf{(A)}\ 2\sqrt {5} \minus{} \sqrt {3} \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ \frac {3\sqrt {7} \minus{} \sqrt {3}}{2} \qquad \textbf{(D)}\ 2\sqrt {3} \qquad \textbf{(E)}\ \frac {5 \plus{} 2\sqrt {3}}{2}$