LCM Calculator GCF Calculator GCD Calculator LCM of Two or More Numbers Calculator GCF of Two or More Numbers Calculator Factoring Calculator Prime Factorisation Calculator HCF Using Euclid's division lemma Calculator Factor Tree Calculator LCM of Decimals Calculator GCF of Decimals Calculator GCF of Fractions Calculator LCM of Fractions Calculator GCF and LCM Calculator

HCF of 9, 156, 169 using Euclid's algorithm

HCF of 9, 156, 169 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., 1 the largest factor that exactly divides the numbers with r=0.

Highest common factor (HCF) of 9, 156, 169 is 1.

HCF(9, 156, 169) = 1

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

HCF of

Determining HCF of Numbers 9,156,169 by Euclid's Division Lemma

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

Here 156 is greater than 9

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

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

156 = 9 x 17 + 3

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

9 = 3 x 3 + 0

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

Notice that 3 = HCF(9,3) = HCF(156,9) .


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

Here 169 is greater than 3

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

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

169 = 3 x 56 + 1

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

3 = 1 x 3 + 0

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

Notice that 1 = HCF(3,1) = HCF(169,3) .

Therefore, HCF of 9,156,169 using Euclid's division lemma is 1.

FAQs on HCF of 9, 156, 169 using Euclid's Division Lemma Algorithm

1. What is the HCF(9, 156, 169)?

The Highest common factor of 9, 156, 169 is 1 the largest common factor that exactly divides two or more numbers with remainder 0.


2. How do you find HCF of 9, 156, 169 using the Euclidean division algorithm?

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


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

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