2020 AMC 10B Problem 15
Steve wrote the digits , , , , and in order repeatedly from left to right, forming a list of digits, beginning He then erased every third digit from his list (that is, the rd, th, th, digits from the left), then erased every fourth digit from the resulting list (that is, the th, th, th, digits from the left in what remained), and then erased every fifth digit from what remained at that point. What is the sum of the three digits that were then in the positions ?
Show solution without answering
Key insight
Work with blocks of 30 digits: erasing leaves 20, then 15, then 12. So the final list repeats every 12 digits.
Solution
Nobody can erase digits by hand, so look for a pattern that repeats.
1. Pick a good block size. The original list repeats every digits. The first erasure removes every rd digit, so take a block whose length is a multiple of both and . We use , because it makes the later steps line up too:
- digits, erase every rd, leaves digits;
- is a multiple of : erase every th, leaves ;
- is a multiple of : erase every th, leaves .
Each block length is a multiple of the next step size, so every block is treated in exactly the same way. The final list therefore repeats every digits.
2. Do one block by hand. The first digits are written six times.
- Erase every rd digit: ( digits).
- Erase every th of those: ( digits).
- Erase every th of those: ( digits).
3. Find positions 2019 to 2021. Divide by : . So position is position of a block, and , are positions and .
4. Positions of the block are . Their sum is .
5. Is the list long enough? digits become about , then , then . That is more than , so those positions exist.
The answer is .
Why this works
Erasing every th item from a repeating list gives another repeating list. Choose a block length that fits the old pattern and the erasing step, and every block is treated the same way. Working one block by hand and then dividing by the block length replaces thousands of steps with one small calculation.
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Track the period. The original list repeats every digits. Erasing every third digit is periodic with period , leaving digits per ; equivalently, per original digits, remain. Erasing every fourth of those leaves per block, and erasing every fifth of those leaves . Each block length is divisible by the erasure step, so the erasures line up with block boundaries and the final list has period .
Work out one block of original digits, :
- Remove every 3rd: (20 digits).
- Remove every 4th: (15 digits).
- Remove every 5th: (12 digits).
Now , so positions correspond to positions of the block: digits . Their sum is .
(The list is long enough: digits remain, more than .)
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 12: Introduction to Modular Arithmetic
- Introduction to Number Theory, Chapter 3: Multiples and Divisors (§3.3, §3.4, §3.7)
- Introduction to Algebra, Chapter 21: Sequences & Series (§21.1, §21.2, §21.3, §21.4)
- Prealgebra, Chapter 15: Problem-Solving Strategies (§15.1)
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.