I encounter a modular arithmetic problem, which says:
"Find the last Digit of $17^{16}$, by intuition the last digit of a number is the remainder of the number divided by $10$."
So the statement is: $17^{16} \pmod {10}.$
According to my knowledge, I figured out that the solution to this problem can be "solved" this way:
** $17^{16}\pmod {10}$ = $(17^8\pmod{10} * 17^8\pmod{10})\pmod{10}$**
then we get $(7 * 7)\pmod{10}$, which is equal to $49\pmod{10}$, and we get a result of $ 9$.
The problem is that when I go to modular calculator around the internet I get a result of 1. and I certainly don't know why.. check for yourself: https://www.mtholyoke.edu/courses/quenell/s2003/ma139/js/powermod.html
It is actually more simple than what you've done: By Euler's Theorem
$$\rm a^{\varphi(10)}\equiv a^4\equiv 1\pmod {10}$$ as long as $10$ and $\rm a$ are relatively prime, and $\rm a=17$ certainly satifies the condition.
Thus
Alternatively Observe that $$17^{16}\equiv (10+7)^{16}\equiv 7^{16}\equiv 49^{8}\equiv 9^8\color{red}{\equiv (-1)^8}\equiv 1\pmod {10}$$