There are 2000 cities in Graphland; some of them are connected by roads. For every city the number of roads going from it is counted. It is known that there are exactly two equal numbers among all the numbers obtained. What can be these numbers?

A ray of light originates from point $A$ and and travels in a plane, being reflected $n$ times between lines $AD$ and $CD$, before striking a point $B$ (which may be on $AD$ or $CD$) perpendicularly and retracing its path to $A$. (At each point of reflection the light makes two equal angles as indicated in the adjoining figure. The figure shows the light path for $n = 3.$) If $\measuredangle CDA = 8^\circ$, what is the largest value $n$ can have? $\text{(A)} \ 6 \qquad \text{(B)} \ 10 \qquad \text{(C)} \ 38 \qquad \text{(D)} \ 98 \qquad \text{(E)} \ \text{There is no largest value.}$

Consider $\triangle OAB$ with acute angle $AOB$. Thorugh a point $M \neq O$ perpendiculars are drawn to $OA$ and $OB$, the feet of which are $P$ and $Q$ respectively. The point of intersection of the altitudes of $\triangle OPQ$ is $H$. What is the locus of $H$ if $M$ is permitted to range over a) the side $AB$; b) the interior of $\triangle OAB$.

Prove that the largest area of a triangle with sides $a, b, c$ satisfying the relation $a^2 +b^2 c^2 = 3m^2$, equals to $\frac{\sqrt3}{4}m^2$.

Positive integers $x>1$ and $y$ satisfy an equation $2x^2-1=y^{15}$. Prove that 5 divides $x$.

Let $f:\mathbb{R}\to\mathbb{R}$ be a convex function. a) Prove that $f$ is continous; b) Prove that there exists an unique function $g:[0,\infty)\to\mathbb{R}$ such that for all $x\geq 0$ we have \[ f(x+g(x)) = f(g(x)) - g(x) . \]

In the acute-angled non-isosceles triangle $ABC$, $O$ is its circumcenter, $H$ is its orthocenter and $AB>AC$. Let $Q$ be a point on $AC$ such that the extension of $HQ$ meets the extension of $BC$ at the point $P$. Suppose $BD=DP$, where $D$ is the foot of the perpendicular from $A$ onto $BC$. Prove that $\angle ODQ=90^{\circ}$.

Find all positive integer solutions of equation $n^3 - 2 = k! .$

$\frac{(3!)!}{3!} =$ $\text{(A)}\ 1 \qquad \text{(B)}\ 2 \qquad \text{(C)}\ 6\qquad \text{(D)}\ 40\qquad \text{(E)}\ 120$

Joe and Penny play a game. Initially there are $5000$ stones in a pile, and the two players remove stones from the pile by making a sequence of moves. On the $k$-th move, any number of stones between $1$ and $k$ inclusive may be removed. Joe makes the odd-numbered moves and Penny makes the even-numbered moves. The player who removes the very last stone is the winner. Who wins if both players play perfectly?

Initially, Aslı distributes $1000$ balls to $30$ boxes as she wishes. After that, Aslı and Zehra make alternated moves which consists of taking a ball in any wanted box starting with Aslı. One who takes the last ball from any box takes that box to herself. What is the maximum number of boxes can Aslı guarantee to take herself regardless of Zehra's moves?

$10$ cities are connected by one-way air routes in a way so that each city can be reached from any other by several connected flights. Let $n$ be the smallest number of flights needed for a tourist to visit every city and return to the starting city. Clearly $n$ depends on the flight schedule. Find the largest $n$ and the corresponding flight schedule.

Do there exist positive integers $a \ne b$ such that $ a+b$ is a perfect square and $a^3 +b^3$ is a fourth power of an integer?

$f(x)=\frac{4^x}{4^x+2}$, then $f(\frac{1}{1001})+f(\frac{2}{1001})+\cdots+f(\frac{1000}{1001})=$________.

Given a rectangular parallelepiped $ABCDA'B'C'D'$ with the bases $ABCD, A'B'C'D'$, the edges $AA',BB', CC',DD'$ and $AB = a,AD = b,AA' = c$. Show that there exists a triangle with the sides equal to the distances from $A,A',D$ to the diagonal $BD'$ of the parallelepiped. Denote those distances by $m_1,m_2,m_3$. Find the relationship between $a, b, c,m_1,m_2,m_3$.

