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