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

HCF of 8004, 4981 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 8004, 4981 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 8004, 4981 is 1.

HCF(8004, 4981) = 1

HCF of 8004, 4981 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 8004, 4981 is 1.

Highest Common Factor of 8004,4981 using Euclid's algorithm

Highest Common Factor of 8004,4981 is 1

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

8004 = 4981 x 1 + 3023

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

4981 = 3023 x 1 + 1958

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

3023 = 1958 x 1 + 1065

We consider the new divisor 1958 and the new remainder 1065,and apply the division lemma to get

1958 = 1065 x 1 + 893

We consider the new divisor 1065 and the new remainder 893,and apply the division lemma to get

1065 = 893 x 1 + 172

We consider the new divisor 893 and the new remainder 172,and apply the division lemma to get

893 = 172 x 5 + 33

We consider the new divisor 172 and the new remainder 33,and apply the division lemma to get

172 = 33 x 5 + 7

We consider the new divisor 33 and the new remainder 7,and apply the division lemma to get

33 = 7 x 4 + 5

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

7 = 5 x 1 + 2

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

5 = 2 x 2 + 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 8004 and 4981 is 1

Notice that 1 = HCF(2,1) = HCF(5,2) = HCF(7,5) = HCF(33,7) = HCF(172,33) = HCF(893,172) = HCF(1065,893) = HCF(1958,1065) = HCF(3023,1958) = HCF(4981,3023) = HCF(8004,4981) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 8004, 4981 using Euclid's Algorithm?

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