Difference between revisions of "2020 AMC 10B Problems/Problem 15"
MRENTHUSIASM (talk | contribs) m (→Solution 3.2 (Direct: Similar to Solution 2)) |
MRENTHUSIASM (talk | contribs) m (→Solution 3.2 (Direct: Similar to Solution 2)) |
||
Line 53: | Line 53: | ||
<ol start="0" style="margin-left: 1.5em;"> | <ol start="0" style="margin-left: 1.5em;"> | ||
<li>Initially, one cycle has length <math>5,</math> from which <math>L</math> must be divisible by <math>5.</math></li><p> | <li>Initially, one cycle has length <math>5,</math> from which <math>L</math> must be divisible by <math>5.</math></li><p> | ||
− | <li>After the first round of erasing, one cycle | + | <li>After the first round of erasing, one cycle has length <math>L\left(1-\frac13\right)=\frac23L,</math> from which <math>L</math> must be divisible by <math>3.</math></li><p> |
− | <li>After the second round of erasing, one cycle | + | <li>After the second round of erasing, one cycle has length <math>L\left(1-\frac13\right)\left(1-\frac14\right)=\frac12L,</math> from which <math>L</math> must be divisible by <math>2.</math></li><p> |
− | <li>After the third round of erasing, one cycle | + | <li>After the third round of erasing, one cycle has length <math>L\left(1-\frac13\right)\left(1-\frac14\right)\left(1-\frac15\right)=\frac25L,</math> from which <math>L</math> must be divisible by <math>5.</math></li><p> |
</ol> | </ol> | ||
The least such positive integer <math>L</math> is <math>\mathrm{lcm}(5,3,2,5)=30.</math> So, the pattern will repeat for every <math>30</math> digits in the original list, as shown below. The digits erased in the first, second, and third rounds are colored in red, yellow, and green, respectively: | The least such positive integer <math>L</math> is <math>\mathrm{lcm}(5,3,2,5)=30.</math> So, the pattern will repeat for every <math>30</math> digits in the original list, as shown below. The digits erased in the first, second, and third rounds are colored in red, yellow, and green, respectively: |
Revision as of 01:31, 17 April 2021
Contents
Problem
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 ?
Solution 1
After erasing every third digit, the list becomes repeated. After erasing every fourth digit from this list, the list becomes repeated. Finally, after erasing every fifth digit from this list, the list becomes repeated. Since this list repeats every digits and since are respectively in we have that the th, th, and st digits are the rd, th, and th digits respectively. It follows that the answer is
Solution 2
As the LCM of 3, 4, and 5 is , let's look at a 60-digit block of original numbers (many will be erased by Steve). After he erases every third number (1/3), then every fourth number of what remains (1/4), then every fifth number of what remains (1/5), we are left with digits from this 60-digit block. . Writing out the first few digits of this sequence, we have . Therefore, our answer is . ~BakedPotato66
Solution 3 (Illustrations of Solutions 1 and 2)
Note that cycles exist initially and after each round of erasing.
Two solutions follow from here:
Solution 3.1 (Stepwise: Similar to Solution 1)
Let the parentheses denote cycles. It follows that:
- Initially, the list has cycles of length
- To find one cycle after the first round of erasing, we need one cycle of length before erasing. So, we first group copies of the current cycle into one, then erase: As a quick verification, one cycle should have length at this point.
- To find one cycle after the second round of erasing, we need one cycle of length before erasing. So, we first group copies of the current cycle into one, then erase: As a quick verification, one cycle should have length at this point.
- To find one cycle after the third round of erasing, we need one cycle of length before erasing. We already have it here, so we erase: As a quick verification, one cycle should have length at this point.
Since are congruent to modulo respectively, the three digits in the final positions are respectively: Therefore, the answer is
~MRENTHUSIASM (inspired by TheBeautyofMath)
Solution 3.2 (Direct: Similar to Solution 2)
We will consider one cycle after all three rounds of erasing. Suppose this cycle has length before any round of erasing. It follows that:
- Initially, one cycle has length from which must be divisible by
- After the first round of erasing, one cycle has length from which must be divisible by
- After the second round of erasing, one cycle has length from which must be divisible by
- After the third round of erasing, one cycle has length from which must be divisible by
The least such positive integer is So, the pattern will repeat for every digits in the original list, as shown below. The digits erased in the first, second, and third rounds are colored in red, yellow, and green, respectively: As indicated by the white squares, each group has digits remaining.
Since are congruent to modulo respectively, the three digits in the final positions are respectively: Therefore, the answer is
~MRENTHUSIASM
Video Solution
https://youtu.be/t6yjfKXpwDs 16:40 ~IceMatrix
See Also
2020 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 14 |
Followed by Problem 16 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AMC 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.