Prove $a\cdot (10)^n\equiv a\cdot 1\pmod 3$ using induction.

I need to prove this equation to be true not sure how to solve. I know I have to first use one and then plug in $k+1$ but what am I plugging it into a or n and then how do I solve?

  • $\begingroup$ Do you have to use induction? $\endgroup$ – user258700 Dec 3 '15 at 16:19
  • 1
    $\begingroup$ The solution without induction is much simpler since $10\equiv 1\pmod{3}$. $\endgroup$ – Jack Frost Dec 3 '15 at 16:27

$$a\cdot 10^k \equiv a \quad(mod3)$$ $$a\cdot 10^{k+1}=a\cdot 10^k\cdot (9+1)\equiv a\cdot 10^k \equiv a \quad(mod3)$$


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.