# What is the last digit of this expression: $4^{2^1} + 4^{2^2} + 4^{2^3} + ...+ 4^{2^{2013}}$

The expression:

$4^{2^1} + 4^{2^2} + 4^{2^3} + ...+ 4^{2^{2013}}$

I know that the last digit of each of the sumands is 6, but I have trouble proving that. I tried to prove it using induction, but then I realized that I don't have a clue how to write it properly.

Also, because of the fact that the last digit of every sumand is 6, the last digit of the given expression is the last digit of $2013 * 6$ which is 8.

• Can you somehow prove that the last digit of $4^{2k} = (4^2)^k$ is $6$ for all $k \geqslant 1$? Feb 20, 2014 at 21:35
• I have a little trouble when writing that. I don't know how I should write the hypothesis of the induction. Should I just write it like this: "Let's assume that the last digit of $4^{2k}$ is 6."? Feb 20, 2014 at 21:38
• Are you familiar with the notation $4^2 \equiv 6 \pmod{10}$? Feb 20, 2014 at 21:40
• Uh, cannot believe how I couldn't think of that. Thanks a bunch :D Feb 20, 2014 at 21:41

You can write it as the following (following from Daniel's hint): $16x\equiv6\mod 10$ for any $x$ where $x\equiv6\mod10$. From there it is easy to show that $4^{2^k}\equiv6\mod10$ and you already have the rest.
$4^2\equiv 6 \mod 10$ and $6^2\equiv 6\mod 10$, which is equivalent to $4(^2)^2=4^4$.
With the $(6 \mod 10)$ relation, we can continue doubling the exponent of $4$ with ease.
$(4^4)^2=4^8\equiv 6^2=6 \mod 10, \dots$