More on divisibility: Modular Arithmetic

All of the divisibility tricks we learned about during the September meeting are based on modular arithmetic. Here are some excellent resources to help you learn more:

https://www.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/what-is-modular-arithmetic

http://www.artofproblemsolving.com/Wiki/index.php/Modular_arithmetic

and for some uses in higher mathematics and computer science:

http://www.artofproblemsolving.com/Wiki/index.php/Fermat’s_Little_Theorem