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

HCF of 801, 1307, 9987 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 801, 1307, 9987 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 801, 1307, 9987 is 1.

HCF(801, 1307, 9987) = 1

HCF of 801, 1307, 9987 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 801, 1307, 9987 is 1.

Highest Common Factor of 801,1307,9987 using Euclid's algorithm

Highest Common Factor of 801,1307,9987 is 1

Step 1: Since 1307 > 801, we apply the division lemma to 1307 and 801, to get

1307 = 801 x 1 + 506

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

801 = 506 x 1 + 295

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

506 = 295 x 1 + 211

We consider the new divisor 295 and the new remainder 211,and apply the division lemma to get

295 = 211 x 1 + 84

We consider the new divisor 211 and the new remainder 84,and apply the division lemma to get

211 = 84 x 2 + 43

We consider the new divisor 84 and the new remainder 43,and apply the division lemma to get

84 = 43 x 1 + 41

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

43 = 41 x 1 + 2

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

41 = 2 x 20 + 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 801 and 1307 is 1

Notice that 1 = HCF(2,1) = HCF(41,2) = HCF(43,41) = HCF(84,43) = HCF(211,84) = HCF(295,211) = HCF(506,295) = HCF(801,506) = HCF(1307,801) .

We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma

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

9987 = 1 x 9987 + 0

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

Notice that 1 = HCF(9987,1) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 801, 1307, 9987 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 801, 1307, 9987?

Answer: HCF of 801, 1307, 9987 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 801, 1307, 9987 using Euclid's Algorithm?

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