A Remainder Problem

What is the remainder when 1^5+2^5+3^5+.......+100^5 is divided by 4?


The answer is 0.

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.

2 solutions

Omkar Kulkarni
Jan 1, 2015

When we take any even number to the power of 5, we'll be multiplying the number by 2 at least twice, which means that it will leave a remainder of 0, modulo 4.

Thus the expression becomes 1 5 + 3 5 + 5 5 + . . . + 9 9 5 1^{5} + 3^{5} + 5^{5} + ... + 99^{5}

Now, 1 5 1 ( m o d 4 ) 1^{5} \equiv 1 (mod 4) and 3 5 3 ( m o d 4 ) 3^{5} \equiv 3 (mod 4) .

5 5 ( 4 + 1 ) 5 1 5 1 ( m o d 4 ) 5^{5} \equiv (4 + 1)^{5} \equiv 1^{5} \equiv 1 (mod 4)

7 5 ( 4 + 3 ) 5 3 5 3 ( m o d 4 ) 7^{5} \equiv (4 + 3)^{5} \equiv 3^{5} \equiv 3 (mod 4)

9 5 ( 8 + 1 ) 5 1 5 1 ( m o d 4 ) 9^{5} \equiv (8 + 1)^{5} \equiv 1^{5} \equiv 1 (mod 4)

1 1 5 ( 8 + 3 ) 5 3 5 3 ( m o d 4 ) 11^{5} \equiv (8 + 3)^{5} \equiv 3^{5} \equiv 3 (mod 4)

...

( 4 n + 1 ) 5 1 5 1 ( m o d 4 ) (4n+1)^{5} \equiv 1^{5} \equiv 1 (mod 4)

( 4 n + 3 ) 5 3 5 3 ( m o d 4 ) (4n+3)^{5} \equiv 3^{5} \equiv 3 (mod 4)

Therefore, the expression becomes

25 × 1 + 25 × 3 25 × 4 0 ( m o d 4 ) 25 \times 1 + 25 \times 3 \equiv 25 \times 4 \equiv \boxed {0} (mod 4)

Note than by Euclid's Division Lemma, any odd number can be expressed in the form of ( 4 n + 1 ) (4n+1) or ( 4 n + 3 ) (4n+3) . Thus these are the only possible forms of the powers of the odd numbers left in the sequence, except for 1 5 1^{5} and 3 5 3^{5}

Could someone tell me how to create the space between the last number in the line and the ( m o d 4 ) (mod 4) ?

Concisely, the solution can also be written as follows:

The given problem can be represented using summation notation as:

i = 1 25 ( ( 4 i 3 ) 5 + ( 4 i 2 ) 5 + ( 4 i 1 ) 5 + ( 4 i ) 5 ) ( m o d 4 ) i = 1 25 ( 1 5 + 0 5 + ( 1 ) 5 + 0 5 ) ( m o d 4 ) i = 1 25 ( 1 1 ) i = 1 25 ( 0 ) 0 ( m o d 4 ) \sum_{i=1}^{25} \left((4i-3)^5+(4i-2)^5+(4i-1)^5+(4i)^5\right)\pmod{4}\\ \equiv \sum_{i=1}^{25}\left(1^5+0^5+(-1)^5+0^5\right)\pmod{4}\\ \equiv \sum_{i=1}^{25}\left(1-1\right) \equiv \sum_{i=1}^{25}\left(0\right)\equiv 0\pmod{4}

Prasun Biswas - 6 years, 3 months ago

Nice solution.I think a space after the number will create the space.

Kalpok Guha - 6 years, 5 months ago

Omkar Kulkarni, I'm providing a sample LaTeX \LaTeX code on how to leave a space between the last number and the ( m o d 4 ) \pmod{4} part.

3 5 3 ( m o d 4 ) 3^5\equiv 3\pmod{4}

Hover your mouse pointer over the code or use the "Toggle LaTeX \LaTeX " option to see the raw LaTeX \LaTeX code.

Prasun Biswas - 6 years, 3 months ago
Sudoku Subbu
Jan 21, 2015

consider, 1 5 + 2 5 + 3 5 + . . . . . . . . . . . . . . . . . + 10 0 5 x ( m o d 4 ) 1^{5}+2^{5}+3^{5}+.................+100^{5} \equiv x \pmod{4} = > 1 + 0 + 243 + 0 + 0 + 0 + . . . . . . . . . . . + 0 x ( m o d 4 ) =>1+0+243+0+0+0+...........+0 \equiv x \pmod{4} = > r e m a i n d e r = 244 4 =>remainder=\frac{244}{4} therefore the remainder is 0.

That would've worked if it was a summation of factorials. But that isn't the case here. This solution is completely wrong. You got the result correct because even though some of the terms have non-zero remainders, they get cancelled out eventually.

A counterexample to your solution can be given by showing that any one of the terms between 4 5 4^5 and 10 0 5 100^5 (inclusive) of the given sum leaves a non-zero remainder modulo 4 4 . Take the term 7 5 7^5 for example. We then have,

7 5 3 ≢ 0 ( m o d 4 ) 7^5\equiv 3\not \equiv 0\pmod{4}

Prasun Biswas - 6 years, 3 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...