- Day 1
- Difficulty band 6
Let be the nth prime. Let 0 < a < 1 be a real. Define the sequence by = a, = the fractional part of if ≠ 0, or 0 if = 0. Find all a for which the sequence is eventually zero.
United States of America Mathematical Olympiad 1997.
Let be the nth prime. Let 0 < a < 1 be a real. Define the sequence by = a, = the fractional part of if ≠ 0, or 0 if = 0. Find all a for which the sequence is eventually zero.
Let be a triangle. Take points , , on the perpendicular bisectors of , , respectively. Show that the lines through , , perpendicular to , , respectively are concurrent.
Prove that for any integer , there exists a unique polynomial with coefficients in such that .
To clip a convex -gon means to choose a pair of consecutive sides and to replace them by the three segments , and , where is the midpoint of and is the midpoint of . In other words, one cuts off the triangle to obtain a convex -gon. A regular hexagon of area 1 is clipped to obtain a heptagon . Then is clipped (in one of the seven possible ways) to obtain an octagon , and so on. Prove that no matter how the clippings are done, the area of is greater than , for all .
Prove that, for all positive real numbers , , , the inequality holds.
Suppose the sequence of nonnegative integers satisfies for all with . Show that there exists a real number such that (the greatest integer ) for all .