Question

What is Euclid Division Algorithm..?​

Answer 1

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.

Answer 2

Step-by-step explanation:

In arithmetic, Euclidean division — or division with remainder — is the process of dividing one integer by another, in such a way that produces a quotient and a remainder smaller than the divisor. Its main property is that the quotient and the remainder exist and are unique, under some conditions.....

hope this will help you

thank y