Question

what is euclids division algorithm formula​

Answer 1

Step-by-step explanation:

The basis of the Euclidean division algorithm is Euclid's division lemma. To calculate the Highest Common Factor (HCF) of two positive integers a and b we use Euclid's division algorithm. HCF is the largest number which exactly divides two or more positive integers.

Answer 2

Answer:

a= bq+r,

where b > q > r

For Example,

$40 = 20 \times 2 + 0$

PLS MARK AS BEST ANSWER AND THANK ME ❤️