Math, asked by vinay2629, 6 months ago

what is Euclid division algorithm?​

Answers

Answered by Anonymous
2

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.

Answered by SHREYASHJADHAV10
2

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.

Step-by-step explanation:

mark as brainliest plz

Similar questions