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

HCF of 807, 51439 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 807, 51439 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 807, 51439 is 1.

HCF(807, 51439) = 1

HCF of 807, 51439 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 807, 51439 is 1.

Highest Common Factor of 807,51439 using Euclid's algorithm

Highest Common Factor of 807,51439 is 1

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

51439 = 807 x 63 + 598

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

807 = 598 x 1 + 209

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

598 = 209 x 2 + 180

We consider the new divisor 209 and the new remainder 180,and apply the division lemma to get

209 = 180 x 1 + 29

We consider the new divisor 180 and the new remainder 29,and apply the division lemma to get

180 = 29 x 6 + 6

We consider the new divisor 29 and the new remainder 6,and apply the division lemma to get

29 = 6 x 4 + 5

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

6 = 5 x 1 + 1

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

5 = 1 x 5 + 0

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

Notice that 1 = HCF(5,1) = HCF(6,5) = HCF(29,6) = HCF(180,29) = HCF(209,180) = HCF(598,209) = HCF(807,598) = HCF(51439,807) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 807, 51439 using Euclid's Algorithm?

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