2020 AIME I Problems/Problem 8
Contents
- 1 Problem
- 2 Solution 1 (Coordinates)
- 3 Solution 2 (Complex)
- 4 Solution 3 (Solution 1 Faster)
- 5 Solution 4 (Official MAA 1)
- 6 Solution 5 (Official MAA 2)
- 7 Solution 6 (No coordinates, but basically using the same idea as Solution 1)
- 8 Solution 7
- 9 Video Solution with Motion in Python
- 10 Video Solution
- 11 See Also
Problem
A bug walks all day and sleeps all night. On the first day, it starts at point , faces east, and walks a distance of units due east. Each night the bug rotates 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 . Then , where and are relatively prime positive integers. Find .
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 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 . Second move: We use properties of a triangle to get right, up. Third move: left, up. Fourth move: left. Fifth move: left, down. Sixth move: right, down.
Total of x-coordinate: . Total of y-coordinate: .
After this cycle of six moves, all moves repeat with a factor of . Using the formula for a geometric series, multiplying each sequence by will give us the point .
Now, knowing the initial and we plug this into the geometric series formula (), and we get , . Therefore, the coordinates of point are , so using the Pythagorean Theorem, , for an answer of .
-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 Using the formula for an infinite geometric series, this is equal to We are looking for the square of the modulus of this value: so the answer is .
Solution 3 (Solution 1 Faster)
The ant goes in the opposite direction every moves, going the distance backwards. Using geometric series, he travels the distance of the first three moves over infinity moves. Now, we use coordinates meaning or . Multiplying these by , we get .
~Lcz
Solution 4 (Official MAA 1)
Suppose that the bug starts at the origin and travels a distance of units due east on the first day, and that there is a real number with such that each day after the first, the bug walks times as far as the previous day. On day , the bug travels along the vector that has magnitude and direction . Then is the terminal point of the infinite sum of the vectors . The -coordinate of this sum is Because the angles repeat after 6 terms, this sum is equal to where Similarly, the -coordinate of will be , where In this case and , so and the coordinates of are Thus the square of the distance from the origin to is . The requested sum is .
Solution 5 (Official MAA 2)
Let point be the origin in the complex plane. Point is the complex sum , where . The distance squared is
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 units east. Thus, it goes northeast units northeast and units northwest. Now, the bug travels a total of units east and a total of units north because of the 30-60-90 right triangles formed. Now, by the Pythagorean Theorem, and the answer is .
-integralarefun
Solution 7
The bug's bearings on each traversal are and so on; in general, the th traversal has length and bearing This means that the and displacements for the th traversal are
Summing this over all the displacements, we get
We then have
Thus, the answer is --MenuThreeOne
Video Solution with Motion in Python
Moving Bug in AIME solution with python turtle scripts
Video Solution
https://www.youtube.com/watch?v=BtMBSoZ3cMQ
-avn
See Also
2020 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 7 |
Followed by Problem 9 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.