Highest Common Factor of 9108, 1385 using Euclid's algorithm

Created By : Jatin Gogia

Reviewed By : Rajasekhar Valipishetty

Last Updated : Apr 06, 2023

HCF Calculator using the Euclid Division Algorithm helps you to find the Highest common factor (HCF) easily for 9108, 1385 i.e. 1 the largest integer that leaves a remainder zero for all numbers.

HCF of 9108, 1385 is 1 the largest number which exactly divides all the numbers i.e. where the remainder is zero. Let us get into the working of this example.

Consider we have numbers 9108, 1385 and we need to find the HCF of these numbers. To do so, we need to choose the largest integer first and then as per Euclid's Division Lemma a = bq + r where 0 ≤ r ≤ b

Highest common factor (HCF) of 9108, 1385 is 1.

HCF(9108, 1385) = 1

HCF of 9108, 1385 using Euclid's algorithm

Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.

HCF of:

Highest common factor (HCF) of 9108, 1385 is 1.

Highest Common Factor of 9108,1385 using Euclid's algorithm

Highest Common Factor of 9108,1385 is 1

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

9108 = 1385 x 6 + 798

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

1385 = 798 x 1 + 587

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

798 = 587 x 1 + 211

We consider the new divisor 587 and the new remainder 211,and apply the division lemma to get

587 = 211 x 2 + 165

We consider the new divisor 211 and the new remainder 165,and apply the division lemma to get

211 = 165 x 1 + 46

We consider the new divisor 165 and the new remainder 46,and apply the division lemma to get

165 = 46 x 3 + 27

We consider the new divisor 46 and the new remainder 27,and apply the division lemma to get

46 = 27 x 1 + 19

We consider the new divisor 27 and the new remainder 19,and apply the division lemma to get

27 = 19 x 1 + 8

We consider the new divisor 19 and the new remainder 8,and apply the division lemma to get

19 = 8 x 2 + 3

We consider the new divisor 8 and the new remainder 3,and apply the division lemma to get

8 = 3 x 2 + 2

We consider the new divisor 3 and the new remainder 2,and apply the division lemma to get

3 = 2 x 1 + 1

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

2 = 1 x 2 + 0

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

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(8,3) = HCF(19,8) = HCF(27,19) = HCF(46,27) = HCF(165,46) = HCF(211,165) = HCF(587,211) = HCF(798,587) = HCF(1385,798) = HCF(9108,1385) .

HCF using Euclid's Algorithm Calculation Examples

Here are some samples of HCF using Euclid's Algorithm calculations.

Frequently Asked Questions on HCF of 9108, 1385 using Euclid's Algorithm

1. What is the Euclid division algorithm?

Answer: Euclid's Division Algorithm is a technique to compute the Highest Common Factor (HCF) of given positive integers.

2. what is the HCF of 9108, 1385?

Answer: HCF of 9108, 1385 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 9108, 1385 using Euclid's Algorithm?

Answer: For arbitrary numbers 9108, 1385 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.