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

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

HCF(8777, 9795) = 1

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

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

Highest Common Factor of 8777,9795 is 1

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

9795 = 8777 x 1 + 1018

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

8777 = 1018 x 8 + 633

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

1018 = 633 x 1 + 385

We consider the new divisor 633 and the new remainder 385,and apply the division lemma to get

633 = 385 x 1 + 248

We consider the new divisor 385 and the new remainder 248,and apply the division lemma to get

385 = 248 x 1 + 137

We consider the new divisor 248 and the new remainder 137,and apply the division lemma to get

248 = 137 x 1 + 111

We consider the new divisor 137 and the new remainder 111,and apply the division lemma to get

137 = 111 x 1 + 26

We consider the new divisor 111 and the new remainder 26,and apply the division lemma to get

111 = 26 x 4 + 7

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

26 = 7 x 3 + 5

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

7 = 5 x 1 + 2

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

5 = 2 x 2 + 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 8777 and 9795 is 1

Notice that 1 = HCF(2,1) = HCF(5,2) = HCF(7,5) = HCF(26,7) = HCF(111,26) = HCF(137,111) = HCF(248,137) = HCF(385,248) = HCF(633,385) = HCF(1018,633) = HCF(8777,1018) = HCF(9795,8777) .

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, 9795 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, 9795?

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

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

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