Question

What is Euclid's Division Algorithms ?
_______________________________________

(⌐■-■) I'm back

Hlo​

Answer 1

Answer:

$\Huge\colorbox{lightpink}{\pink{αηѕωєя}}$

Tu real wala h n ???

shivu hi h n ??

Answer 2

Answer:

$\sf \color{red}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.