Question

what is Euclid division algorithm??​

Answer 1

Step-by-step explanation:

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

Answer 2

Euclid's 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.

Hope This Helps You ❤️