Question

Explain Euclid's Division Algorithm !!!

Answer 1

Euclid's division algorithm is a way to find the HCF of two numbers by using Euclid's division lemma. It states that if there are any two integers a and b, there exists q and r such that it satisfies the given condition a = bq + r where 0 ≤ r < b.

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.

hope it helps you

please follow and mark as brainliest

Answer 2

Step-by-step explanation:

Euclid's division algorithm is a way to find the HCF of two numbers by using Euclid's division lemma. It states that if there are any two integers a and b, there exists q and r such that it satisfies the given condition a = bq + r where 0 ≤ r < b.

✪============♡============✿

$\huge \pink{✿} \red {C} \green {u} \blue {t} \orange {e} \pink {/} \red {Q} \blue {u} \pink {e} \red {e} \green {n} \pink {♡}$