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