explain Euclid's division algorithm
Answers
Answered by
1
Step-by-step explanation:
This is the answer......
If it helps u so please mark the answer a brainliest
Attachments:
Answered by
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.
Similar questions