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.
Checking powers of 1 3 modulo 2 0
⎩ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎧ 1 3 1 ≡ 1 3 i m o d i 2 0 1 3 2 ≡ 9 i m o d i 2 0 1 3 3 ≡ 1 7 i m o d i 2 0 1 3 4 ≡ 1 i m o d i 2 0 ⋯
And then the pattern repeats since 1 3 4 ≡ 1 i m o d i 2 0
Adding up all this remainders
1 3 + 9 + 1 7 + 1 ≡ 4 0 ≡ 0 i m o d i 2 0
Since none of the partial sums 1 3 , 1 3 + 9 , 1 3 + 9 + 1 7 is divisible by 2 0 , n has to be a multiple of 4 in order to have
2 0 ∣ k = 1 ∑ n 1 3 k
Among the answers, only 7 6 is a multiple of 4