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