No video available
Please refer to the materials section for this topic.
Euclidean algorithm and Bézout identity
Learning Objectives
- •Recursive and iterative Euclidean algorithm
- •Extended Euclidean algorithm
- •Linear Diophantine equations
- •Algorithmic complexity of gcd computations
Weekly Outcome
By the end of this module you will be able to prove core integer theorems, implement Euclidean algorithms, and reason rigorously in Z/nZ.