HCF of 104, 94 using Euclid's algorithm

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

Here 104 is greater than 94

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

Step 1: Since 104 > 94, we apply the division lemma to 104 and 94, to get

104 = 94 x 1 + 10

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

94 = 10 x 9 + 4

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

10 = 4 x 2 + 2

We consider the new divisor 4 and the new remainder 2, and apply the division lemma to get

4 = 2 x 2 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 104 and 94 is 2

Notice that 2 = HCF(4,2) = HCF(10,4) = HCF(94,10) = HCF(104,94) .

Therefore, HCF of 104,94 using Euclid's division lemma is 2.