Let r be the remainder of:
1 + 2 2 + 3 3 + 4 4 + 5 5 + 6 6 + 7 7 + 8 8 + 9 9 + 1 0 1 0
when divided by 3 , and s the sum of the last digits of each of the terms of the sum above. What is r + s ?
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.
Thank you :) .
1 + 2 2 + 3 3 + 4 4 + 5 5 + 6 6 + 7 7 + 8 8 + 9 9 + 1 0 1 0 =
1 + 1 + 0 + 1 + 2 + 0 + 1 + 1 + 0 + 1 = 8 = 2 ( m o d 3 ) = r ;
s = 1 + 4 + 7 + 6 + 5 + 6 + 3 + 6 + 9 + 0 = 4 7 ;
thus: 2 + 4 7 = 4 9
Problem Loading...
Note Loading...
Set Loading...
Let the sum be S = k = 1 ∑ 1 0 k k . We need to find k k mod 3 and k k mod 1 0 in our calculations. We can apply Euler's theorem , if k and 3 are coprime integers or g cd ( k , 3 ) = 1 . Then, we have k k ≡ k k mod ϕ ( 3 ) ≡ k k mod 2 , where ϕ ( 3 ) = 2 is the Euler's totient function of 3. Similarly for 10 and ϕ ( 1 0 ) = 4 . Therefore, we have:
S ≡ 1 + 2 2 mod 2 + 3 3 + 4 4 mod 2 + 5 5 mod 2 + 6 6 + 7 7 mod 2 + 8 8 mod 2 + 9 9 + 1 0 1 0 mod 2 (mod 3) ≡ 1 + 2 0 + 0 + 4 0 + 5 1 + 0 + 7 1 + 8 0 + 0 + 1 0 0 (mod 3) ≡ 1 + 1 + 0 + 1 + 2 + 0 + 1 + 1 + 0 + 1 (mod 3) ≡ 8 e q u i v 2 (mod 3) 3 ∣ 3 3 , 3 ∣ 6 6 , 3 ∣ 9 9
⟹ r = 2
S ⟹ s ≡ 1 + 2 2 + 3 3 mod 4 + 4 4 + 5 5 + 6 6 + 7 7 mod 4 + 8 8 + 9 9 mod 4 + 1 0 1 0 (mod 10) ≡ 1 + 4 + 2 7 + 1 6 2 + 5 5 + 6 6 + 7 3 + 1 6 6 + 9 1 + 0 (mod 10) ≡ 1 + 4 + 2 7 + 6 + 5 + 6 + 4 9 ⋅ 7 + 6 + 9 + 0 (mod 10) = 1 + 4 + 7 + 6 + 5 + 6 + 3 + 6 + 9 + 0 = 4 7 1 0 ∣ 1 0 1 0 See Note
⟹ r + s = 2 + 4 7 = 4 9
Note: Powers of a natural number ends with 6 end with 6. Powers of a natural number ends with 5 end with 5.