1998 USAMO Problems

Problems of the 1998 USAMO.

Problem 1

Suppose that the set $\{1,2,\cdots, 1998\}$ has been partitioned into disjoint pairs $\{a_i,b_i\}$ ( $1\leq i\leq 999$ ) so that for all $i$ , $|a_i-b_i|$ equals $1$ or $6$ . Prove that the sum $|a_1-b_1|+|a_2-b_2|+\cdots +|a_{999}-b_{999}|$ ends in the digit $9$ .

Solution

Problem 2

Let ${\cal C}_1$ and ${\cal C}_2$ be concentric circles, with ${\cal C}_2$ in the interior of ${\cal C}_1$ . From a point $A$ on ${\cal C}_1$ one draws the tangent $AB$ to ${\cal C}_2$ ( $B\in {\cal C}_2$ ). Let $C$ be the second point of intersection of $AB$ and ${\cal C}_1$ , and let $D$ be the midpoint of $AB$ . A line passing through $A$ intersects ${\cal C}_2$ at $E$ and $F$ in such a way that the perpendicular bisectors of $DE$ and $CF$ intersect at a point $M$ on $AB$ . Find, with proof, the ratio $AM/MC$ .

Solution

Problem 3

Let $a_0,a_1,\cdots ,a_n$ be numbers from the interval $(0,\pi/2)$ such that $\tan (a_0-\frac{\pi}{4})+ \tan (a_1-\frac{\pi}{4})+\cdots +\tan (a_n-\frac{\pi}{4})\geq n-1.$ Prove that $\tan a_0\tan a_1 \cdots \tan a_n\geq n^{n+1}.$ Solution

Problem 4

A computer screen shows a $98 \times 98$ chessboard, colored in the usual way. One can select with a mouse any rectangle with sides on the lines of the chessboard and click the mouse button: as a result, the colors in the selected rectangle switch (black becomes white, white becomes black). Find, with proof, the minimum number of mouse clicks needed to make the chessboard all one color.

Solution

Problem 5

Prove that for each $n\geq 2$ , there is a set $S$ of $n$ integers such that $(a-b)^2$ divides $ab$ for every distinct $a,b\in S$ .

Solution

Problem 6

Let $n \geq 5$ be an integer. Find the largest integer $k$ (as a function of $n$ ) such that there exists a convex $n$ -gon $A_{1}A_{2}\dots A_{n}$ for which exactly $k$ of the quadrilaterals $A_{i}A_{i+1}A_{i+2}A_{i+3}$ have an inscribed circle. (Here $A_{n+j} = A_{j}$ .)

Solution

Resources

1998 USAMO (Problems • Resources)
Preceded by 1997 USAMO	Followed by 1999 USAMO
1 • 2 • 3 • 4 • 5
All USAMO Problems and Solutions

1994 USAMO Problems on the resources page

Page

Toolbox

Search

1998 USAMO Problems

Contents

Problem 1

Problem 2

Problem 3

Problem 4

Problem 5

Problem 6

Resources