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