HCF of 51, 26, 39 using Euclid's algorithm

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

Here 51 is greater than 26

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

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

51 = 26 x 1 + 25

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

26 = 25 x 1 + 1

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

25 = 1 x 25 + 0

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

Notice that 1 = HCF(25,1) = HCF(26,25) = HCF(51,26) .

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

Here 39 is greater than 1

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

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

39 = 1 x 39 + 0

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

Notice that 1 = HCF(39,1) .

Therefore, HCF of 51,26,39 using Euclid's division lemma is 1.