What is the remainder when $N = (1! + 2! + 3! + 4! + ........... + 1000! )^{40}$ is divided by $10?$
Your answer is correct. A few pointers, however:
- Note that you can reduce $33$ to just $3$
- Euler's theorem says that $3^{4}\equiv 1\pmod{10}$
Your answer is correct. A few pointers, however: