Question

what is euclids division

Answer 1

Answer:

*Euclid's Division Lemma: ... The basis of Euclidean division algorithm is Euclid's division lemma. To calculate the Highest Common Factor (HCF) of two positive integers a and b we use Euclid's division algorithm. HCF is the largest number which exactly divides two or more positive integers.

*According to Euclid's Division Lemma if we have two positive integers a and b, then there exist unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b. The basis of the Euclidean division algorithm is Euclid's division lemma.

Answer 2

Step-by-step explanation:

In arithmetic, Euclidean division is the process of division of two integers, which produces a quotient and a remainder smaller than the divisor. Its main property is that the quotient and remainder exist and are unique, under some conditions.

Hope this will help u