HCF of 150, 64 using Euclid's algorithm

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

Here 150 is greater than 64

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

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

150 = 64 x 2 + 22

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

64 = 22 x 2 + 20

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

22 = 20 x 1 + 2

We consider the new divisor 20 and the new remainder 2, and apply the division lemma to get

20 = 2 x 10 + 0

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

Notice that 2 = HCF(20,2) = HCF(22,20) = HCF(64,22) = HCF(150,64) .

Therefore, HCF of 150,64 using Euclid's division lemma is 2.