# HCF of 39, 59 using Euclid's algorithm

HCF of 39, 59 by Euclid's Divison lemma method can be determined easily by using our free online HCF using Euclid's Divison Lemma Calculator and get the result in a fraction of seconds ie., 1 the largest factor that exactly divides the numbers with r=0.

Highest common factor (HCF) of 39, 59 is 1.

HCF(39, 59) = 1

Ex: 10, 15, 20 (or) 24, 48, 96,45 (or) 78902, 89765, 12345

HCF of

## Determining HCF of Numbers 39,59 by Euclid's Division Lemma

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

Here 59 is greater than 39

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

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

59 = 39 x 1 + 20

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

39 = 20 x 1 + 19

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

20 = 19 x 1 + 1

We consider the new divisor 19 and the new remainder 1, and apply the division lemma to get

19 = 1 x 19 + 0

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

Notice that 1 = HCF(19,1) = HCF(20,19) = HCF(39,20) = HCF(59,39) .

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

### HCF using Euclid's Algorithm Calculation Examples

Here are some samples of HCF using Euclid's Algorithm calculations.

### FAQs on HCF of 39, 59 using Euclid's Division Lemma Algorithm

1. What is the HCF(39, 59)?

The Highest common factor of 39, 59 is 1 the largest common factor that exactly divides two or more numbers with remainder 0.

2. How do you find HCF of 39, 59 using the Euclidean division algorithm?

According to the Euclidean division algorithm, if we have two integers say a, b ie., 39, 59 the largest number should satisfy Euclid's statement a = bq + r where 0 ≤ r < b and get the highest common factor of 39, 59 as 1.

3. Where can I get a detailed solution for finding the HCF(39, 59) by Euclid's division lemma method?

You can get a detailed solution for finding the HCF(39, 59) by Euclid's division lemma method on our page.