What is Euclid algorithm??

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

Thanks

The Euclidean algorithm is a way to find the greatest common divisor of two positive integers, a and b. First let me show the computations for a=210 and b=45.
Divide 210 by 45, and get the result 4 with remainder 30, so 210=4???45+30.
Divide 45 by 30, and get the result 1 with remainder 15, so 45=1???30+15.
Divide 30 by 15, and get the result 2 with remainder 0, so 30=2???15+0.
The greatest common divisor of 210 and 45 is 15.

In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor of two integers, the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements.
Regards...

Thanks

The Euclidean algorithm is an efficient method for computing the greatest common divisor of two integers, without explicitly factoring the two integers.

Wlcm...