olymmath

USAMO 1997

United States of America Mathematical Olympiad 1997.

Day 1

Problem 1

Let pnp_n be the nth prime. Let 0 < a < 1 be a real. Define the sequence xnx_n by x0x_0 = a, xnx_n = the fractional part of pn/xn−1p_n/x_{n-1} if xnx_n ≠ 0, or 0 if xn−1x_{n-1} = 0. Find all a for which the sequence is eventually zero.

Answer, solutions and source

Day 2

Problem 4

To clip a convex nn -gon means to choose a pair of consecutive sides AB,BCAB, BC and to replace them by the three segments AM,MNAM, MN , and NCNC , where MM is the midpoint of ABAB and NN is the midpoint of BCBC . In other words, one cuts off the triangle MBNMBN to obtain a convex (n+1)(n+1) -gon. A regular hexagon P6{\cal P}_6 of area 1 is clipped to obtain a heptagon P7{\cal P}_7 . Then P7{\cal P}_7 is clipped (in one of the seven possible ways) to obtain an octagon P8{\cal P}_8 , and so on. Prove that no matter how the clippings are done, the area of Pn{\cal P}_n is greater than 13\frac 13 , for all n≥6n \geq 6 .

Answer, solutions and source

Problem 5

Prove that, for all positive real numbers aa , bb , cc , the inequality 1a3+b3+abc+1b3+c3+abc+1c3+a3+abc≤1abc\frac {1}{a^3 + b^3 + abc} + \frac {1}{b^3 + c^3 + abc} + \frac {1}{c^3 + a^3 + abc} \leq \frac {1}{abc} holds.

Answer, solutions and source

Problem 6

Suppose the sequence of nonnegative integers a1,a2,…,a1997a_1, a_2, \ldots, a_{1997} satisfies ai+aj≤ai+j≤ai+aj+1a_i + a_j \leq a_{i+j} \leq a_i + a_j + 1 for all i,j≥1i,j \geq 1 with i+j≤1997i + j \leq 1997 . Show that there exists a real number xx such that an=⌊nx⌋a_n = \lfloor nx \rfloor (the greatest integer ≤nx\leq nx ) for all 1≤n≤19971 \leq n \leq 1997 .

Answer, solutions and source