Saved Bookmarks
| 1. |
Find the answer by Euclids division method. |
|
Answer» ong>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. |
|