HCF of 18, 256, 284 using Euclid's algorithm

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

Here 256 is greater than 18

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

Step 1: Since 256 > 18, we apply the division lemma to 256 and 18, to get

256 = 18 x 14 + 4

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

18 = 4 x 4 + 2

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

4 = 2 x 2 + 0

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

Notice that 2 = HCF(4,2) = HCF(18,4) = HCF(256,18) .

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

Here 284 is greater than 2

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

Step 1: Since 284 > 2, we apply the division lemma to 284 and 2, to get

284 = 2 x 142 + 0

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

Notice that 2 = HCF(284,2) .

Therefore, HCF of 18,256,284 using Euclid's division lemma is 2.