Question

What is Elucids division Algorithm ?
_____________________________

$\huge{\underline{\mathfrak{❥Shivuu❣}}}$
​

​

Answer 1

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.

Step-by-step explanation:

Nice name

Shivu

Answer 2

Step-by-step explanation:

$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.

Ello