Question

what is Euclid's division algorithm??​

Answer 1

Answer:

for example

412 =340x 1+ 72

340 =72x4+52

72=52x1+20

52=20x2+12

20=12x1+8

12=8x1+4

8=4x2+0

the last divisor 4 is the hcf

Answer 2

$\huge{\bigstar}}$$\huge{\boxed{\red{\mathfrak{Answer}}}}$$\huge{\bigstar}}$

_________________________

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.

Apply Euclid’s division lemma, to c and d. So, we find whole numbers, q and r such that

c = dq + r,

0 ≤ r < d.