Difference between revisions of "Modular arithmetic"
(added more resources (Naoki's)) |
|||
| Line 8: | Line 8: | ||
=== Introductory Resources === | === Introductory Resources === | ||
* The AoPS [http://www.artofproblemsolving.com/Books/AoPS_B_Item.php?page_id=10 Introduction to Number Theory] by [[Mathew Crawford]]. | * The AoPS [http://www.artofproblemsolving.com/Books/AoPS_B_Item.php?page_id=10 Introduction to Number Theory] by [[Mathew Crawford]]. | ||
| + | === Intermediate Resources === | ||
| + | * [http://www.artofproblemsolving.com/Resources/Papers/SatoNT.pdf Number Theory Problems and Notes] by [[Naoki Sato]]. | ||
| + | === Olympiad Resources === | ||
| + | * [http://www.artofproblemsolving.com/Resources/Papers/SatoNT.pdf Number Theory Problems and Notes] by [[Naoki Sato]]. | ||
Revision as of 16:42, 28 June 2006
Modular arithmetic is a special type of arithmetic that involves only integers. Since modular arithmetic is such a broadly useful tool in number theory, we divide its explanations into several levels:
Resources
Introductory Resources
- The AoPS Introduction to Number Theory by Mathew Crawford.
