Question

using euclid's division algorithm find the largest number that divides 1251,9377,15628 leaving remainder 1,2,3 are respectively

Answer 1

Required number is the HCF of (1251-1),(9377-2),15628-3)
so, the required number is 625.

Answer 2

Answer:

hope this helps you

please mark me brainliest