If $k$ and $n$ are positive integers, prove the inequality $$\frac{1}{kn} +\frac{1}{kn+1} +...+\frac{1}{(k+1)n-1} \ge n \left(\sqrt[n]{\frac{k+1}{k}}-1\right)$$

Let $q_{0},q_{1},...$ be a sequence of integers such that a) for any $m>n$ we have $m-n\mid q_{m}-q_{n}$, and b) $|q_{n}|\leq n^{10}, \ \forall n\geq 0$. Prove there exists a polynomial $Q$ such that $q_{n}=Q(n), \ \forall n\geq 0$.

Given rational numbers $a_1,...,a_n$ such that $\sum_{i=1}^n \{ka_i\}<\frac{n}{2}$ for any positive integer $k$. a) Prove that at least one of $a_1,...,a_n$ is integer. b) Is the previous statement true, if the number $\frac{n}{2}$ is replaced by the greater number? (Here $\{x\}$ means a fractional part of $x$.) (N. Selinger)

A large cube is formed by stacking $27$ unit cubes. A plane is perpendicular to one of the internal diagonals of the large cube and bisects that diagonal. The number of unit cubes that the plane intersects is [asy] size(120); defaultpen(linewidth(0.7)); pair slant = (2,1); for(int i = 0; i < 4; ++i) draw((0,i)--(3,i)^^(i,0)--(i,3)^^(3,i)--(3,i)+slant^^(i,3)--(i,3)+slant); for(int i = 1; i < 4; ++i) draw((0,3)+slant*i/3--(3,3)+slant*i/3^^(3,0)+slant*i/3--(3,3)+slant*i/3);[/asy] $\textbf{(A)}\ 16\qquad \textbf{(B)}\ 17 \qquad \textbf{(C)}\ 18 \qquad \textbf{(D)}\ 19 \qquad \textbf{(E)}\ 20$

The remainder of $1991^{2000}$ module $10^6$ is________.

Fix an integer $k>2$. Two players, called Ana and Banana, play the following game of numbers. Initially, some integer $n \ge k$ gets written on the blackboard. Then they take moves in turn, with Ana beginning. A player making a move erases the number $m$ just written on the blackboard and replaces it by some number $m'$ with $k \le m' < m$ that is coprime to $m$. The first player who cannot move anymore loses. An integer $n \ge k $ is called good if Banana has a winning strategy when the initial number is $n$, and bad otherwise. Consider two integers $n,n' \ge k$ with the property that each prime number $p \le k$ divides $n$ if and only if it divides $n'$. Prove that either both $n$ and $n'$ are good or both are bad.

Let $n$ be a positive integer, and set $S$ be the set of all integers in $\{1,2,\dots,n\}$ which are relatively prime to $n$. Set $S_1 = S \cap \left(0, \frac n3 \right]$, $S_2 = S \cap \left( \frac n3, \frac {2n}3 \right]$, $S_3 = S \cap \left( \frac{2n}{3}, n \right]$. If the cardinality of $S$ is a multiple of $3$, prove that $S_1$, $S_2$, $S_3$ have the same cardinality.

Jerry and Hannah Kubik live in Jupiter Falls with their five children. Jerry works as a Renewable Energy Engineer for the Southern Company, and Hannah runs a lab at Jupiter Falls University where she researches biomass (renewable fuel) conversion rates. Michael is their oldest child, and Wendy their oldest daughter. Tony is the youngest child. Twins Joshua and Alexis are $12$ years old. When the Kubiks went on vacation to San Diego last year, they spent a day at the San Diego Zoo. Single day passes cost $\$33$ for adults (Jerry and Hannah), $\$22$ for children (Michael is still young enough to get the children's rate), and family memberships (which allow the whole family in at once) cost $\$120$. How many dollars did the family save by buying a family pass over buying single day passes for every member of the family?

Let $S$ be an infinite set of positive integers, such that there exist four pairwise distinct $a,b,c,d \in S$ with $\gcd(a,b) \neq \gcd(c,d)$. Prove that there exist three pairwise distinct $x,y,z \in S$ such that $\gcd(x,y)=\gcd(y,z) \neq \gcd(z,x)$.

Let $ABCD$ be a convex, non-cyclic quadrilateral with $E$ the intersection of its diagonals. Given $\angle ABD+\angle DAC = \angle CBD+\angle DCA$, $AB = 10$, $BC = 15$, $AE = 7$, and $EC = 13$, find $BD$.