HCF of 125, 64 using Euclid's algorithm

Below detailed show work will make you learn how to find HCF of 125,64 using the Euclidean division algorithm. So, follow the step by step explanation & check the answer for HCF(125,64).

Here 125 is greater than 64

Now, consider the largest number as 'a' from the given number ie., 125 and 64 satisfy Euclid's division lemma statement a = bq + r where 0 ≤ r < b

Step 1: Since 125 > 64, we apply the division lemma to 125 and 64, to get

125 = 64 x 1 + 61

Step 2: Since the reminder 64 ≠ 0, we apply division lemma to 61 and 64, to get

64 = 61 x 1 + 3

Step 3: We consider the new divisor 61 and the new remainder 3, and apply the division lemma to get

61 = 3 x 20 + 1

We consider the new divisor 3 and the new remainder 1, and apply the division lemma to get

3 = 1 x 3 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 125 and 64 is 1

Notice that 1 = HCF(3,1) = HCF(61,3) = HCF(64,61) = HCF(125,64) .

Therefore, HCF of 125,64 using Euclid's division lemma is 1.