Euclid's division algorithm is a technique to
compute the _ of two numbers
of 엉
the
two numbers.
Answers
Answered by
0
Answer
HCF
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.
Similar questions