Question

state euclids alagarithm

Answer 1

Answer:

the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers (numbers), the largest number that divides them both without a remainder. ... When that occurs, they are the GCD of the original two numbers.