1 × 1 0 1 + 2 × 1 0 2 + 3 × 1 0 3 + ⋯ + 2 0 1 5 × 1 0 2 0 1 5
What is the remainder when the number above is divided by 11?
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.
Nice solution. And thanks for the generalization as well.
Did the Same way :D
A great solution!
Yeah Same way
Each two terms combined together (first and second, third and fourth .... ) mod 11 is equal to one, we have 1007 pairs and we are left with (1007-2015) mod 11 which is equal to "-7" mod 11, which equals 4
1 0 2 n + 1 ≡ − 1 ( m o d 1 1 ) . 1 0 2 n ≡ + 1 ( m o d 1 1 ) . S o o d d t e r m i s − 1 , e v e n i s + 1 . ∴ f r o m 1 t o 2 0 1 4 e v e n t e r m s w i l l a c c u m u l a t e + 1 0 0 7 . B u t l a s t t e r m i s 2 0 1 5 a n 0 d d − t i v e t e r m . S o n e t w e g e t − 2 0 1 5 + 1 0 0 7 = − 1 0 0 8 . − 1 0 0 8 + 1 1 0 0 = 9 2 . 9 2 ≡ 4 m o d 1 1 . A N S W E R = 4 .
The second line should be ≡ 1 nor − 1
A great solution.Not only great but also a simplest solution.Thanks
Start by reducing this to a pattern. 10 divided by 11 has a remainder of 10. 210 divided by 11 has a remainder of 1. 3,210 divided by 11 has a remainder of 9. 43,210 divided by 11 has a remainder of 2. The pattern continues as 8,3,7,4,6,5,5,6,4,7,3,8,2,9,10,1. Separate of numbers of ñ from even and you get 10,9,8,7,5,4,3 ,2,1,0,10,9... For odd and 1,2,3,4,5,6,7,8,9,10,0,1,2... Our n is 2015 is odd so we use the odd pattern and voila we get 4!
Problem Loading...
Note Loading...
Set Loading...
The given sum is S = k = 1 ∑ 2 0 1 5 k ⋅ 1 0 k .
Since 1 0 ≡ − 1 ( m o d 1 1 ) , we have,
S = k = 1 ∑ 2 0 1 5 k ⋅ 1 0 k ≡ k = 1 ∑ 2 0 1 5 k ⋅ ( − 1 ) k ( m o d 1 1 ) ⟹ S ≡ − 1 + 2 − 3 + 4 − 5 + 6 − … + 2 0 1 4 − 2 0 1 5 ( m o d 1 1 )
Group the odd and even terms together and we have,
S ≡ k = 1 ∑ 2 0 1 5 k ⋅ ( − 1 ) k ≡ ( i = 1 ∑ 1 0 0 7 2 i ) − ( i = 0 ∑ 1 0 0 7 ( 2 i + 1 ) ) ⟹ S ≡ − ( 2 × 0 + 1 ) + i = 1 ∑ 1 0 0 7 ( 2 i − 2 i − 1 ) ⟹ S ≡ − 1 + i = 1 ∑ 1 0 0 7 ( − 1 ) ≡ − 1 − 1 0 0 7 ≡ − 1 0 0 8 ≡ 4 ( m o d 1 1 )
Here's a generalization. Consider the sum upto n instead of 2 0 1 5 and denote that sum by S n where n ∈ Z + . We have,
S n ≡ ⌊ ( − 1 ) n ⋅ 2 n ⌋ ( m o d 1 1 )
To obtain this result, it suffices to observe the following:
S n ≡ ⎩ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎧ ( i = 1 ∑ ( n − 1 ) / 2 2 i ) − ( i = 0 ∑ ( n − 1 ) / 2 ( 2 i + 1 ) ) for odd n ( i = 1 ∑ n / 2 2 i ) − ( i = 1 ∑ n / 2 ( 2 i − 1 ) ) for even n ( m o d 1 1 )
Then, proceed similarly as done in original solution. Get results for both odd and even cases and merge both the results properly.