Michael Monagan, Simon Fraser University (4 lectures, 8 hours)
Lecture 1 : Integer multiplication: The highschool algorithm, Karatsuba's algorithm, their complexity, and what is known.
Video Lec1Anotes.pdf Lec1Bnotes.pdf Lec1Handouts.zipLecture 2 : Analysis of algorithms: O(f(n)), properties, examples. Maple tutorial.
Video Lec2Anotes.pdf Lec2Handouts.zipLecture 3 : Integer gcd: Euclid's and Stein's algorithms. Rings, fields, subrings, and zero divisors.
Video Lec3Anotes.pdf Lec3Bnotes.pdf Lec3Handouts.zipLecture 4 : Integral domains: division, gcds, primes, irreducibles, factorization. Euclidean domains.
Video Lec4Anotes.pdf Lec4Bnotes.pdf Lec5Handouts.zip