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

HCF of 1789, 5885 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 1789, 5885 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 1789, 5885 is 1.

HCF(1789, 5885) = 1

HCF of 1789, 5885 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 1789, 5885 is 1.

Highest Common Factor of 1789,5885 using Euclid's algorithm

Highest Common Factor of 1789,5885 is 1

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

5885 = 1789 x 3 + 518

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

1789 = 518 x 3 + 235

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

518 = 235 x 2 + 48

We consider the new divisor 235 and the new remainder 48,and apply the division lemma to get

235 = 48 x 4 + 43

We consider the new divisor 48 and the new remainder 43,and apply the division lemma to get

48 = 43 x 1 + 5

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

43 = 5 x 8 + 3

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

5 = 3 x 1 + 2

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

3 = 2 x 1 + 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 1789 and 5885 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(5,3) = HCF(43,5) = HCF(48,43) = HCF(235,48) = HCF(518,235) = HCF(1789,518) = HCF(5885,1789) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 1789, 5885 using Euclid's Algorithm?

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