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

HCF of 489, 793, 638 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, 793, 638 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, 793, 638 is 1.

HCF(489, 793, 638) = 1

HCF of 489, 793, 638 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, 793, 638 is 1.

Highest Common Factor of 489,793,638 using Euclid's algorithm

Highest Common Factor of 489,793,638 is 1

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

793 = 489 x 1 + 304

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

489 = 304 x 1 + 185

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

304 = 185 x 1 + 119

We consider the new divisor 185 and the new remainder 119,and apply the division lemma to get

185 = 119 x 1 + 66

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

119 = 66 x 1 + 53

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

66 = 53 x 1 + 13

We consider the new divisor 53 and the new remainder 13,and apply the division lemma to get

53 = 13 x 4 + 1

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

13 = 1 x 13 + 0

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

Notice that 1 = HCF(13,1) = HCF(53,13) = HCF(66,53) = HCF(119,66) = HCF(185,119) = HCF(304,185) = HCF(489,304) = HCF(793,489) .

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

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

638 = 1 x 638 + 0

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

Notice that 1 = HCF(638,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, 793, 638 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, 793, 638?

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

3. How to find HCF of 489, 793, 638 using Euclid's Algorithm?

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