Question

hye guys...
what is meant by euclids division algorithm...​

Answer 1

Answer:

Hence, a common divisor of a and b is a common divisor of b and r. Euclids Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. Recall that the HCF of two positive integers a and b is the largest positive integer d that divides both a and b.

Answer 2

Answer:

Euclids Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. Recall that the HCF of two positive integers a and b is the largest positive integer d that divides both a and b.

HOPE IT HELPS YOU.