The following is a tentative schedule of topics to be covered in each lecture. I reserve the right to change this schedule as pedagogic need dictates!
| Week 1 | |
| Wed May 28 | Introduction and overview 1.1: Numbers and sequences 1.3: Mathematical induction 1.4: Fibonacci numbers |
| Thu May 29 | 1.5:
Divisibility 3.1: Prime numbers 3.2: Distribution of primes |
| Week 2 | |
| Mon June 2 |
Homework 1 due 3.3: Greatest common divisors 3.4: Euclidean algorithm |
| Wed June 4 | 3.5:
Fundamental Theorem of Arithmetic 3.7: Linear Diophantine equations |
| Thu June 5 | Homework 2 due 4.1: Intro to Congruences 4.2: Linear Congruences |
| Week 3 | |
| Mon June 9 |
4.3: Chinese Remainder Theorem
5.1: Divisibility tests 5.5: Check digits |
| Wed June 11 |
Midterm 1 6.1: Wilson's Theorem and Fermat's Little Theorem |
| Thu June 12 |
6.2: Pseudoprimes 6.3: Euler's Theorem |
| Week 4 | |
| Mon June 16 |
Homework 3 due 7.1: The Euler phi function 7.2: The sum and number of divisors |
| Wed June 18 |
7.4: Moebius inversion 9.1: Order of an integer and primitive roots |
| Thu June 19 | Homework 4 due 9.2: Primitive roots for primes 9.4: Index arithmetic |
| Week 5 | |
| Mon June 23 |
11.1: Quadratic residues and nonresidues
11.2: Quadratic reciprocity |
| Wed June 25 |
Midterm 2 8.1: Intro to Cryptology |
| Thu June 26 |
Topics from Chapter 8 |
| Week 6 | |
| Mon June 2 |
Homework 5 due Topics from Chapters 8 and 10 |
| Wed July 2 | 11.5: Zero knowledge proofs concluding thoughts, review |
| Thu July 3 | Final exam |