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