Skip Navigation Links
MATH 430 Fall 2009
Lecture Summary



Week Monday Tuesday Thursday Friday
1 (Sept 14-18) Introduction, Sequences (Chapter 1)
HW: (1.5) 2, 3, 8, 10, 13, 21, 38, 44, 46, 50, 56, 70
Division Algorithm, Divisibility (2.1) Greatest Common Divisor (2.2) Greatest Common Divisor, Euclidean Algorithm (2.2, 2.3)
HW: (2.6) 6, 9, 13, 14, 15, 16, 17, 18
2 (Sept 21-25) Furlough, Lab 1 Euclidean Algorithm (2.3) Pythagorean Triples (2.4)
HW: (2.4) 13 (2.6) 20, 21, 23, 25, 26, 27, 28, 29, 30, 34, 35, 36, 40, 49
Primes (3.1)
HW: (3.1) 1, 21, 25, 28 (3.8) 1, 6
3 (Sept 28-Oct 2) Lab 2 Number Theoretic Functions (3.2) Multiplicative Functions (3.3)
HW: (3.1) 13 (3.2) 1, 2, 6, 7, 8, 14, 40, 41 (3.3) 1, 11, 12, 13, 16, 19 (3.8) 22, 23
Furlough
4 (Oct 5-9) Furlough, Lab 3 Fermat's Factoring Algorithm (3.4), Greatest Integer Function (3.5) Prime Number Theorem and History (3.6) Prime Number Theorem and History (3.6)
HW: (3.4) 1, 5 (3.5) 2, 13 (3.6) 3, 4, 42, 43 (3.8) 24, 35, 36, 38, 40, 41, 43
5 (Oct 12-16) Test 1 Perfect Numbers, Amicable Numbers, Fermat Numbers (4.1, 4.2, 4.3) Modular Arithmetic (5.1) Divisibility Criteria (5.2), Euler phi-function (5.3)
HW: (4.1) 7, 9, 17 (even integers only) (4.2) 3, 8 (4.3) 2, 4 (4.5) 18 (5.1) 5, 6, 8, 19, 20, 22 (5.6) 5, 7
6 (Oct 19-23) Lab 4 Euler phi-function, Euler-Fermat Theorem (5.3) Linear Congruences (5.4) Linear Congruences (5.4)
HW: (5.1) 26 (5.2) 4 (5.3) 1, 2, 4, 8abcef, 9, 15, 23, 25, 28 (5.6) 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 43
7 (Oct 26-30) Lab 5 Linear Congruences (5.4) Polynomial Congruences, Hensel's Lemma (6.1) Quadratic Residues (6.2)
(5.6) 34, 37 (6.1) 1, 2, 3, 4, 5, 6, 8, 10 (6.5) 5, 9, 11, 13, 15
8 (Nov 2-6) Lab 6 Quadratic Residues (6.2) Quadratic Residues (6.2) Introduction to Cryptography (handout) Furlough
9 (Nov 9-13) Furlough, Lab 7 Introduction to Cryptography (handout) Primitive Roots (6.3) Primitive Roots (6.3)
10 (Nov 16-20) Test 2 Public-Key Cryptography (handout), RSA Review no class



clam@csub.edu