MAT 312/AMS 351, L01: Applied Algebra
Stony Brook            Spring 2019 |
---|
  |
Dates | Topic | Read | Problem Set |
1/28, M - 2/4, M | Mathematical induction (in recitations) | Sections 1.1-1.3 | |
Euclid's algorithm for gcd | |||
Unique Factorization Theorem | |||
2/5, Tu - 2/11, M | Modular arithmetic | Sections 1.4,1.5 | |
2/12, Tu - 2/18, M | Euler's Theorem | Section 1.6 | |
Public key cryptography | |||
2/19, Tu - 2/20, W | Review for Midterm I | Chapter 1 | none |
2/21, Th | Midterm I (snow date: 2/26, Tu): info | ||
2/25, M | Overview of Midterm I | ||
2/26, Tu - 3/4, M | Permutations | Sections 4.1,4.2 | |
3/5, Tu - 3/11, M | Introduction to groups | Section 4.3, pp200-206 | |
3/12, Tu - 3/14, Th | Structures of groups | Sections 5.1,5.2 | |
3/18, M - 3/21, Th | no classes, no office hours | ||
3/25, Mo - 4/1, Mo | Small groups | Section 5.3 | |
4/2, Tu - 4/8, Mo | Groups and codes | Section 5.4 notes |
|
4/9, Tu - 4/10, W | Review for Midterm II | Sections 4.1-4.3 Chapter 5 |
none |
4/11, Th | Midterm II: info | ||
4/15, M | Overview of Midterm II | ||
4/16, Tu - 4/22, Mo | Other algebraic structures | Sections 4.4,6.1 | |
Polynomials | |||
4/23, Tu - 4/29, Mo | Division and factorization | Sections 6.2,6.3 | |
4/30, Tu - 5/6, Mo | Polynomials and codes | Sections 6.4,6.5 notes |
|
5/7, Tu - 5/9, Th | Review for Final Exam | all of the above | none |
5/17, F | final exam, 11:15am-1:45pm: info |
  |
  |