| Week | Monday | Tuesday | Wednesday | Thursday | Friday |
|---|---|---|---|---|---|
| 1 |
Mar 28
Rings and fields |
Mar 30
Modular arithmetic |
Apr 1
Polynomials |
||
| 2 |
Apr 4
Modular arithmetic with polynomials HW 1 Due |
Apr 6
Division for integers |
Apr 8
Division for polynomials |
||
| 3 |
Apr 11
Zero divisors, units, gcds HW 2 Due |
Apr 13
gcds, the Euclidean algorithm |
Apr 15
The Euclidean algorithm, Bezout's theorem |
||
| 4 |
Apr 18
Bezout's theorem, units in our favorite rings HW 3 Due |
Apr 20
Review |
Apr 22
Midterm 1 |
||
| 5 |
Apr 25
Euler's theorem HW 4 Due |
Apr 27
Orders modulo n |
Apr 29
Chinese Remainder Theorem |
||
| 6 |
May 2
Chinese Remainder Theorem HW 5 Due |
May 4
RSA |
May 6
RSA |
||
| 7 |
May 9
Shor's and Pollard's Algorithms |
May 11
Review HW 6 Due |
May 13
Midterm 2 |
||
| 8 |
May 16
Unique factorization |
May 18
Unique factorization, Gaussian Integers |
May 20
Gaussian Integers |
||
| 9 |
May 23
BCH codes HW 7 Due |
May 25
BCH codes |
May 27
The primitive element theorem |
||
| 10 |
May 30
Memorial Day Holiday |
Jun 1
Review HW 8 Due |
Jun 3
Review |
||
| 11 |
Jun 6
Final Exam 3pm-6pm |
| Department of Mathematics | Math 117 |