Summary
Summary Introduction to the Euclidean Algorithm and Greatest Common Divisor (GCD) in Number Theory.
- Course
- Institution
This document explains the concept of greatest common divisor (GCD) and the Euclidean algorithm, which is a commonly used algorithm to find the GCD of two numbers. It also discusses the importance of the least common multiple (LCM) and how the GCD can be used to find the LCM using a formula. The do...
[Show more]