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

HCF of 789, 572, 609 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 789, 572, 609 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 789, 572, 609 is 1.

HCF(789, 572, 609) = 1

HCF of 789, 572, 609 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 789, 572, 609 is 1.

Highest Common Factor of 789,572,609 using Euclid's algorithm

Highest Common Factor of 789,572,609 is 1

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

789 = 572 x 1 + 217

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

572 = 217 x 2 + 138

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

217 = 138 x 1 + 79

We consider the new divisor 138 and the new remainder 79,and apply the division lemma to get

138 = 79 x 1 + 59

We consider the new divisor 79 and the new remainder 59,and apply the division lemma to get

79 = 59 x 1 + 20

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

59 = 20 x 2 + 19

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

20 = 19 x 1 + 1

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

19 = 1 x 19 + 0

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

Notice that 1 = HCF(19,1) = HCF(20,19) = HCF(59,20) = HCF(79,59) = HCF(138,79) = HCF(217,138) = HCF(572,217) = HCF(789,572) .

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

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

609 = 1 x 609 + 0

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

Notice that 1 = HCF(609,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 789, 572, 609 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 789, 572, 609?

Answer: HCF of 789, 572, 609 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 789, 572, 609 using Euclid's Algorithm?

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