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

HCF of 720, 938, 839 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 720, 938, 839 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 720, 938, 839 is 1.

HCF(720, 938, 839) = 1

HCF of 720, 938, 839 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 720, 938, 839 is 1.

Highest Common Factor of 720,938,839 using Euclid's algorithm

Highest Common Factor of 720,938,839 is 1

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

938 = 720 x 1 + 218

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

720 = 218 x 3 + 66

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

218 = 66 x 3 + 20

We consider the new divisor 66 and the new remainder 20,and apply the division lemma to get

66 = 20 x 3 + 6

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

20 = 6 x 3 + 2

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

6 = 2 x 3 + 0

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

Notice that 2 = HCF(6,2) = HCF(20,6) = HCF(66,20) = HCF(218,66) = HCF(720,218) = HCF(938,720) .

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

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

839 = 2 x 419 + 1

Step 2: Since the reminder 2 ≠ 0, we apply division lemma to 1 and 2, 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 2 and 839 is 1

Notice that 1 = HCF(2,1) = HCF(839,2) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 720, 938, 839 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 720, 938, 839?

Answer: HCF of 720, 938, 839 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 720, 938, 839 using Euclid's Algorithm?

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