Using euclids division algorithm find the largest number that divides 121,9377 and 1628 leaving remainder 1,2,3 respectively
Answers
Answered by
1
Just subtract
(121-1) = 120
(9377-2) = 9375
(1628-3) = 1625
Now try to find H. C. F
120, 1625, 9375
24, 325, 1875 ....... 5
THEREFORE The number is 5
(121-1) = 120
(9377-2) = 9375
(1628-3) = 1625
Now try to find H. C. F
120, 1625, 9375
24, 325, 1875 ....... 5
THEREFORE The number is 5
Similar questions