Tentative Schedule, Math 4330 – Fall 08

Days Topics/Homework Section

9/3 Intro, review of pre-requisite material

9/5 Numbers, Sequences, and Sums 1.1

9/8 Mathematical Induction 1.2

9/10 Mathematical Induction (Continued), Fibonacci Numbers 1.2, 1.3

9/12 Divisibility 1.4

9/15 Divisibility (Continued) 1.4

9/17 Representations of Integers, Prime Numbers 2.1, 3.1

9/19 Prime Numbers 3.1

9/22 Greatest Common Divisors 3.2

9/24 Greatest Common Divisors Euclidean Algorithm 3.2, 3.3

9/26 Fundamental Theorem of Arithmetic 3.4

9/29 FTA (continued) 3.4

10/1 Linear Diophantine Equations 3.6

10/3 Introduction to Congruences 4.1

10/6 Linear Congruences 4.2

10/8 Test 1, Chapters 1-3

10/10 Linear Congruences (continued) 4.2

10/13 Chinese Remainder Theorem 4.3

10/15 Divisibility Tests 5.1

10/17 NO CLASSES

10/20 Divisibility Tests (continued) 5.1

10/22 Wilson’s Theorem, Fermat’s Little Theorem 6.1

10/24 Pseudo Primes 6.2

10/27 Euler’s Theorem 6.3

Note: 28 October is the last day to W-Drop

10/29 Test 2, Chapters 4-5.1

10/31 Euler Phi 7.1

11/3 Euler Phi, continued 7.1

11/5 Class cancelled

11/7 Introduction to the Proof of Fermat’s Last Theorem

11/10 Sum and Number of Divisors 7.2

11/12 Perfect Numbers and Mersenne Primes 7.3

11/14 Primitive Roots 9.1

11/17 Primitive Roots for Primes 9.1/9.2

11/19 Primitive Roots for Primes 9.2

11/21 Pythagorean Triples 13.1

11/24 Fermat’s Last Theorem 13.2

11/26 Sum of Squares 13.3

11/27-11/30 Fall Break

12/1 Character and Block and Stream Ciphers 8.1, 8.2

12/3 Test 3, Chapters 6, 7, 9, 13

12/5 Public Key Cryptography 8.3, 8.4

12/8,10 Knapsack Ciphers and Cryptographic Protocols 8.5, 8.6

12/12 Presentations

12/17 FINAL EXAM (Presentations), 10:00-11:52