Highest Common Factor of 898, 490, 668, 12 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 898, 490, 668, 12 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 898, 490, 668, 12 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 898, 490, 668, 12 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 898, 490, 668, 12 is 2.
HCF(898, 490, 668, 12) = 2
HCF of 898, 490, 668, 12 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 898, 490, 668, 12 is 2.
Highest Common Factor of 898,490,668,12 is 2
Step 1: Since 898 > 490, we apply the division lemma to 898 and 490, to get
898 = 490 x 1 + 408
Step 2: Since the reminder 490 ≠ 0, we apply division lemma to 408 and 490, to get
490 = 408 x 1 + 82
Step 3: We consider the new divisor 408 and the new remainder 82, and apply the division lemma to get
408 = 82 x 4 + 80
We consider the new divisor 82 and the new remainder 80,and apply the division lemma to get
82 = 80 x 1 + 2
We consider the new divisor 80 and the new remainder 2,and apply the division lemma to get
80 = 2 x 40 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 898 and 490 is 2
Notice that 2 = HCF(80,2) = HCF(82,80) = HCF(408,82) = HCF(490,408) = HCF(898,490) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 668 > 2, we apply the division lemma to 668 and 2, to get
668 = 2 x 334 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 2 and 668 is 2
Notice that 2 = HCF(668,2) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 12 > 2, we apply the division lemma to 12 and 2, to get
12 = 2 x 6 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 2 and 12 is 2
Notice that 2 = HCF(12,2) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 898, 490, 668, 12 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 898, 490, 668, 12?
Answer: HCF of 898, 490, 668, 12 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 898, 490, 668, 12 using Euclid's Algorithm?
Answer: For arbitrary numbers 898, 490, 668, 12 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.
