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

HCF of 2987, 8090 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 2987, 8090 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 2987, 8090 is 1.

HCF(2987, 8090) = 1

HCF of 2987, 8090 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 2987, 8090 is 1.

Highest Common Factor of 2987,8090 using Euclid's algorithm

Highest Common Factor of 2987,8090 is 1

Step 1: Since 8090 > 2987, we apply the division lemma to 8090 and 2987, to get

8090 = 2987 x 2 + 2116

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

2987 = 2116 x 1 + 871

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

2116 = 871 x 2 + 374

We consider the new divisor 871 and the new remainder 374,and apply the division lemma to get

871 = 374 x 2 + 123

We consider the new divisor 374 and the new remainder 123,and apply the division lemma to get

374 = 123 x 3 + 5

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

123 = 5 x 24 + 3

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

5 = 3 x 1 + 2

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

3 = 2 x 1 + 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 2987 and 8090 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(5,3) = HCF(123,5) = HCF(374,123) = HCF(871,374) = HCF(2116,871) = HCF(2987,2116) = HCF(8090,2987) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 2987, 8090 using Euclid's Algorithm?

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