HCF of 152, 96 using Euclid's algorithm

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

Here 152 is greater than 96

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

Step 1: Since 152 > 96, we apply the division lemma to 152 and 96, to get

152 = 96 x 1 + 56

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

96 = 56 x 1 + 40

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

56 = 40 x 1 + 16

We consider the new divisor 40 and the new remainder 16,and apply the division lemma to get

40 = 16 x 2 + 8

We consider the new divisor 16 and the new remainder 8,and apply the division lemma to get

16 = 8 x 2 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 8, the HCF of 152 and 96 is 8

Notice that 8 = HCF(16,8) = HCF(40,16) = HCF(56,40) = HCF(96,56) = HCF(152,96) .

Therefore, HCF of 152,96 using Euclid's division lemma is 8.