Math 40520 Theory of Numbers (Fall 2018)
Undergraduate number theory

 

Due Set Topics
9/7 Homework 1 Gcd, Euclidean algorithm, Bezout, factorizations, base p expansions
9/14 Homework 2 The Euclidean algorithm, diophantine equations using congruences, inversion mod n
9/21 Homework 3 Multiplicative orders, Euler's function, Chinese Remainder Theorem
9/28 Homework 4 Euler's theorem, Chinese Remainder Theorem, multiplicative orders, bases other than 10
10/05 Homework 5 The Chinese Remainder Theorem, Hensel's lemma, Euclidean algorithm
10/12 Take-home Midterm
10/26 Homework 6 Cryptography
11/2 Homework 7 Quadratic residues
11/9 Homework 8 Quadratic residues, sums of Legendre symbols
11/16 Homework 9 Diophantine equations mod p
11/30 Homework 10 Primality testing, binomial coefficients mod p
Take-home Final

The design of this webpage is based on the MIT course web page template.