Question

what do you mean by Euclid's division algorithm​

Answer 1

Answer:

The method of finding the greatest common divisor of two numbers by dividing the larger by the smaller, the smaller by the remainder, the first remainder by the second remainder, and so on until exact division is obtained whence the greatest common divisor is the exact divisor. — called also Euclid's algorithm.

HOPE IT HELPS...

Answer 2

Answer:

A method of finding the greatest common divisor of two numbers by dividing the larger by the smaller, the smaller by the remainder, the first remainder by the second remainder, and so on until exact division is obtained whence the greatest common divisor is the exact divisor. — called also Euclid's algorithm.