# HCF of 45, 30 using Euclid's algorithm

HCF of 45, 30 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., 15 the largest factor that exactly divides the numbers with r=0.

Highest common factor (HCF) of 45, 30 is 15.

HCF(45, 30) = 15

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

HCF of

## Determining HCF of Numbers 45,30 by Euclid's Division Lemma

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

Here 45 is greater than 30

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

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

45 = 30 x 1 + 15

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

30 = 15 x 2 + 0

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

Notice that 15 = HCF(30,15) = HCF(45,30) .

Therefore, HCF of 45,30 using Euclid's division lemma is 15.

### FAQs on HCF of 45, 30 using Euclid's Division Lemma Algorithm

1. What is the HCF(45, 30)?

The Highest common factor of 45, 30 is 15 the largest common factor that exactly divides two or more numbers with remainder 0.

2. How do you find HCF of 45, 30 using the Euclidean division algorithm?

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

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

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