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

HCF of 985, 6493 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 985, 6493 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 985, 6493 is 1.

HCF(985, 6493) = 1

HCF of 985, 6493 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 985, 6493 is 1.

Highest Common Factor of 985,6493 using Euclid's algorithm

Highest Common Factor of 985,6493 is 1

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

6493 = 985 x 6 + 583

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

985 = 583 x 1 + 402

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

583 = 402 x 1 + 181

We consider the new divisor 402 and the new remainder 181,and apply the division lemma to get

402 = 181 x 2 + 40

We consider the new divisor 181 and the new remainder 40,and apply the division lemma to get

181 = 40 x 4 + 21

We consider the new divisor 40 and the new remainder 21,and apply the division lemma to get

40 = 21 x 1 + 19

We consider the new divisor 21 and the new remainder 19,and apply the division lemma to get

21 = 19 x 1 + 2

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

19 = 2 x 9 + 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 985 and 6493 is 1

Notice that 1 = HCF(2,1) = HCF(19,2) = HCF(21,19) = HCF(40,21) = HCF(181,40) = HCF(402,181) = HCF(583,402) = HCF(985,583) = HCF(6493,985) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 985, 6493 using Euclid's Algorithm?

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