HCF of 7, 150, 392 using Euclid's algorithm

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

Here 150 is greater than 7

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

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

150 = 7 x 21 + 3

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

7 = 3 x 2 + 1

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

3 = 1 x 3 + 0

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

Notice that 1 = HCF(3,1) = HCF(7,3) = HCF(150,7) .

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

Here 392 is greater than 1

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

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

392 = 1 x 392 + 0

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

Notice that 1 = HCF(392,1) .

Therefore, HCF of 7,150,392 using Euclid's division lemma is 1.