\def\linefeed{\vglue 0.25 truein}
\def\sskip{\vglue 0.1 truein}
\def\mskip{\vglue 0.15 truein}
\def\ni{\noindent}
\documentstyle[fullpage,amssymbols,12pt]{article}
\setlength{\parindent}{0 in}
\pagestyle{empty}
\begin{document}
{\centerline {\bf THE 1992 ASIAN PACIFIC MATHEMATICAL OLYMPIAD}}
\linefeed
{\it Time allowed: 4 hours}

{\it NO calculators are to be used.}

{\it Each question is worth seven points.}
\linefeed
{\bf Question 1}
\sskip
A triangle with sides $a$, $b$, and $c$ is given.  Denote by $s$ the
semiperimeter, that is $s = (a + b + c)/2$.  Construct a triangle with sides $s
- a$, $s - b$, and $s - c$.  This process is repeated until a triangle can no
longer be constructed with the side lengths given.

For which original triangles can this process be repeated indefinitely?
\mskip
{\bf Question 2}
\sskip
In a circle $C$ with centre $O$ and radius $r$, let $C_1$, $C_2$ be two circles
with centres $O_1$, $O_2$ and radii $r_1$, $r_2$ respectively, so that each
circle $C_i$ is internally tangent to $C$ at $A_i$ and so that $C_1$, $C_2$ are
externally tangent to each other at $A$.

Prove that the three lines $OA$, $O_1 A_2$, and $O_2 A_1$ are concurrent.
\mskip
{\bf Question 3}
\sskip
Let $n$ be an integer such that $n > 3$.  Suppose that we choose three numbers
from the set $\{1, 2, \ldots, n\}$.  Using each of these three numbers only
once and using addition, multiplication, and parenthesis, let us form all
possible combinations.
\sskip
(a) Show that if we choose all three numbers greater than $n/2$, then the
values of these combinations are all distinct.
\sskip
(b) Let $p$ be a prime number such that $p \leq \sqrt{n}$.  Show that the
number of ways of choosing three numbers so that the smallest one is $p$ and
the values of the combinations are not all distinct is precisely the number of
positive divisors of $p - 1$.
\mskip
{\bf Question 4}
\sskip
Determine all pairs $(h,s)$ of positive integers with the following property:
\mskip
If one draws $h$ horizontal lines and another $s$ lines which satisfy
\sskip
(i) they are not horizontal,
\sskip
(ii) no two of them are parallel,
\sskip
(iii) no three of the $h + s$ lines are concurrent,
\sskip
then the number of regions formed by these $h + s$ lines is 1992.
\mskip
{\bf Question 5}
\sskip
Find a sequence of maximal length consisting of non-zero integers in which the
sum of any seven consecutive terms is positive and that of any eleven
consecutive terms is negative.
\end{document}
