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

HCF of 389, 721, 490 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 389, 721, 490 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 389, 721, 490 is 1.

HCF(389, 721, 490) = 1

HCF of 389, 721, 490 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 389, 721, 490 is 1.

Highest Common Factor of 389,721,490 using Euclid's algorithm

Highest Common Factor of 389,721,490 is 1

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

721 = 389 x 1 + 332

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

389 = 332 x 1 + 57

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

332 = 57 x 5 + 47

We consider the new divisor 57 and the new remainder 47,and apply the division lemma to get

57 = 47 x 1 + 10

We consider the new divisor 47 and the new remainder 10,and apply the division lemma to get

47 = 10 x 4 + 7

We consider the new divisor 10 and the new remainder 7,and apply the division lemma to get

10 = 7 x 1 + 3

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

7 = 3 x 2 + 1

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

3 = 1 x 3 + 0

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

Notice that 1 = HCF(3,1) = HCF(7,3) = HCF(10,7) = HCF(47,10) = HCF(57,47) = HCF(332,57) = HCF(389,332) = HCF(721,389) .

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

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

490 = 1 x 490 + 0

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

Notice that 1 = HCF(490,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 389, 721, 490 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 389, 721, 490?

Answer: HCF of 389, 721, 490 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 389, 721, 490 using Euclid's Algorithm?

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