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

HCF of 490, 122 is 2 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 490, 122 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 490, 122 is 2.

HCF(490, 122) = 2

HCF of 490, 122 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 490, 122 is 2.

Highest Common Factor of 490,122 using Euclid's algorithm

Highest Common Factor of 490,122 is 2

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

490 = 122 x 4 + 2

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

122 = 2 x 61 + 0

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

Notice that 2 = HCF(122,2) = HCF(490,122) .

HCF using Euclid's Algorithm Calculation Examples

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

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

Answer: HCF of 490, 122 is 2 the largest number that divides all the numbers leaving a remainder zero.

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

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