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