Difference between revisions of "2017 AIME I Problems/Problem 3"
Made in 2016 (talk | contribs) m (changed d(n) to d_n) |
m (→Solution) |
||
Line 4: | Line 4: | ||
==Solution== | ==Solution== | ||
− | We see that <math>d_n</math> appears in cycles of <math>20</math>, adding a total of <math>70</math> each cycle. | + | We see that <math>d_n</math> appears in cycles of <math>20</math> and the cycles are <cmath>1,3,6,0,5,1,8,6,5,5,6,8,1,5,0,6,3,1,0,0,</cmath> adding a total of <math>70</math> each cycle. |
Since <math>\left\lfloor\frac{2017}{20}\right\rfloor=100</math>, we know that by <math>2017</math>, there have been <math>100</math> cycles and <math>7000</math> has been added. This can be discarded as we're just looking for the last three digits. | Since <math>\left\lfloor\frac{2017}{20}\right\rfloor=100</math>, we know that by <math>2017</math>, there have been <math>100</math> cycles and <math>7000</math> has been added. This can be discarded as we're just looking for the last three digits. | ||
Adding up the first <math>17</math> of the cycle of <math>20</math>, we get that the answer is <math>\boxed{069}</math>. | Adding up the first <math>17</math> of the cycle of <math>20</math>, we get that the answer is <math>\boxed{069}</math>. |
Revision as of 20:41, 30 January 2019
Problem 3
For a positive integer , let be the units digit of . Find the remainder when is divided by .
Solution
We see that appears in cycles of and the cycles are adding a total of each cycle. Since , we know that by , there have been cycles and has been added. This can be discarded as we're just looking for the last three digits. Adding up the first of the cycle of , we get that the answer is .
See Also
2017 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 2 |
Followed by Problem 4 | |
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.