# HCF of 54, 36 using Euclid's algorithm

HCF of 54, 36 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., 18 the largest factor that exactly divides the numbers with r=0.

Highest common factor (HCF) of 54, 36 is 18.

HCF(54, 36) = 18

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

HCF of

## Determining HCF of Numbers 54,36 by Euclid's Division Lemma

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

Here 54 is greater than 36

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

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

54 = 36 x 1 + 18

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

36 = 18 x 2 + 0

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

Notice that 18 = HCF(36,18) = HCF(54,36) .

Therefore, HCF of 54,36 using Euclid's division lemma is 18.

### FAQs on HCF of 54, 36 using Euclid's Division Lemma Algorithm

1. What is the HCF(54, 36)?

The Highest common factor of 54, 36 is 18 the largest common factor that exactly divides two or more numbers with remainder 0.

2. How do you find HCF of 54, 36 using the Euclidean division algorithm?

According to the Euclidean division algorithm, if we have two integers say a, b ie., 54, 36 the largest number should satisfy Euclid's statement a = bq + r where 0 ≤ r < b and get the highest common factor of 54, 36 as 18.

3. Where can I get a detailed solution for finding the HCF(54, 36) by Euclid's division lemma method?

You can get a detailed solution for finding the HCF(54, 36) by Euclid's division lemma method on our page.