HCF of 99, 64 using Euclid's algorithm

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

Here 99 is greater than 64

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

Step 1: Since 99 > 64, we apply the division lemma to 99 and 64, to get

99 = 64 x 1 + 35

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

64 = 35 x 1 + 29

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

35 = 29 x 1 + 6

We consider the new divisor 29 and the new remainder 6,and apply the division lemma to get

29 = 6 x 4 + 5

We consider the new divisor 6 and the new remainder 5,and apply the division lemma to get

6 = 5 x 1 + 1

We consider the new divisor 5 and the new remainder 1,and apply the division lemma to get

5 = 1 x 5 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 99 and 64 is 1

Notice that 1 = HCF(5,1) = HCF(6,5) = HCF(29,6) = HCF(35,29) = HCF(64,35) = HCF(99,64) .

Therefore, HCF of 99,64 using Euclid's division lemma is 1.