Selective Reading Guide

Read the local lessons and attempt their drills first. The source backbone is Mathematics for Computer Science, the MIT Spring 2015 course version. Its Chapter 8 covers number theory; later editions can use different numbering.

• For divisibility, Euclid, linear combinations and primes, use Chapter 8.1–8.5.
• For congruences and inverse reasoning, use Chapter 8.6–8.9.
• Use the course reading index to locate original context. Whole-course or whole-book completion is optional additional work.

Read to answer a question: Why does Euclid preserve common divisors? Why is an inverse equivalent to coprimality? Why must the modulus shrink after dividing by a gcd? Write your own proof outline before reopening the source. Do not count a copied derivation as independent evidence.

The local reference summarizes our implementation conventions. Exercises and code here are original; extracted book text is not included in the lab.