2
27 th United States of America Mathematical Olympiad Part I 9 a.m. -12 noon April 28, 1998 1. Suppose that the set {1, 2, ··· , 1998} has been partitioned into disjoint pairs {a i ,b i } (1 i 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 | + ··· + |a 999 - b 999 | ends in the digit 9. 2. Let C 1 and C 2 be concentric circles, with C 2 in the interior of C 1 . From a point A on C 1 one draws the tangent AB to C 2 (B ∈C 2 ). Let C be the second point of intersection of AB and C 1 , and let D be the midpoint of AB. A line passing through A intersects 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 . 3. Let a 0 ,a 1 , ··· ,a n be numbers from the interval (0,π/2) such that tan(a 0 - π 4 ) + tan(a 1 - π 4 )+ ··· + tan(a n - π 4 ) n - 1. Prove that tan a 0 tan a 1 ··· tan a n n n+1 . Copyright c Committee on the American Mathematics Competitions, Mathematical Association of America

usamo 1998

  • Upload
    jt3

  • View
    19

  • Download
    1

Embed Size (px)

DESCRIPTION

competition

Citation preview

Page 1: usamo 1998

27th United States of America Mathematical Olympiad

Part I 9 a.m. -12 noon

April 28, 1998

1. Suppose that the set {1, 2, · · · , 1998} has been partitioned into disjoint pairs {ai, bi}(1 ≤ i ≤ 999) so that for all i, |ai − bi| equals 1 or 6. Prove that the sum

|a1 − b1|+ |a2 − b2|+ · · ·+ |a999 − b999|ends in the digit 9.

2. Let C1 and C2 be concentric circles, with C2 in the interior of C1. From a point A on C1

one draws the tangent AB to C2 (B ∈ C2). Let C be the second point of intersectionof AB and C1, and let D be the midpoint of AB. A line passing through A intersectsC2 at E and F in such a way that the perpendicular bisectors of DE and CF intersectat a point M on AB. Find, with proof, the ratio AM/MC.

3. Let a0, a1, · · · , an be numbers from the interval (0, π/2) such that

tan(a0 −π

4) + tan(a1 −

π

4) + · · ·+ tan(an −

π

4) ≥ n− 1.

Prove that

tan a0 tan a1 · · · tan an ≥ nn+1.

Copyright c© Committee on the American Mathematics Competitions,Mathematical Association of America

Page 2: usamo 1998

27th United States of America Mathematical Olympiad

Part II 1 p.m. - 4 p.m.

April 28, 1998

4. A computer screen shows a 98 × 98 chessboard, colored in the usual way. One canselect with a mouse any rectangle with sides on the lines of the chessboard and clickthe mouse button: as a result, the colors in the selected rectangle switch (black becomeswhite, white becomes black). Find, with proof, the minimum number of mouse clicksneeded to make the chessboard all one color.

5. Prove that for each n ≥ 2, there is a set S of n integers such that (a − b)2 divides abfor every distinct a, b ∈ S.

6. Let n ≥ 5 be an integer. Find the largest integer k (as a function of n) such thatthere exists a convex n-gon A1A2 . . . An for which exactly k of the quadrilateralsAiAi+1Ai+2Ai+3 have an inscribed circle. (Here An+j = Aj.)

Copyright c© Committee on the American Mathematics Competitions,Mathematical Association of America