Home
Book
Learn
Library
Practice
Contact
Log In
MODBasic
Basic
Problem - 4224
Show that for any positive integer $k$, it always holds that $10^k\equiv 4\pmod{6}$.
The solution for this problem is available for
$0.99
. You can also purchase a pass for all available solutions for
$99
.
report an error