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