Question

explan Euclid's division algorithm ​

Answer 1

Answer:

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.

Step-by-step explanation:

What is Euclid division algorithm?

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.

Answer 2

Answer:

Euclid division algorithm is also known as Euclid division lemma.

Step-by-step explanation:

Dividend = Divisor × quotient + remainder

D = Di × Q + R

Let's understand this by taking an example,

D = 10

Di= 3

10 = 3 × 3 + 1 - (1)

3 = 1 × 3 + 0 - (2)

The remainder has became zero.

Divisor of (2) is H.C.F of 10 and 3.

understand more on Google and solve some questions.