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

HCF of 489, 9755, 2389 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 489, 9755, 2389 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 489, 9755, 2389 is 1.

HCF(489, 9755, 2389) = 1

HCF of 489, 9755, 2389 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 489, 9755, 2389 is 1.

Highest Common Factor of 489,9755,2389 using Euclid's algorithm

Highest Common Factor of 489,9755,2389 is 1

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

9755 = 489 x 19 + 464

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

489 = 464 x 1 + 25

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

464 = 25 x 18 + 14

We consider the new divisor 25 and the new remainder 14,and apply the division lemma to get

25 = 14 x 1 + 11

We consider the new divisor 14 and the new remainder 11,and apply the division lemma to get

14 = 11 x 1 + 3

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

11 = 3 x 3 + 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 489 and 9755 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(11,3) = HCF(14,11) = HCF(25,14) = HCF(464,25) = HCF(489,464) = HCF(9755,489) .

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

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

2389 = 1 x 2389 + 0

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

Notice that 1 = HCF(2389,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 489, 9755, 2389 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 489, 9755, 2389?

Answer: HCF of 489, 9755, 2389 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 489, 9755, 2389 using Euclid's Algorithm?

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