A bug walks all day and sleeps all night. On the first day, it starts at point O, faces east, and walks a distance of 5 units due east. Each night the bug rotates 60∘ counterclockwise. Each day it walks in this new direction half as far as it walked the previous day. The bug gets arbitrarily close to the point P. Then OP2=nm, where m and n are relatively prime positive integers. Find m+n.
解析
Solution 1 (Coordinates)
We notice that the moves cycle every 6 moves, so we plot out the first 6 moves on the coordinate grid with point O as the origin. We will keep a tally of the x-coordinate and y-coordinate separately. Then, we will combine them and account for the cycling using the formula for an infinite geometric series.
First move: The ant moves right 5. Second move: We use properties of a 30−60−90 triangle to get 45 right, 453 up. Third move: 85 left, 853 up. Fourth move: 85 left. Fifth move: 325 left, 3253 down. Sixth move: 645 right, 6453 down.
Total of x-coordinate: 5+45−85−85−325+645=64315. Total of y-coordinate: 0+453+853+0−3253−6453=641053.
After this cycle of six moves, all moves repeat with a factor of (21)6=641. Using the formula for a geometric series, multiplying each sequence by 1−6411=6364 will give us the point P.
Now, knowing the initial x and y, we plug this into the geometric series formula (1−ra), and we get 64315⋅6364=5, 641053⋅6364=353. Therefore, the coordinates of point P are (5,353), so using the Pythagorean Theorem, OP2=3100, for an answer of 103.
-molocyxu
Solution 2 (Complex)
We place the ant at the origin of the complex plane with its first move being in the positive real direction. Then the ant's journey can be represented as the infinite series
51+2e3iπ+(2e3iπ)2+⋯
Using the formula for an infinite geometric series, this is equal to
1−21e3iπ5=1−41+i35=3−i320=5+35i3
We are looking for the square of the modulus of this value:
5+35i32=25+325=3100
so the answer is 100+3=103.
Solution 3 (Solution 1 Faster)
The ant goes in the opposite direction every 3 moves, going (1/2)3=1/8 the distance backwards. Using geometric series, he travels 1−1/8+1/64−1/512...=(7/8)(1+1/64+1/4096...)=(7/8)(64/63)=8/9 the distance of the first three moves over infinity moves. Now, we use coordinates meaning (5+5/4−5/8,0+53/4+53/8) or (45/8,153/8). Multiplying these by 8/9, we get (5,53/3)⟹103 .
~Lcz
Solution 4 (Official MAA 1)
Suppose that the bug starts at the origin (0,0) and travels a distance of a units due east on the first day, and that there is a real number r with 0suchthateachdayafterthefirst,thebugwalksrtimesasfarasthepreviousday.Ondayn,thebugtravelsalongthevector\pmb v_{n}thathasmagnitudear^{n-1}anddirection\langle\cos(n\cdot 60^\circ),\sin(n\cdot 60^\circ)\rangle.ThenPistheterminalpointoftheinfinitesumofthevectors\pmb v_{1}+\pmb v_{2}+\pmb v_3+\cdots.Thex$-coordinate of this sum is
a(cos0∘+rcos60∘+r2cos120∘+r3cos180∘+r4cos240∘+r5cos300∘+r6cos360∘+⋯).
Because the angles repeat after 6 terms, this sum is equal to
aS(1+r6+r12+r18+⋯)=1−r6aS,
where
S=cos0∘+rcos60∘+r2cos120∘+r3cos180∘+r4cos240∘+r5cos300∘.
Similarly, the y-coordinate of P will be 1−r6aT, where
T=sin0∘+rsin60∘+r2sin120∘+r3sin180∘+r4sin240∘+r5sin300∘.
In this case r=21 and a=5, so
S=1+41−81−81−321+641=6463,T=0+43+83+0−323−643=64213,
and the coordinates of P are
(1−6415S,1−6415T)=(5,353).
Thus the square of the distance from the origin to P is 25+325=3100. The requested sum is 100+3=103.
Solution 5 (Official MAA 2)
Let point O be the origin in the complex plane. Point P is the complex sum 5(1+z+z2+⋯)=1−z5, where z=41+i3. The distance squared is
OP2=1−41+i352=4−(1+i3)2(4⋅5)2=9+3400=3100.
Hence the answer is 100+3=103.
Solution 6 (No coordinates, but basically using the same idea as Solution 1)
The bug goes forward and backward in three directions: straight east, northeast, and northwest. It travels 5−85+645−⋯=940 units east. Thus, it goes northeast 2940=920 units northeast and 910 units northwest. Now, the bug travels a total of 940+910−95=945=5 units east and a total of 9103+953=9153=353 units north because of the 30-60-90 right triangles formed. Now, OP2=52+352=3100 by the Pythagorean Theorem, and the answer is 103.
-integralarefun
Solution 7
The bug's bearings on each traversal are 0∘,60∘,120∘, and so on; in general, the n−th traversal has length 5⋅(1/2)n−1 and bearing 60(n−1). This means that the x and y displacements for the n−th traversal are
(Δxn,Δyn)=(5⋅(1/2)n−1cos(60(n−1))∘,5⋅(1/2)n−1sin(60(n−1))∘).
Summing this over all the displacements, we get
xP=n=1∑∞5⋅(1/2)n−1cos(60(n−1))∘,yP=n=1∑∞5⋅(1/2)n−1sin(60(n−1))∘.
We then have
OP2=xP2+yP2=n=1∑∞(5⋅(1/2)n−1cos2(60(n−1))∘)+(5⋅(1/2)n−1sin2(60(n−1))∘)=n=1∑∞(5⋅(1/2)n−1)2(cos2(60(n−1))∘+sin2(60(n−1))∘)=n=1∑∞(25⋅(1/4)n−1)=1−1/425=100/3.
Thus, the answer is 100+3=103. --MenuThreeOne
Video Solution with Motion in Python
https://youtu.be/RrMsMw_ZrBU
Moving Bug in AIME solution with python turtle scripts