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

HCF of 8338, 9777 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 8338, 9777 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 8338, 9777 is 1.

HCF(8338, 9777) = 1

HCF of 8338, 9777 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 8338, 9777 is 1.

Highest Common Factor of 8338,9777 using Euclid's algorithm

Highest Common Factor of 8338,9777 is 1

Step 1: Since 9777 > 8338, we apply the division lemma to 9777 and 8338, to get

9777 = 8338 x 1 + 1439

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

8338 = 1439 x 5 + 1143

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

1439 = 1143 x 1 + 296

We consider the new divisor 1143 and the new remainder 296,and apply the division lemma to get

1143 = 296 x 3 + 255

We consider the new divisor 296 and the new remainder 255,and apply the division lemma to get

296 = 255 x 1 + 41

We consider the new divisor 255 and the new remainder 41,and apply the division lemma to get

255 = 41 x 6 + 9

We consider the new divisor 41 and the new remainder 9,and apply the division lemma to get

41 = 9 x 4 + 5

We consider the new divisor 9 and the new remainder 5,and apply the division lemma to get

9 = 5 x 1 + 4

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

5 = 4 x 1 + 1

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

4 = 1 x 4 + 0

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

Notice that 1 = HCF(4,1) = HCF(5,4) = HCF(9,5) = HCF(41,9) = HCF(255,41) = HCF(296,255) = HCF(1143,296) = HCF(1439,1143) = HCF(8338,1439) = HCF(9777,8338) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 8338, 9777 using Euclid's Algorithm?

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