Question

what is the HCF of 136 & 85 using ecuids division lemma​

Answer 1

Step-by-step explanation:

lineCalculator.Guru

LCM Calculator GCF Calculator GCD Calculator LCM of Two or More Numbers Calculator GCF of Two or More Numbers Calculator Factoring Calculator Prime Factorisation Calculator HCF Using Euclid's division lemma Calculator Factor Tree Calculator LCM of Decimals Calculator GCF of Decimals Calculator GCF of Fractions Calculator LCM of Fractions Calculator GCF and LCM Calculator

HCF of 136, 85 using Euclid's algorithm

HCF of 136, 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 136, 85 is 17.

HCF(136, 85) = 17

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

HCF of

HCF of

Calculate

Determining HCF of Numbers 136,85 by Euclid's Division Lemma

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

Here 136 is greater than 85

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

Step 1: Since 136 > 85, we apply the division lemma to 136 and 85, to get

136 = 85 x 1 + 51

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

85 = 51 x 1 + 34

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

51 = 34 x 1 + 17

We consider the new divisor 34 and the new remainder 17, and apply the division lemma to get

34 = 17 x 2 + 0

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

Notice that 17 = HCF(34,17) = HCF(51,34) = HCF(85,51) = HCF(136,85) .

please mark me as brainliest