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

HCF of 5815, 9977 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 5815, 9977 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 5815, 9977 is 1.

HCF(5815, 9977) = 1

HCF of 5815, 9977 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 5815, 9977 is 1.

Highest Common Factor of 5815,9977 using Euclid's algorithm

Highest Common Factor of 5815,9977 is 1

Step 1: Since 9977 > 5815, we apply the division lemma to 9977 and 5815, to get

9977 = 5815 x 1 + 4162

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

5815 = 4162 x 1 + 1653

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

4162 = 1653 x 2 + 856

We consider the new divisor 1653 and the new remainder 856,and apply the division lemma to get

1653 = 856 x 1 + 797

We consider the new divisor 856 and the new remainder 797,and apply the division lemma to get

856 = 797 x 1 + 59

We consider the new divisor 797 and the new remainder 59,and apply the division lemma to get

797 = 59 x 13 + 30

We consider the new divisor 59 and the new remainder 30,and apply the division lemma to get

59 = 30 x 1 + 29

We consider the new divisor 30 and the new remainder 29,and apply the division lemma to get

30 = 29 x 1 + 1

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

29 = 1 x 29 + 0

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

Notice that 1 = HCF(29,1) = HCF(30,29) = HCF(59,30) = HCF(797,59) = HCF(856,797) = HCF(1653,856) = HCF(4162,1653) = HCF(5815,4162) = HCF(9977,5815) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 5815, 9977 using Euclid's Algorithm?

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