Number Theory
Last reloaded Monday Feb 13 2012 00:33:14

Lectures	Sections in Text	Brief Description
9/20	1.1 - 1.2	Numbers and Induction
9/22	1.3 - 1.4	Fibonacci numbers and divisibility
9/25	1.4, 3.1	Divisibility and Primes
9/27	3.2	Greatest Common Divisors
9/29	3.3	Euclidean algorithm
10/2	3.4, 3.6	FTA and Linear Diophantine Equations
10/4	3.6	Linear Diophantine Equations
10/6	4.1	Intro to congruences
10/9	4.1,4.2	Modular Exponentiation, Linear Congruences
10/11	4.2, 4.3	Linear Congruences, Chinese Remainder Theorem
10/13	4.3, 4.6	Examples CRT and Pollard rho factorization
10/16	4.6, 5.2	Examples of Pollard rho, and calendar problems
10/18	5.2, 5.3	Round Robin Tournaments
10/20	5.5	Check Digits
10/23	6.1	Wilson's and Fermat's Little Theorem
10/25	8	Cryptography Introduction
10/26 (x-hour)	8	Cryptography
10/30	4.5, 8.2	Systems of Congruences and the Hill cipher
11/1	6.3	Euler's Theorem
11/3	8.4	Public Key Cryptography and RSA
11/6	6.2	Pseudoprimes and Carmichael numbers
11/8	6.2	Strong Pseudoprimes and Miller-Rabin test
11/10	7.1, 7.2	Euler totient and divisor functions, multiplicative functions
11/13	7.2, 7.3	Perfect numbers, Mersenne primes, Lucas-Lehmer
11/15	7.4	Mobius Inversion
11/17	9.1	Orders of elements modulo n
11/20	9.1, 9.4	Primitive roots and Indices
11/27	9.4	kth power residues and Miller's test
11/29	9.4	Miller's test (other primality tests?)

Last modified on trs by 12 Nov 2000 Graphics by The Gimp.