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

HCF of 9792, 6011 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 9792, 6011 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 9792, 6011 is 1.

HCF(9792, 6011) = 1

HCF of 9792, 6011 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 9792, 6011 is 1.

Highest Common Factor of 9792,6011 using Euclid's algorithm

Highest Common Factor of 9792,6011 is 1

Step 1: Since 9792 > 6011, we apply the division lemma to 9792 and 6011, to get

9792 = 6011 x 1 + 3781

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

6011 = 3781 x 1 + 2230

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

3781 = 2230 x 1 + 1551

We consider the new divisor 2230 and the new remainder 1551,and apply the division lemma to get

2230 = 1551 x 1 + 679

We consider the new divisor 1551 and the new remainder 679,and apply the division lemma to get

1551 = 679 x 2 + 193

We consider the new divisor 679 and the new remainder 193,and apply the division lemma to get

679 = 193 x 3 + 100

We consider the new divisor 193 and the new remainder 100,and apply the division lemma to get

193 = 100 x 1 + 93

We consider the new divisor 100 and the new remainder 93,and apply the division lemma to get

100 = 93 x 1 + 7

We consider the new divisor 93 and the new remainder 7,and apply the division lemma to get

93 = 7 x 13 + 2

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

7 = 2 x 3 + 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 9792 and 6011 is 1

Notice that 1 = HCF(2,1) = HCF(7,2) = HCF(93,7) = HCF(100,93) = HCF(193,100) = HCF(679,193) = HCF(1551,679) = HCF(2230,1551) = HCF(3781,2230) = HCF(6011,3781) = HCF(9792,6011) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 9792, 6011 using Euclid's Algorithm?

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