Question

what is Euclid's division lemma..?​

Answer 1

Answer:

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.

Step-by-step explanation:

make me brainliest please

but your wish⬆️

Answer 2

$\huge\colorbox{pink}{Answer:࿐ }$

Euclid's Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. HCF of two positive integers a and b is the largest positive integer d that divides both a and b.

Step-by-step explanation:

☺️☺️