Let be a strictly increasing sequence of positive integers such that
What is the remainder when is divided by 6?
Try also
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Notice that for every integer n, the following is true:
n mod 2 =n^3 mod 2
n mod 3 =n^3 mod 3
Then, this is also true:
n mod 6 =n^3 mod 6
This means we can get rid of the exponents. Consequentially, the answer is equal to the first sum modulo 6. Then, we get:
2018^2018 mod 6 = 2^2 mod 6 = 4 (we used the fact that 2018 modulo 6= 2)