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

HCF of 5316, 8981 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 5316, 8981 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 5316, 8981 is 1.

HCF(5316, 8981) = 1

HCF of 5316, 8981 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 5316, 8981 is 1.

Highest Common Factor of 5316,8981 using Euclid's algorithm

Highest Common Factor of 5316,8981 is 1

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

8981 = 5316 x 1 + 3665

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

5316 = 3665 x 1 + 1651

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

3665 = 1651 x 2 + 363

We consider the new divisor 1651 and the new remainder 363,and apply the division lemma to get

1651 = 363 x 4 + 199

We consider the new divisor 363 and the new remainder 199,and apply the division lemma to get

363 = 199 x 1 + 164

We consider the new divisor 199 and the new remainder 164,and apply the division lemma to get

199 = 164 x 1 + 35

We consider the new divisor 164 and the new remainder 35,and apply the division lemma to get

164 = 35 x 4 + 24

We consider the new divisor 35 and the new remainder 24,and apply the division lemma to get

35 = 24 x 1 + 11

We consider the new divisor 24 and the new remainder 11,and apply the division lemma to get

24 = 11 x 2 + 2

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

11 = 2 x 5 + 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 5316 and 8981 is 1

Notice that 1 = HCF(2,1) = HCF(11,2) = HCF(24,11) = HCF(35,24) = HCF(164,35) = HCF(199,164) = HCF(363,199) = HCF(1651,363) = HCF(3665,1651) = HCF(5316,3665) = HCF(8981,5316) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 5316, 8981 using Euclid's Algorithm?

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