Find remainder when $1^{5} + 2^{5} \cdots +100^{5}$ divided by 4 I'm studding D.M Burton & want to solve:  Find remainder when $1^{5} + 2^{5} \cdots +100^{5}$ divided by $4$. . Please help me by giving your solution to it. I'm new comer to number theory so please don't use theorems above Theory of Congruence.
 A: It is congruent to $1+0+3+0+1+0+3+0+...+1+0+3+0$ which is congruent to $0$ (mod 4).
So the remainder is $0$.
A: Apply "$\bmod4$" on each term, then you get:
$\sum\limits_{n=1}^{100}n^5\equiv25\sum\limits_{n=1}^{4}(n\bmod4)^5\equiv25(1^5+2^5+3^5+4^5)\equiv32500\equiv0\pmod4$
A: $$0^5=0 \pmod4$$
$$1^5=1\pmod4$$
$$2^5= 0 \pmod4$$
$$3^5=3\pmod4$$
$$1^5+2^5+...+100^5=25(1^5+2^5+3^5+4^5)\pmod4=25*0\pmod4=0\pmod4$$
A: You can do it even without knowledge of congruences, we have that $1^5 + 2^5 + ... + n^5= \dfrac {(n(n+1))^2(2n^2+2n-1)}{12}$, now set $n=100$ to get $1^5 + 2^5 + ... + 100^5 = \dfrac {(100 \cdot 101)^2 (2 \cdot 100^2 + 2 \cdot 100 - 1)}{12}=4 \cdot \dfrac {4 \cdot 25^2 \cdot 101^2 \cdot 3 \cdot 6733}{12}$ so your number is divisible by $4$.
A: Another way is to use the "paired element" approach...  Since $a^5+b^5=(a+b)(a^4-a^3b+a^2b^2-ab^3+b^4)$, we have
$$1^5+99^5+2^5+98^5+\dots+ 50^5+100^5\\
=100(1-99+99^2-99^3+99^4)+100(2^4-\dots)+\dots+100(49^4-\dots)+2^5\cdot(25)^5+100^5\\
\equiv 0\pmod 4$$
