Question

Explain gcd recursion theorem with euclid algoriyhm

Answer 1

In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor GCD of two numbers, the largest number that divides both of them without leaving a remainder.