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