Question

Euclid division lemma, find the largest number that divide 1251, 9377, 15628 living reminder 1,2,3. Brainly

Answer 1

Answer:

625

Step-by-step explanation:

1251-1=1250

9377-2=9375

15628-3=15625

take the HCF of 1250, 9375 and 15625

1250= 5×5×5×5×2

9375= 5×5×5×5×5×3

15625= 5×5×5×5×5×5×5

HCF = 5×5×5×5

       = 625

∴, the largest number that divides 1251, 9377, 15628 leaving remainder 1,2,3 is 625