what is Euclid division algorithm?
Answers
Answered by
28
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.
Answered by
91
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.
Similar questions
Math,
17 hours ago
English,
17 hours ago
Physics,
17 hours ago
Computer Science,
1 day ago
Hindi,
7 months ago