Saved Bookmarks
| 1. |
1.State the Euclid's division algorithm |
|
Answer» Hence, a common divisor of a and b is a common divisor of b and r. EuclidsDivision Algorithmis a technique to compute the Highest Common Factor (HCF) of two given positive integers. Recall that the HCF of two positive integers a and b is the largest positive integer d that divides both a and b. |
|