Computing the GCD
Completion requirements
View
The Euclidean algorithm is efficient for determining the greatest common divisor (GCD) between two numbers. Efficiently checking that two numbers are relatively prime is central to many cryptographic algorithms. This algorithm is an excellent choice for performing such a check.
Source: mathapptician, https://www.youtube.com/watch?v=mNSaAVvwHus
This work is licensed under a Creative Commons Attribution 3.0 License.