Question

Define Euclid's division lemma and algorithm

Answer 1

Answer:

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.

pls folow me and I mark me as brainlist

Answer 2

$\huge\orange{\boxed{\purple{\mathbb{\overbrace{\underbrace{\fcolorbox{orange}{aqua}{\underline{\red{☠ Answer ☠}}}}}}}}}$

So, according to Euclid's Division Lemma, if we have two positive integers a and b, then there would be whole numbers q and r that satisfy the equation: a = bq + r, where 0 ≤ r < b. a is the dividend. b is the divisor. q is the quotient and r is the remainder. By using this lemma, we can find the HCF of two numbers.

• Hope it will helps ✅