Question

Euclid's division algorithm mainly used to compute the hcf of two positive integer ..true or false​

Answer 1

Answer:

I think it's true

Step-by-step explanation:

Euclids Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. ... So, we find whole numbers, q and r such that c = dq + r, 0 ≤ r < d. Step 2 : If r = 0, d is the HCF of c and d. If r ≠ 0, apply the division lemma to d and r.

Answer 2

Answer:

it totaly false by my thinking