Highest Common Factor of 1398, 6688 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 1398, 6688 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 1398, 6688 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 1398, 6688 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 1398, 6688 is 2.
HCF(1398, 6688) = 2
HCF of 1398, 6688 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 1398, 6688 is 2.
Highest Common Factor of 1398,6688 is 2
Step 1: Since 6688 > 1398, we apply the division lemma to 6688 and 1398, to get
6688 = 1398 x 4 + 1096
Step 2: Since the reminder 1398 ≠ 0, we apply division lemma to 1096 and 1398, to get
1398 = 1096 x 1 + 302
Step 3: We consider the new divisor 1096 and the new remainder 302, and apply the division lemma to get
1096 = 302 x 3 + 190
We consider the new divisor 302 and the new remainder 190,and apply the division lemma to get
302 = 190 x 1 + 112
We consider the new divisor 190 and the new remainder 112,and apply the division lemma to get
190 = 112 x 1 + 78
We consider the new divisor 112 and the new remainder 78,and apply the division lemma to get
112 = 78 x 1 + 34
We consider the new divisor 78 and the new remainder 34,and apply the division lemma to get
78 = 34 x 2 + 10
We consider the new divisor 34 and the new remainder 10,and apply the division lemma to get
34 = 10 x 3 + 4
We consider the new divisor 10 and the new remainder 4,and apply the division lemma to get
10 = 4 x 2 + 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 1398 and 6688 is 2
Notice that 2 = HCF(4,2) = HCF(10,4) = HCF(34,10) = HCF(78,34) = HCF(112,78) = HCF(190,112) = HCF(302,190) = HCF(1096,302) = HCF(1398,1096) = HCF(6688,1398) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 1398, 6688 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 1398, 6688?
Answer: HCF of 1398, 6688 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 1398, 6688 using Euclid's Algorithm?
Answer: For arbitrary numbers 1398, 6688 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.