Meet the concept↗
When the Euclidean algorithm yields a greatest common divisor of 1, it means the two input numbers are relatively prime (or coprime). This indicates that they share no common positive integer divisors other than 1.
Conditions: The inputs are natural numbers.; The Euclidean algorithm terminates with a last nonzero remainder of 1.
2:40 – 2:43Watch this moment ↗
When the Euclidean algorithm yields a greatest common divisor of 1, it means the two input numbers are relatively prime (or coprime). This indicates that they share no common positive integer divisors other than 1.
Conditions: The inputs are natural numbers.; The Euclidean algorithm terminates with a last nonzero remainder of 1.
2:40 – 2:43Watch this moment ↗