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