Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concepts of greatest common divisor (GCD) and least common multiple (LCM) of integers, including definitions, examples, and the Euclidean algorithm for efficient computation. It also discusses the correctness and complexity of the Euclidean algorithm.