Math 40520 Theory of Numbers (Fall 2022)
Undergraduate number theory
| Due | Set | Topics | |
| 9/7 | Homework 1 | Gcd, Euclidean algorithm, Bezout, factorizations, base b expansions | |
| 9/14 | Homework 2 | The Euclidean algorithm, diophantine equations using congruences, digits | |
| 9/21 | Homework 3 | Modular arithmetic, Euler's function, Chinese Remainder Theorem | |
| 9/28 | Homework 4 | Euler's theorem, Chinese Remainder Theorem, multiplicative orders, primitive roots | |
| 10/5 | Homework 5 | The Chinese Remainder Theorem, primitive roots, equations modulo n Artin Conjecture | |
| 10/12 | Take-home Midterm | ||
| 11/2 | Homework 6 | Quadratic reciprocity, valuations, Taylor series, Lucas' theorem | |
| 11/9 | Homework 7 | Valuations, distribution of primes, lifting the exponent | |
| 11/16 | Homework 8 | Primitive roots mod prime powers, continued fractions | |
| 11/30 | Homework 9 | Continued fractions | |
| 12/7 | Homework 10 | Hensel's lifting lemma, quadratic equations | |
| 12/16 | Take-home Final |
The design of this webpage is based on the MIT course web page template.
