find the largest number by Euclid division Lemma which divides 1251 9377 156 28 and leaving remainder 1 2 3 respectively
Answers
Answered by
1
Answer:
625
Step-by-step explanation:
Use Euclid's division algorithm find the largest number that divides 1251 9377 and 15628 leaving remainders 1 2 3 respectively
Hence, 625 is the largest number which divides 1251, 9377 and 15628 leaving remainder 1, 2 and 3, respectively.
Similar questions