Course Calendar

Please note:
MondayWednesdayFriday
Jan 1 - Jan 5 First day of class
Introduction, overview
Review: Notation, Induction
Begin §3: Divisibility
Jan 8 - Jan 12 Finish §3: Divisibility
§4: Representations of Integers
Finish §4
§5: The GCD
Finish §5
§6: The Euclidean Algorithm
Jan 15 - Jan 19 Finish §6
§7: Prime Numbers
§8: The Fundamental Theorem of Arithmetic Finish §8
Start §9: The LCM
Jan 22 - Jan 26 Finish §9: The LCM §10: Primes of the Form 4k + 3
§12: Irrational Numbers
§11: Diophantine Equations
Jan 29 - Feb 2 §13: Congruences (Introduction) §13: Congruences (Modular Arithmetic) §14, § 18:Applications of Congruences
Feb 5 - Feb 9 Finish §18 §15: The Congruence Method
§16: Linear Congruences in One Variable
Finish §16
Feb 12 - Feb 16 NO CLASS Review MIDTERM 1
Feb 19 - Feb 23 NO CLASS NO CLASS NO CLASS
Feb 26 - Mar 2 §17: The Chinese Remainder Theorem Finish §17
§19: Wilson's Theorem
§20: Fermat's Little Theorem
Finish §20
§21: Pseudoprimes
Mar 5 - Mar 9 §22: The Euler phi-function Finish §22
§23: Arithmetic Functions
Finish §23
§24: Formulas for some Arithmetic Functions
Mar 12 - Mar 16 §25: Perfect Numbers and Mersenne Primes §26: Primitive Roots Finish §26
Mar 19 - Mar 23 §27: Primitive Roots for Primes Review MIDTERM 2
Mar 26 - Mar 30 §28: Index Arithmetic and Discrete Logarithms Intro to Cryptography NO CLASS
Apr 2 - Apr 6 NO CLASS Crypto Final exam information and review
April 19, 3:30pm: Final Exam

Course outline

We will cover the following sections of the textbook, not necessarily in this order. Deviations from this plan may be necessary. Depending on time availability we will also cover some of the following topics: