HCF of 63, 94, 36 using Euclid's algorithm

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

Here 94 is greater than 63

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

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

94 = 63 x 1 + 31

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

63 = 31 x 2 + 1

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

31 = 1 x 31 + 0

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

Notice that 1 = HCF(31,1) = HCF(63,31) = HCF(94,63) .

We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma

Here 36 is greater than 1

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

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

36 = 1 x 36 + 0

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

Notice that 1 = HCF(36,1) .

Therefore, HCF of 63,94,36 using Euclid's division lemma is 1.