HCF of 39, 52 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., 13 the largest factor that exactly divides the numbers with r=0.
Highest common factor (HCF) of 39, 52 is 13.
HCF(39, 52) = 13
Ex: 10, 15, 20 (or) 24, 48, 96,45 (or) 78902, 89765, 12345
Below detailed show work will make you learn how to find HCF of 39,52 using the Euclidean division algorithm. So, follow the step by step explanation & check the answer for HCF(39,52).
Here 52 is greater than 39
Now, consider the largest number as 'a' from the given number ie., 52 and 39 satisfy Euclid's division lemma statement a = bq + r where 0 ≤ r < b
Step 1: Since 52 > 39, we apply the division lemma to 52 and 39, to get
52 = 39 x 1 + 13
Step 2: Since the reminder 39 ≠ 0, we apply division lemma to 13 and 39, to get
39 = 13 x 3 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 13, the HCF of 39 and 52 is 13
Notice that 13 = HCF(39,13) = HCF(52,39) .
Therefore, HCF of 39,52 using Euclid's division lemma is 13.
1. What is the HCF(39, 52)?
The Highest common factor of 39, 52 is 13 the largest common factor that exactly divides two or more numbers with remainder 0.
2. How do you find HCF of 39, 52 using the Euclidean division algorithm?
According to the Euclidean division algorithm, if we have two integers say a, b ie., 39, 52 the largest number should satisfy Euclid's statement a = bq + r where 0 ≤ r < b and get the highest common factor of 39, 52 as 13.
3. Where can I get a detailed solution for finding the HCF(39, 52) by Euclid's division lemma method?
You can get a detailed solution for finding the HCF(39, 52) by Euclid's division lemma method on our page.