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

HCF of 981, 6721 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 981, 6721 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 981, 6721 is 1.

HCF(981, 6721) = 1

HCF of 981, 6721 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 981, 6721 is 1.

Highest Common Factor of 981,6721 using Euclid's algorithm

Highest Common Factor of 981,6721 is 1

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

6721 = 981 x 6 + 835

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

981 = 835 x 1 + 146

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

835 = 146 x 5 + 105

We consider the new divisor 146 and the new remainder 105,and apply the division lemma to get

146 = 105 x 1 + 41

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

105 = 41 x 2 + 23

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

41 = 23 x 1 + 18

We consider the new divisor 23 and the new remainder 18,and apply the division lemma to get

23 = 18 x 1 + 5

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

18 = 5 x 3 + 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 981 and 6721 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(5,3) = HCF(18,5) = HCF(23,18) = HCF(41,23) = HCF(105,41) = HCF(146,105) = HCF(835,146) = HCF(981,835) = HCF(6721,981) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 981, 6721 using Euclid's Algorithm?

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