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