Question

Used euclid division algorithm find hcf of 252 and 190

Answer 1

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 of 252 divided by 190 is 62.

Now, we carry out a mod operation with the previous divisor, 190, and the previous remainder, 62. We get 4.

We repeat the same operation with 62 and 4 and get 2.

Now, previous divisor, 4 mod previous remainder, 2, is 0.

When the remainder is 0, the divisor of the last operation, 2, is found to be the HCF of the first two numbers 252 and 190.