Question

a = -17, b = -3 Euclid division lemma

Answer 1

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. ... To calculate the Highest Common Factor (HCF) of two positive integers a and b we use Euclid's division algorithm.