Difference between revisions of "2018 AMC 10B Problems/Problem 16"
MathMaestro9 (talk | contribs) |
m (→Faster Solution) |
||
Line 8: | Line 8: | ||
Remember that <math>n^{3}\equiv n \pmod{6}</math> | Remember that <math>n^{3}\equiv n \pmod{6}</math> | ||
− | Therefore, that huge sum is congruent to <math>2018^{2018} \pmod{6} = 2^{2018} \pmod{6} = \boxed{(E) 4}</math> | + | Therefore, that huge sum is congruent to <math>2018^{2018} \pmod{6} = 2^{2018} \pmod{6} = \boxed{(E) 4}</math> (really, mod 10) |
==Solution== | ==Solution== |
Revision as of 17:07, 16 February 2018
Let be a strictly increasing sequence of positive integers such that What is the remainder when is divided by ?
Faster Solution
Remember that
Therefore, that huge sum is congruent to (really, mod 10)
Solution
(not very good one)
Note that
Note that Therefore, .
Thus, . However, since cubing preserves parity, and the sum of the individual terms is even, the some of the cubes is also even, and our answer is
See Also
2018 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 15 |
Followed by Problem 17 | |
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.