2012 USAJMO Problems/Problem 4
Let be an irrational number with , and draw a circle in the plane whose circumference has length 1. Given any integer , define a sequence of points , , , as follows. First select any point on the circle, and for define as the point on the circle for which the length of arc is , when travelling counterclockwise around the circle from to . Supose that and are the nearest adjacent points on either side of . Prove that .
Use mathematical induction. For it is true because one point can't be closest to in both ways, and that . Suppose that for some , the nearest adjacent points and on either side of satisfy . Then consider the nearest adjacent points and on either side of . It is by the assumption of the nearness we can see that either , , or one of or equals two . Let's consider the following two cases.
(i) Suppose .
Since the length of the arc is (where equals to subtracted by the greatest integer not exceeding ) and length of the arc is , we now consider a point which is defined by traveling clockwise on the circle such that the length of arc is . We claim that either is on the interior of the arc or on the interior of the arc . Algebraically, it is equivalent to either or . Suppose the former fails, i.e. . Then suppose and , where , are integers and . We now have and Therefore is either closer to than on the side, or closer to than on the side. In other words, is the closest adjacent point of on the side, or the closest adjacent point of on the side. Hence or is , therefore .
(ii) Suppose Then either when and , or when one of or is .
In either case, is true.
--Lightest 20:27, 6 May 2012 (EDT)
|2012 USAJMO (Problems • Resources)|
|1 • 2 • 3 • 4 • 5 • 6|
|All USAJMO Problems and Solutions|