Find the remainder when 1 5 + 2 5 + 3 5 + . . . . . + 1 0 0 5 is divided by 4.
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.
Could you explain how n^5 is congruent to n in mod 4?
Log in to reply
Since there are only two cases, it may be easiest just to check those, 1 5 ≡ 1 and 3 5 ≡ 3 ( m o d 4 )
I think most people have done it by fluke....and got their ans. Correct... I mean is it really of lvl 2 type
Grouping the value in terms of four gives x 5 + ( x + 1 ) 5 + ( x + 2 ) 5 + ( x + 3 ) 5 = 4 ( x 5 + 3 5 x 3 + 9 0 x 2 + 6 9 ) + 1 0 x ( 3 x 2 + 4 9 ) The hardest part is find the reminder by dividing 1 0 x ( 3 x 3 + 4 9 ) with 4. For x in even number, it is obvious that 1 0 x is dividable by 4. x in odd number, when cube, also remains odd and when add with odd (49), will result to the even number, making the whole value dividable by 4 as well, thus, thus, the reminder will be 0. Repeat the process for x = 1 , 5 , 9 , 1 3 , … , 9 7 also yields the same result, thus ∑ x = 1 1 0 0 ( x 5 ) is dividable by 4 and the remainder is 0.
Group data by group of four elements from whole set of number: {1,2,3,4}, {5,6,7,8},...,{97,98,99,100}. It is easy to see each group has remainder 0 when dividing by 4. So: a n s = 0
Problem Loading...
Note Loading...
Set Loading...
For even n , we know that n 5 is divisible by 2 5 = 3 2 . For odd n , observe that n 5 ≡ n ( m o d 4 ) . Thus ∑ k = 1 5 0 ( 2 k − 1 ) 5 ≡ ∑ k = 1 5 0 ( 2 k − 1 ) = 5 0 2 ≡ 0 ( m o d 4 ) . Thus the remainder is 0 .
Bonus question: What is the remainder when the sum is divided by 16?