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