January Lectures

Week of January 5-9

Jan 5: Course introduction. Operating with large integer numbers. Addition of numbers.
Jan 7: Addition of polynomials. Multiplication of polynomials.

Week of January 12-16

Jan 12: Multiplication of numbers. Division with remainder.
Jan 14: Greatest common divisors. GCD algorithms: Euclidean algorithm.

Week of January 19-23

Jan 19: Extended Euclidean algorithm and examples. Correctness of the EEA.
Jan 21: Correctness of the EEA (cont). Analysis of the EEA.

Week of January 26 - 30

Jan 26: Analysis of extended Euclidean algorithm (cont). Application: modular arithmetic.
Jan 28: Modular inverses. Inverse computations in finite fields.

To February lectures.