Question

What is Euclid's Division Algorithms ?

✧ ha mai hi hu ree​

Answer 1

Answer:

$\large{\underbrace{\underline{\color{magenta}{\bf{Answer-}}}}}$

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.