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

HCF of 5915, 8986 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 5915, 8986 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 5915, 8986 is 1.

HCF(5915, 8986) = 1

HCF of 5915, 8986 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 5915, 8986 is 1.

Highest Common Factor of 5915,8986 using Euclid's algorithm

Highest Common Factor of 5915,8986 is 1

Step 1: Since 8986 > 5915, we apply the division lemma to 8986 and 5915, to get

8986 = 5915 x 1 + 3071

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

5915 = 3071 x 1 + 2844

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

3071 = 2844 x 1 + 227

We consider the new divisor 2844 and the new remainder 227,and apply the division lemma to get

2844 = 227 x 12 + 120

We consider the new divisor 227 and the new remainder 120,and apply the division lemma to get

227 = 120 x 1 + 107

We consider the new divisor 120 and the new remainder 107,and apply the division lemma to get

120 = 107 x 1 + 13

We consider the new divisor 107 and the new remainder 13,and apply the division lemma to get

107 = 13 x 8 + 3

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

13 = 3 x 4 + 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 5915 and 8986 is 1

Notice that 1 = HCF(3,1) = HCF(13,3) = HCF(107,13) = HCF(120,107) = HCF(227,120) = HCF(2844,227) = HCF(3071,2844) = HCF(5915,3071) = HCF(8986,5915) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 5915, 8986 using Euclid's Algorithm?

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