Saved Bookmarks
| 1. |
Using Euclid's algorithm, find the largest number that divides 1251, 9377 and 15628 leaving remainders 1, 2, and 3 respectively. |
| Answer» Using Euclid's algorithm, find the largest number that divides 1251, 9377 and 15628 leaving remainders 1, 2, and 3 respectively. | |