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

HCF of 6486, 8591, 13493 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 6486, 8591, 13493 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 6486, 8591, 13493 is 1.

HCF(6486, 8591, 13493) = 1

HCF of 6486, 8591, 13493 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 6486, 8591, 13493 is 1.

Highest Common Factor of 6486,8591,13493 using Euclid's algorithm

Highest Common Factor of 6486,8591,13493 is 1

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

8591 = 6486 x 1 + 2105

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

6486 = 2105 x 3 + 171

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

2105 = 171 x 12 + 53

We consider the new divisor 171 and the new remainder 53,and apply the division lemma to get

171 = 53 x 3 + 12

We consider the new divisor 53 and the new remainder 12,and apply the division lemma to get

53 = 12 x 4 + 5

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

12 = 5 x 2 + 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 6486 and 8591 is 1

Notice that 1 = HCF(2,1) = HCF(5,2) = HCF(12,5) = HCF(53,12) = HCF(171,53) = HCF(2105,171) = HCF(6486,2105) = HCF(8591,6486) .

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

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

13493 = 1 x 13493 + 0

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

Notice that 1 = HCF(13493,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 6486, 8591, 13493 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 6486, 8591, 13493?

Answer: HCF of 6486, 8591, 13493 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 6486, 8591, 13493 using Euclid's Algorithm?

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