Question

What is Euclid's divison algorithm?​

Answer 1

Answer:

here is your answer

Step-by-step explanation:

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. To understand Euclid’s Division Algorithm we first need to understand Euclid’s Division Lemma.

Answer 2

☆Asked Question☆

What is Euclid's divison algorithm?

☆ Justified Answer ☆

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.

☆Know more☆

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. That means, on dividing both the integers a and b the remainder is zero.

☆Question By me☆

Neenga tamil?

$\mathcal\colorbox{yellow}{{\color{blue}{by \: iniyavan}}}$