![]() |
|
||||
Section (topics) |
By (date) |
Read (chapter) |
Practice (discuss) |
Homework
(submit) |
|
Part 1
Induction and Divisibility |
9/29 10/1 10/3 |
§1.1 Induction
(guide)
§1.2 Binomial Theorem (guide) §2.1 Early Number Theory (guide) |
Practice 1
solutions |
HW 1
Due 10/8 |
|
10/6 10/8 10/10 |
§2.2 Division Algorithm
(guide)
§2.3 Greatest Common Divisor (guide) §2.4 Euclid's Algorithm (guide) |
Practice 2
solutions |
HW 2
Due 10/15 |
||
10/13 10/15 10/17 |
§2.5 Diophantus' Equations
§3.1 Prime Factorization §3.2 Eratosthenes' Sieve |
||||
Exam One |
Weds Oct 22 |
Emphasizes HW 1,2,3* (optional)
|
|||
Part 2
Primes and Congruences |
10/24 10/27 10/29 |
§3.3 Goldbach's Conjecture
§4.2 Basic Congruences §4.3 Decimal Representations |
|||
11/3 11/5 11/7 |
§4.4 Sun-zi's Remainder Theorem
§5.2 Fermat's Little Theorem §5.3 Wilson's Theorem |
||||
11/10 11/12 11/14 |
§5.4 Fermat's Factorizations
§6.1 Sigma and Tau Functions §7.2 Euler's Phi Function |
||||
Exam Two |
Weds Nov 19 |
Emphasizes HW 4,5,6* (optional)
|
|||
Part 3
Special Numbers |
11/21 11/24 |
§7.3 Euler's Theorem
§8.1 Orders of Integers (mod n) |
|||
11/26 12/3 |
§8.2 Primitive Roots
§11.2 Perfect Numbers |
||||
Exam Three |
Weds Dec 10 |
10:15-12:05 - Cumulative
|