Math 40520 Theory of Numbers (Fall 2015)
Undergraduate number theory
| Due | Set | Solutions | Topics |
| Due 2015-09-09 | Homework 1 | Solutions | Linear and quadratic diophantine equations |
| Due 2015-09-16 | Homework 2 | Solutions | The Euclidean algorithm, diophantine equations using congruences, Wilson's theorem |
| Due 2015-09-23 | Homework 3 | Solutions | Multiplicative orders, primitive roots |
| Due 2015-09-30 | Homework 4 | Solutions | Hensel's lemma, binomial coefficients mod p |
| Due 2015-10-07 | Homework 5 | Solutions | The Chinese Remainder Theorem, Euler's phi function |
| Due 2015-10-14 | Homework 6 | Solutions | Quadratic residues, Gauss' Lemma, the Legendre symbol |
| Due 2015-11-11 | Homework 7 | Solutions | Primes and congruences |
| Due 2015-11-18 | Homework 8 | Solutions | Infinitely many primes, multi-congruences, primality testing |
| Due 2015-12-02 | Homework 9 | Solutions | Binomial coefficients and primes, Minkowski's geometry of numbers, Dirichlet series and arithmetic functions |
| Due 2015-12-09 | Homework 10 | Solutions | Dirichlet series, Euclidean domains, division with remainder, gcd, Bezout's identity |
The design of this webpage is based on the MIT course web page template.
