Question

Define Euclid's Division Algorithm

Ntg...

have a good day... ​

Answer 1

Answer:

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.

___________

appki following Mai missteddybear hai

uska bi o tado