Question

What is Euclid's division algorithm; ​

Answer 1

Answer:

ᎻᎬY ᎷᎪᎢᎬ ᏌᎡ ᎪNᏚᏔᎬᎡ ᏆᏚ

════════◄••❀••►═════════

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

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...

mark it as brainliest...