Let $S = x + y +z$ where $x, y, z$ are three nonzero real numbers satisfying the following system of inequalities: $$xyz > 1$$ $$x + y + z >\frac{1}{x}+\frac{1}{y}+\frac{1}{z}$$ Prove that $S$ can take on any real values when $x, y, z$ vary

Every positive integer is either [i]nice [/i] or [i]naughty[/i], and the Oracle of Numbers knows which are which. However, the Oracle will not directly tell you whether a number is [i]nice [/i] or [i]naughty[/i]. The only questions the Oracle will answer are questions of the form “What is the sum of all nice divisors of $n$?,” where $n$ is a number of the questioner’s choice. For instance, suppose ([i]just [/i] for this example) that $2$ and $3$ are nice, while $1$ and $6$ are [i]naughty[/i]. In that case, if you asked the Oracle, “What is the sum of all nice divisors of $6$?,” the Oracle’s answer would be $5$. Show that for any given positive integer $n$ less than $1$ million, you can determine whether $n$ is [i]nice [/i] or [i]naughty [/i] by asking the Oracle at most four questions.

There are three polygons and the area of each one is $3$. They are drawn inside a square of area $6$. Find the greatest value of $m$ such that among those three polygons, we can always find two polygons so that the area of their overlap is not less than $m$.

Each of the $39$ students in the eighth grade at Lincoln Middle School has one dog or one cat or both a dog and a cat. Twenty students have a dog and $26$ students have a cat. How many students have both a dog and a cat? $\textbf{(A)}\ 7\qquad \textbf{(B)}\ 13\qquad \textbf{(C)}\ 19\qquad \textbf{(D)}\ 39\qquad \textbf{(E)}\ 46$

Let $a,b,c$ be positive real numbers. Prove that $\sqrt{\frac{a}{b+c}+\frac{b}{c+a}}+\sqrt{\frac{b}{c+a}+\frac{c}{a+b}}+\sqrt{\frac{c}{a+b}+\frac{a}{b+c}}\ge 3$

$n>1$ is an integer. The first $n$ primes are $p_1=2,p_2=3,\dotsc, p_n$. Set $A=p_1^{p_1}p_2^{p_2}...p_n^{p_n}$. Find all positive integers $x$, such that $\dfrac Ax$ is even, and $\dfrac Ax$ has exactly $x$ divisors

If $F(n+1)=\frac{2F(n)+1}{2}$ for $n=1,2,\ldots$, and $F(1)=2$, then $F(101)$ equals: $\text{(A)} \ 49 \qquad \text{(B)} \ 50 \qquad \text{(C)} \ 51 \qquad \text{(D)} \ 52 \qquad \text{(E)} \ 53$

Find all reals $a$ such that the sequence $\{x(n)\}$, $n=0,1,2, \ldots$ that satisfy: $x(0)=1996$ and $x_{n+1} = \frac{a}{1+x(n)^2}$ for any natural number $n$ has a limit as n goes to infinity.

Inside a square of side $16$ are placed $1000$ points. Show that it is possible to put a equilateral triangle of side $2\sqrt3$ in the plane so that it covers at least $16$ of these points.

a) Points $B$ and $C$ are inside the segment $[AD]$. $|AB|=|CD|$. Prove that for all of the points P on the plane holds inequality $$|PA|+|PD|>|PB|+|PC|$$ b) Given four points $A,B,C,D$ on the plane. For all of the points $P$ on the plane holds inequality $$|PA|+|PD| > |PB|+|PC|.$$ Prove that points $B$ and C are inside the segment $[AD]$ and$ |AB|=|CD|$.

Let $G = (S, T; E)$ be a finite bipartite graph with a perfect matching. Prove that there exists an injective edge weighting $w: E \to \mathbb{R}$ satisfying the following: 1. If $e_s$ is the edge with the smallest weight among the edges incident to $s$ for all $s \in S$, then $\{ e_s \mid s \in S \}$ forms a perfect matching in $G$. 2. If $e_t$ is the edge with the largest weight among the edges incident to $t$ for all $t \in T$, then $\{ e_t \mid t \in T \}$ forms a perfect matching in $G$.

Show that if $m$ and $n$ are relatively prime positive integers, then $\phi( 5^m -1) \neq 5^{n}-1$.

Let $f : \mathbb Q \to \mathbb Q$ be a function such that for any $x,y \in \mathbb Q$, the number $f(x+y)-f(x)-f(y)$ is an integer. Decide whether it follows that there exists a constant $c$ such that $f(x) - cx$ is an integer for every rational number $x$. [i]Proposed by Victor Wang[/i]

We have 11 boxes. On a move, we can choose 10 of them and put one ball in each of the boxes chosen. Two players move alternately. The one who gets a box of 21 balls wins. Which of the two players has winning strategy?

Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all $m,n\in\mathbb{N}$, \[(2^m+1)f(n)f(2^mn)=2^mf(n)^2+f(2^mn)^2+(2^m-1)^2n. \]

Find the number of ways to distribute $11$ balls into $5$ boxes with different sizes, so that each box receives at least one ball, and the total number of balls in the largest and smallest boxes is more than the total number of balls in the remaining boxes.