Mod Arith 2: Computation
One of two beginner units in number theory focusing on modular arithmetic. Emphasis on concrete calculation in problems which ultimately ask for a numerical answer. The two Modular Arithmetic units can be done in either order.
Super fun unit, would highly recommend all to do :D
Philosophy
This unit creates the idea that there are two types of computational number theory problems:
-
"Problems which are actually algebra or combinatorics problems that happen to use integers in some superficial way."
-
Just plain number theory.
For this reason, the problem set contains a wide variety of problems. Most noticeable are the three (and a half) sections that pertain to computational problems, olympiad problems, diophantine equations, and a short one on ACTUAL AIME PROBLEMS! However, the two types of number theory problems are prevalent in all parts (except arguably diophantine equations.)
Notable Problems
- NIMO 23.7: required computational problem, instructive use of FLT.