Question

give me example of Euclid's Division Algorithm​

Answer 1

Answer:

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

Step-by-step explanation:

For example ...let us consider .... 100 and 30 ..

100= 30(3) + 10

30 = 10(3) + 0

.. the remainder is 0 ..

therefore ... 10 is the HCF of 100 and 30