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