using euclid's division algorithm find largest number that divides 12 51, 9377 and 15628 leaving remainders 1,2 and 3 respectively
Answers
Answered by
2
find the H.C.F. of (1251-1=1250), (9377-2=9375) and (15628-3=15625).
Finding H.C.F. of 1250 and 9375:
9375 = 1250 X 7 + 625
1250 = 625 X 2 + 0
Since the remainder is zero, the H.C.F. is 625.
Finding H.C.F. of all three numbers:
15625 = 625 X 25 + 0.
Hence, 625 is the H.C.F. of all three numbers and divides 1251, 9377 and 15628 leaving a remainder of 1, 2 and 3 respectively
Finding H.C.F. of 1250 and 9375:
9375 = 1250 X 7 + 625
1250 = 625 X 2 + 0
Since the remainder is zero, the H.C.F. is 625.
Finding H.C.F. of all three numbers:
15625 = 625 X 25 + 0.
Hence, 625 is the H.C.F. of all three numbers and divides 1251, 9377 and 15628 leaving a remainder of 1, 2 and 3 respectively
Similar questions