Question

Find the HCF of 64, 208 using Euclid division lemma method. ​

Answer 1

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

208 = 64 x 3 + 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 208 and 64 is 16

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

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

Answer 2

Answer:

HCF of 208,64 using Euclid's division lemma is 16.

Step-by-step explanation:

Here 208 > 64

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

Step 1: Since 208 is greater than 64, we apply the division lemma to 208 and 64, to get

208 = 64 x 3 + 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 208 and 64 is 16

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