Scribd
Upload
520 views2 pages

Usamo 1997

The document is a test for the 26th United States of America Mathematical Olympiad containing 6 math problems. It provides context that the test is split into two parts, with the first part occurring from 9am to 12pm containing 3 problems, and the second part occurring from 1pm to 4pm containing 3 additional problems. It also provides basic information about the structure of the problems and constraints to consider when solving them.

Uploaded by

JT3
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
520 views2 pages

Usamo 1997

The document is a test for the 26th United States of America Mathematical Olympiad containing 6 math problems. It provides context that the test is split into two parts, with the first part occurring from 9am to 12pm containing 3 problems, and the second part occurring from 1pm to 4pm containing 3 additional problems. It also provides basic information about the structure of the problems and constraints to consider when solving them.

Uploaded by

JT3
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

26th United States of America Mathematical Olympiad

Part I

9 a.m. - 12 noon
May 1, 1997

1. Let p1 , p2 , p3 , . . . be the prime numbers listed in increasing order, and let x0 be


a real number between 0 and 1. For positive integer k, define

if xk1 = 0,

0


xk =
pk

if xk1 6= 0,
xk1
where {x} denotes the fractional part of x. (The fractional part of x is given
by x bxc where bxc is the greatest integer less than or equal to x.) Find,
with proof, all x0 satisfying 0 < x0 < 1 for which the sequence x0 , x1 , x2 , . . .
eventually becomes 0.
2. Let ABC be a triangle, and draw isosceles triangles BCD, CAE, ABF externally to ABC, with BC, CA, AB as their respective bases. Prove that the

lines through A, B, C perpendicular to the lines EF , F D, DE, respectively, are
concurrent.
3. Prove that for any integer n, there exists a unique polynomial Q with coefficients
in {0, 1, . . . , 9} such that Q(2) = Q(5) = n.

c Committee on the American Mathematics Competitions,


Copyright
Mathematical Association of America

26th United States of America Mathematical Olympiad


Part II

1 p.m. - 4 p.m.
May 1, 1997

4. To clip a convex n-gon means to choose a pair of consecutive sides AB, BC


and to replace them by the three segments AM, M N , and N C, where M is the
midpoint of AB and N is the midpoint of BC. In other words, one cuts off the
triangle M BN to obtain a convex (n + 1)-gon. A regular hexagon P6 of area
1 is clipped to obtain a heptagon P7 . Then P7 is clipped (in one of the seven
possible ways) to obtain an octagon P8 , and so on. Prove that no matter how
the clippings are done, the area of Pn is greater than 1/3, for all n 6.
5. Prove that, for all positive real numbers a, b, c,
(a3 + b3 + abc)1 + (b3 + c3 + abc)1 + (c3 + a3 + abc)1 (abc)1 .
6. Suppose the sequence of nonnegative integers a1 , a2 , . . . , a1997 satisfies
ai + aj ai+j ai + aj + 1
for all i, j 1 with i + j 1997. Show that there exists a real number x such
that an = bnxc (the greatest integer nx) for all 1 n 1997.

c Committee on the American Mathematics Competitions,


Copyright
Mathematical Association of America

You might also like