GeometryDifficulty 5.8AIME, harderProve itUnited States
Problem:
For each positive integer n, there is a circle around the origin with radius n. Rainbow Dash starts off somewhere on the plane, but not on a circle. She takes off in some direction in a straight path. She moves 55 units before crossing a circle, then 5 units, then 535 units. What distance will she travel before she crosses another circle?
Solution
Solution:
Answer: 52170−95 Note that the distance from Rainbow Dash's starting point to the first place in which she hits a circle is irrelevant, except in checking that this distance is small enough that she does not hit another circle beforehand. It will be clear at the end that our configuration does not allow this (by the Triangle Inequality). Let O be the origin, and let Rainbow Dash's first three meeting points be A,B,C so that AB=5 and BC=535.
Consider the lengths of OA,OB,OC. First, note that if OA=OC=n (i.e. A and C lie on the same circle), then we need OB=n−1, but since she only crosses the circle containing B once, it follows that the circle passing through B is tangent to AC, which is impossible since AB=AC. If OA=OB=n, note that OC=n+1. Dropping a perpendicular from O to AB, we see that by the Pythagorean Theorem, n2−45=(n+1)2−20121 from which we get that n is not an integer. Similarly, when OB=OC=n, we have OA=n+1, and n is not an integer.
Therefore, either OA=n+2,OB=n+1,OC=n or OA=n,OB=n+1,OC=n+2. In the first case, by Stewart's Theorem, 5245+(n+1)2⋅585=n2⋅5+(n+2)2⋅535. This gives a negative value of n, so the configuration is impossible. In the final case, we have, again by Stewart's Theorem, 5245+(n+1)2⋅585=(n+2)2⋅5+n2⋅535 Solving gives n=3, so OA=3,OB=4,OC=5.
Next, we compute, by the Law of Cosines, cos∠OAB=−351, so that sin∠OAB=35211. Let the projection from O to line AC be P; we get that OP=5211. Rainbow Dash will next hit the circle of radius 6 at D. Our answer is now CD=PD−PC=52170−595 by the Pythagorean Theorem.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.