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

HCF of 8777, 6792 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 8777, 6792 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 8777, 6792 is 1.

HCF(8777, 6792) = 1

HCF of 8777, 6792 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 8777, 6792 is 1.

Highest Common Factor of 8777,6792 using Euclid's algorithm

Highest Common Factor of 8777,6792 is 1

Step 1: Since 8777 > 6792, we apply the division lemma to 8777 and 6792, to get

8777 = 6792 x 1 + 1985

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

6792 = 1985 x 3 + 837

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

1985 = 837 x 2 + 311

We consider the new divisor 837 and the new remainder 311,and apply the division lemma to get

837 = 311 x 2 + 215

We consider the new divisor 311 and the new remainder 215,and apply the division lemma to get

311 = 215 x 1 + 96

We consider the new divisor 215 and the new remainder 96,and apply the division lemma to get

215 = 96 x 2 + 23

We consider the new divisor 96 and the new remainder 23,and apply the division lemma to get

96 = 23 x 4 + 4

We consider the new divisor 23 and the new remainder 4,and apply the division lemma to get

23 = 4 x 5 + 3

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

4 = 3 x 1 + 1

We consider the new divisor 3 and the new remainder 1,and apply the division lemma 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 8777 and 6792 is 1

Notice that 1 = HCF(3,1) = HCF(4,3) = HCF(23,4) = HCF(96,23) = HCF(215,96) = HCF(311,215) = HCF(837,311) = HCF(1985,837) = HCF(6792,1985) = HCF(8777,6792) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 8777, 6792 using Euclid's Algorithm?

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