find the greatest number that will divide 508 635 762 leaving remainde

1.	find the greatest number that will divide 508 635 762 leaving remainders 4 5 6
Answer» Subtract 4 , 5 and 6 respectively from 508, 635 and 762 we get the number 504, 630 and 756. Let a = 630 and b = 504 Euclid division algorithm 630 = 504 × 1 + 126 504 = 126 × 4 + 0 HCF (630,504) = 126 Find HCF of 756 and 126 756 = 126 × 6 + 0 HCF (756,126) = 126 Thus HCF of 504, 630 and 756 = 126 Hence the number is 126

find the greatest number that will divide 508 635 762 leaving remainders 4 5 6

Answer»

Subtract 4 , 5 and 6 respectively from 508, 635 and 762 we get the number 504, 630 and 756.

Let a = 630 and b = 504

Euclid division algorithm

630 = 504 × 1 + 126

504 = 126 × 4 + 0

HCF (630,504) = 126

Find HCF of 756 and 126

756 = 126 × 6 + 0

HCF (756,126) = 126

Thus

HCF of 504, 630 and 756 = 126

Hence the number is 126