Highest Common Factor of 9990, 6088 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 9990, 6088 i.e. 2 the largest integer that leaves a remainder zero for all numbers.

HCF of 9990, 6088 is 2 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 9990, 6088 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 9990, 6088 is 2.

HCF(9990, 6088) = 2

HCF of 9990, 6088 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 9990, 6088 is 2.

Highest Common Factor of 9990,6088 using Euclid's algorithm

Highest Common Factor of 9990,6088 is 2

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

9990 = 6088 x 1 + 3902

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

6088 = 3902 x 1 + 2186

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

3902 = 2186 x 1 + 1716

We consider the new divisor 2186 and the new remainder 1716,and apply the division lemma to get

2186 = 1716 x 1 + 470

We consider the new divisor 1716 and the new remainder 470,and apply the division lemma to get

1716 = 470 x 3 + 306

We consider the new divisor 470 and the new remainder 306,and apply the division lemma to get

470 = 306 x 1 + 164

We consider the new divisor 306 and the new remainder 164,and apply the division lemma to get

306 = 164 x 1 + 142

We consider the new divisor 164 and the new remainder 142,and apply the division lemma to get

164 = 142 x 1 + 22

We consider the new divisor 142 and the new remainder 22,and apply the division lemma to get

142 = 22 x 6 + 10

We consider the new divisor 22 and the new remainder 10,and apply the division lemma to get

22 = 10 x 2 + 2

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

10 = 2 x 5 + 0

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

Notice that 2 = HCF(10,2) = HCF(22,10) = HCF(142,22) = HCF(164,142) = HCF(306,164) = HCF(470,306) = HCF(1716,470) = HCF(2186,1716) = HCF(3902,2186) = HCF(6088,3902) = HCF(9990,6088) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 9990, 6088 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 9990, 6088?

Answer: HCF of 9990, 6088 is 2 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 9990, 6088 using Euclid's Algorithm?

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