HCF of 80, 64, 48 using Euclid's algorithm

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

Here 80 is greater than 64

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

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

80 = 64 x 1 + 16

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

64 = 16 x 4 + 0

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

Notice that 16 = HCF(64,16) = HCF(80,64) .

We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma

Here 48 is greater than 16

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

Step 1: Since 48 > 16, we apply the division lemma to 48 and 16, to get

48 = 16 x 3 + 0

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

Notice that 16 = HCF(48,16) .

Therefore, HCF of 80,64,48 using Euclid's division lemma is 16.