find HCF and LCM of 4040 and 960 by using euclid's division algorithm
Answers
We can find the HCF of the two numbers using Euclidean algorithm(working outlined in green) and then find the LCM using the formula outlined in yellow.
First, we find the remainder of the larger number divided by the smaller number i.e. we'll carry out a mod operation with the larger and smaller numbers.
The remainder is 200.
Now, we carry out a mod operation with the previous divisor, 960, and the previous remainder, 200. We get 160.
We repeat the same operation with 200 and 160 and get 40.
Previous divisor 160 mod previous remainder 40 is 0.
When the remainder is 0, the divisor of the last operation, 40, is found to be the HCF of the first two numbers 4040 and 960.
We know that the product of LCM and HCF of any two given natural numbers is equivalent to the product of the given numbers.
Thus after getting the HCF, we substitute it in the formula outlined in yellow and get the LCM as 96960.
