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

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

Here 39 is greater than 26

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

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

39 = 26 x 1 + 13

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

26 = 13 x 2 + 0

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

Notice that 13 = HCF(26,13) = HCF(39,26) .

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

Here 52 is greater than 13

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

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

52 = 13 x 4 + 0

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

Notice that 13 = HCF(52,13) .

Therefore, HCF of 26,39,52 using Euclid's division lemma is 13.