Question

Euclid's division algorithm is used to find the ____________ of two given positive integers.

Answer 1

Answer:

Euclid's division algorithm is used to find the HCF of two given positive integers.

IF HELPFUL PLS MARK AS BRAINLIST

Answer 2

ADDITIONAL INFORMATION :

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. 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. By exactly we mean that on dividing both the integers a and b the remainder is zero.

factor) two given positive integers.

ANSWER:

Euclid's division algorithm is used to find the hcf (highest common factor) of two given positive integers.