Question

What is meant by Euclid's Division Algorithm?

Answer 1

If a and b are positive integers, then there exists two unique integers q, and r, such that a=bq+r. This method is very useful for finding the H.C.F. of large numbers where breaking them into factors is difficult. This is known as the Euclid's division algorithm.

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.